YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:30:42,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:30:42,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:30:42,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:30:42,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:30:42,156 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:30:42,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:30:42,159 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:30:42,161 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:30:42,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:30:42,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:30:42,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:30:42,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:30:42,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:30:42,165 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:30:42,166 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:30:42,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:30:42,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:30:42,170 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:30:42,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:30:42,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:30:42,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:30:42,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:30:42,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:30:42,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:30:42,177 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:30:42,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:30:42,178 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:30:42,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:30:42,179 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:30:42,180 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:30:42,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:30:42,181 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:30:42,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:30:42,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:30:42,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:30:42,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:30:42,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:30:42,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:30:42,184 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:30:42,198 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:30:42,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:30:42,200 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:30:42,200 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:30:42,200 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:30:42,200 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:30:42,201 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:30:42,201 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:30:42,201 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:30:42,201 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:30:42,201 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:30:42,201 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:30:42,202 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:30:42,202 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:30:42,202 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:30:42,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:30:42,202 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:30:42,202 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:30:42,203 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:30:42,203 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:30:42,203 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:30:42,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:30:42,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:30:42,203 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:30:42,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:30:42,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:30:42,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:30:42,204 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:30:42,204 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:30:42,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:30:42,243 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:30:42,246 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:30:42,247 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:30:42,248 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:30:42,248 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:30:42,311 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/f836ff00adfd46a48ced7429ff967351/FLAGbb8b289e0 [2020-06-22 09:30:42,664 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:30:42,665 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:30:42,665 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:30:42,672 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/f836ff00adfd46a48ced7429ff967351/FLAGbb8b289e0 [2020-06-22 09:30:43,079 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/f836ff00adfd46a48ced7429ff967351 [2020-06-22 09:30:43,091 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:30:43,092 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:30:43,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:30:43,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:30:43,097 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:30:43,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba3a07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43, skipping insertion in model container [2020-06-22 09:30:43,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:30:43,127 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:30:43,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:30:43,354 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:30:43,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:30:43,387 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:30:43,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43 WrapperNode [2020-06-22 09:30:43,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:30:43,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:30:43,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:30:43,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:30:43,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:30:43,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:30:43,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:30:43,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:30:43,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:30:43,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:30:43,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:30:43,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:30:43,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:30:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:30:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:30:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:30:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:30:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:30:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:30:43,733 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:30:43,733 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:30:43,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:43 BoogieIcfgContainer [2020-06-22 09:30:43,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:30:43,735 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:30:43,735 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:30:43,737 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:30:43,738 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,756 INFO L313 BlockEncoder]: Initial Icfg 27 locations, 31 edges [2020-06-22 09:30:43,758 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:30:43,759 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:30:43,759 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:30:43,760 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:30:43,761 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:30:43,762 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:30:43,763 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:30:43,791 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:30:43,823 INFO L200 BlockEncoder]: SBE split 12 edges [2020-06-22 09:30:43,828 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:30:43,829 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:30:43,851 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 09:30:43,853 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-06-22 09:30:43,855 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:30:43,855 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:30:43,855 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:30:43,856 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:30:43,856 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 42 edges [2020-06-22 09:30:43,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:43 BasicIcfg [2020-06-22 09:30:43,857 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:30:43,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:30:43,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:30:43,861 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:30:43,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:30:43" (1/4) ... [2020-06-22 09:30:43,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a724ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:30:43, skipping insertion in model container [2020-06-22 09:30:43,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (2/4) ... [2020-06-22 09:30:43,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a724ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:30:43, skipping insertion in model container [2020-06-22 09:30:43,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:43" (3/4) ... [2020-06-22 09:30:43,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a724ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:43, skipping insertion in model container [2020-06-22 09:30:43,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:43" (4/4) ... [2020-06-22 09:30:43,865 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:30:43,875 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:30:43,883 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-06-22 09:30:43,899 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-06-22 09:30:43,928 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:30:43,928 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:30:43,929 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:30:43,929 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:30:43,929 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:30:43,929 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:30:43,929 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:30:43,929 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:30:43,929 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:30:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-06-22 09:30:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:30:43,950 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:43,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:30:43,951 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 4971540, now seen corresponding path program 1 times [2020-06-22 09:30:43,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:43,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:44,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:44,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,131 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-06-22 09:30:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:44,249 INFO L93 Difference]: Finished difference Result 32 states and 74 transitions. [2020-06-22 09:30:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:44,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:30:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:44,264 INFO L225 Difference]: With dead ends: 32 [2020-06-22 09:30:44,264 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:30:44,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:30:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:30:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:30:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2020-06-22 09:30:44,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 4 [2020-06-22 09:30:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:44,304 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 38 transitions. [2020-06-22 09:30:44,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2020-06-22 09:30:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:30:44,305 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:30:44,306 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,306 INFO L82 PathProgramCache]: Analyzing trace with hash 4971542, now seen corresponding path program 1 times [2020-06-22 09:30:44,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:44,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:30:44,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:30:44,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:30:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:30:44,339 INFO L87 Difference]: Start difference. First operand 18 states and 38 transitions. Second operand 4 states. [2020-06-22 09:30:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:44,412 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. [2020-06-22 09:30:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:30:44,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 09:30:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:44,413 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:30:44,413 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:30:44,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:30:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:30:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:30:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:30:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2020-06-22 09:30:44,418 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 4 [2020-06-22 09:30:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:44,419 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2020-06-22 09:30:44,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:30:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2020-06-22 09:30:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:30:44,419 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:30:44,420 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash 4971543, now seen corresponding path program 1 times [2020-06-22 09:30:44,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:44,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:44,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:44,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:44,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,447 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 3 states. [2020-06-22 09:30:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:44,512 INFO L93 Difference]: Finished difference Result 18 states and 37 transitions. [2020-06-22 09:30:44,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:44,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:30:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:44,514 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:30:44,514 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 09:30:44,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 09:30:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 09:30:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 09:30:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2020-06-22 09:30:44,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 36 transitions. Word has length 4 [2020-06-22 09:30:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:44,518 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 36 transitions. [2020-06-22 09:30:44,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 36 transitions. [2020-06-22 09:30:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:30:44,519 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:30:44,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,519 INFO L82 PathProgramCache]: Analyzing trace with hash 154118868, now seen corresponding path program 1 times [2020-06-22 09:30:44,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:44,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:44,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:44,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:44,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,547 INFO L87 Difference]: Start difference. First operand 17 states and 36 transitions. Second operand 3 states. [2020-06-22 09:30:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:44,603 INFO L93 Difference]: Finished difference Result 17 states and 36 transitions. [2020-06-22 09:30:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:44,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:30:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:44,605 INFO L225 Difference]: With dead ends: 17 [2020-06-22 09:30:44,605 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 09:30:44,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 09:30:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 09:30:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:30:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2020-06-22 09:30:44,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 5 [2020-06-22 09:30:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:44,609 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. [2020-06-22 09:30:44,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. [2020-06-22 09:30:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:30:44,610 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:30:44,610 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash 154118870, now seen corresponding path program 1 times [2020-06-22 09:30:44,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:44,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:30:44,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:30:44,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:30:44,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:30:44,650 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 4 states. [2020-06-22 09:30:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:44,738 INFO L93 Difference]: Finished difference Result 27 states and 54 transitions. [2020-06-22 09:30:44,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:30:44,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:30:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:44,740 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:30:44,740 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:30:44,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:30:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2020-06-22 09:30:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:30:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 51 transitions. [2020-06-22 09:30:44,745 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 51 transitions. Word has length 5 [2020-06-22 09:30:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:44,746 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 51 transitions. [2020-06-22 09:30:44,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:30:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 51 transitions. [2020-06-22 09:30:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:30:44,746 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:30:44,747 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash 154118871, now seen corresponding path program 1 times [2020-06-22 09:30:44,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:44,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:30:44,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:30:44,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:30:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:44,800 INFO L87 Difference]: Start difference. First operand 21 states and 51 transitions. Second operand 5 states. [2020-06-22 09:30:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:44,912 INFO L93 Difference]: Finished difference Result 24 states and 51 transitions. [2020-06-22 09:30:44,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:30:44,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-06-22 09:30:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:44,913 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:30:44,913 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 09:30:44,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 09:30:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 09:30:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:30:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2020-06-22 09:30:44,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 47 transitions. Word has length 5 [2020-06-22 09:30:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:44,918 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 47 transitions. [2020-06-22 09:30:44,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:30:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 47 transitions. [2020-06-22 09:30:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 09:30:44,919 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:44,919 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1069293027, now seen corresponding path program 1 times [2020-06-22 09:30:44,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:44,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:30:44,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,945 INFO L87 Difference]: Start difference. First operand 20 states and 47 transitions. Second operand 3 states. [2020-06-22 09:30:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,022 INFO L93 Difference]: Finished difference Result 35 states and 79 transitions. [2020-06-22 09:30:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:45,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 09:30:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,023 INFO L225 Difference]: With dead ends: 35 [2020-06-22 09:30:45,024 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:30:45,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:30:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-06-22 09:30:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:30:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2020-06-22 09:30:45,029 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 49 transitions. Word has length 9 [2020-06-22 09:30:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,029 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 49 transitions. [2020-06-22 09:30:45,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 49 transitions. [2020-06-22 09:30:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 09:30:45,030 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1069322818, now seen corresponding path program 1 times [2020-06-22 09:30:45,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:30:45,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:45,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:45,056 INFO L87 Difference]: Start difference. First operand 22 states and 49 transitions. Second operand 3 states. [2020-06-22 09:30:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,112 INFO L93 Difference]: Finished difference Result 37 states and 86 transitions. [2020-06-22 09:30:45,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:45,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 09:30:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,113 INFO L225 Difference]: With dead ends: 37 [2020-06-22 09:30:45,114 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 09:30:45,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 09:30:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 09:30:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:30:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2020-06-22 09:30:45,118 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 9 [2020-06-22 09:30:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,118 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 42 transitions. [2020-06-22 09:30:45,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 42 transitions. [2020-06-22 09:30:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:30:45,119 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,119 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1091888932, now seen corresponding path program 1 times [2020-06-22 09:30:45,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:45,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:45,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 09:30:45,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 09:30:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 09:30:45,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:30:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:30:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:45,250 INFO L87 Difference]: Start difference. First operand 21 states and 42 transitions. Second operand 6 states. [2020-06-22 09:30:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,346 INFO L93 Difference]: Finished difference Result 25 states and 43 transitions. [2020-06-22 09:30:45,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:30:45,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-06-22 09:30:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,348 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:30:45,348 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 09:30:45,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:30:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 09:30:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-06-22 09:30:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:30:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2020-06-22 09:30:45,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 11 [2020-06-22 09:30:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,354 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2020-06-22 09:30:45,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:30:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2020-06-22 09:30:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:30:45,354 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,355 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1091888933, now seen corresponding path program 1 times [2020-06-22 09:30:45,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:45,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:45,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 09:30:45,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:45,594 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 09:30:45,595 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:45,605 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:45,607 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:30:45,607 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 09:30:45,639 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:45,639 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 09:30:45,644 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:30:45,655 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:45,661 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:30:45,661 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 09:30:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:45,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-06-22 09:30:45,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 09:30:45,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 09:30:45,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-06-22 09:30:45,737 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 11 states. [2020-06-22 09:30:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:46,982 INFO L93 Difference]: Finished difference Result 29 states and 56 transitions. [2020-06-22 09:30:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 09:30:46,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-06-22 09:30:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:46,984 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:30:46,984 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 09:30:46,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-06-22 09:30:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 09:30:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-06-22 09:30:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:30:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2020-06-22 09:30:46,988 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 11 [2020-06-22 09:30:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:46,989 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 34 transitions. [2020-06-22 09:30:46,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 09:30:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. [2020-06-22 09:30:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 09:30:46,989 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:46,990 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 09:30:46,990 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1296249075, now seen corresponding path program 2 times [2020-06-22 09:30:46,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:46,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:46,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:47,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:47,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:47,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:30:47,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:30:47,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:30:47,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 09:30:47,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:47,254 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 09:30:47,255 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:47,258 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:47,259 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:47,259 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 09:30:47,277 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 09:30:47,277 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:47,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:47,283 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:30:47,284 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 09:30:47,321 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:47,322 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 09:30:47,323 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:30:47,333 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:47,335 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:47,336 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-06-22 09:30:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:30:47,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:47,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-06-22 09:30:47,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 09:30:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 09:30:47,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-06-22 09:30:47,403 INFO L87 Difference]: Start difference. First operand 18 states and 34 transitions. Second operand 11 states. [2020-06-22 09:30:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:47,952 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. [2020-06-22 09:30:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 09:30:47,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-06-22 09:30:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:47,954 INFO L225 Difference]: With dead ends: 34 [2020-06-22 09:30:47,954 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 09:30:47,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2020-06-22 09:30:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 09:30:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2020-06-22 09:30:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:30:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 47 transitions. [2020-06-22 09:30:47,960 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 47 transitions. Word has length 17 [2020-06-22 09:30:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:47,960 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 47 transitions. [2020-06-22 09:30:47,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 09:30:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 47 transitions. [2020-06-22 09:30:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-06-22 09:30:47,961 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:47,961 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:47,961 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash 981735807, now seen corresponding path program 1 times [2020-06-22 09:30:47,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:47,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 09:30:48,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:48,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:48,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:30:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:30:48,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:48,019 INFO L87 Difference]: Start difference. First operand 24 states and 47 transitions. Second operand 5 states. [2020-06-22 09:30:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,114 INFO L93 Difference]: Finished difference Result 49 states and 98 transitions. [2020-06-22 09:30:48,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:30:48,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-06-22 09:30:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:48,116 INFO L225 Difference]: With dead ends: 49 [2020-06-22 09:30:48,116 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 09:30:48,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:30:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 09:30:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2020-06-22 09:30:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:30:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2020-06-22 09:30:48,121 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 59 transitions. Word has length 23 [2020-06-22 09:30:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:48,122 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 59 transitions. [2020-06-22 09:30:48,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:30:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 59 transitions. [2020-06-22 09:30:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-06-22 09:30:48,123 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:48,123 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,123 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 09:30:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash 981737729, now seen corresponding path program 1 times [2020-06-22 09:30:48,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 09:30:48,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:48,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 09:30:48,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:48,279 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 09:30:48,279 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:48,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:48,284 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:48,284 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 09:30:48,292 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:30:48,293 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:48,295 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:48,295 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:48,295 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 09:30:48,308 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:48,309 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 09:30:48,310 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:30:48,317 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:48,318 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:48,318 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 09:30:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 09:30:48,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:48,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-06-22 09:30:48,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 09:30:48,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 09:30:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:30:48,375 INFO L87 Difference]: Start difference. First operand 30 states and 59 transitions. Second operand 9 states. [2020-06-22 09:30:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,475 INFO L93 Difference]: Finished difference Result 30 states and 59 transitions. [2020-06-22 09:30:48,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:30:48,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-06-22 09:30:48,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:48,476 INFO L225 Difference]: With dead ends: 30 [2020-06-22 09:30:48,476 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:30:48,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:30:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:30:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:30:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:30:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:30:48,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-06-22 09:30:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:48,478 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:48,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 09:30:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:30:48,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:30:48,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:30:48,643 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:30:48,648 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:30:48,648 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 09:30:48,648 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-06-22 09:30:48,648 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-06-22 09:30:48,648 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L448 ceAbstractionStarter]: For program point L14-6(lines 14 15) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L444 ceAbstractionStarter]: At program point L14-8(lines 14 15) the Hoare annotation is: (let ((.cse1 (select |#length| ULTIMATE.start_cstrchr_~s.base))) (let ((.cse0 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrchr_~s.base))) (.cse3 (<= 1 ULTIMATE.start_main_~length~0)) (.cse4 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse6 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ .cse1 (- 1))))) (.cse5 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1))) (or (and .cse0 (<= 1 ULTIMATE.start_cstrchr_~s.offset) (<= (+ ULTIMATE.start_cstrchr_~s.offset 1) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5 (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= 1 ULTIMATE.start_main_~length~0) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrchr_~s.base)) (<= ULTIMATE.start_cstrchr_~s.offset ULTIMATE.start_main_~nondetString~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1))) 0))) (= 0 ULTIMATE.start_cstrchr_~s.offset))))) [2020-06-22 09:30:48,649 INFO L448 ceAbstractionStarter]: For program point L14-9(lines 14 15) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:30:48,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:48,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:48,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:48,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:48,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:48,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:48,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:48,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:48,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:48,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:48,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:48,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:48,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:48,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:48,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:48,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:48,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:48,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:48,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:48 BasicIcfg [2020-06-22 09:30:48,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:30:48,680 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:30:48,680 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:30:48,684 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:30:48,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:30:43" (1/5) ... [2020-06-22 09:30:48,685 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a2c61df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:30:48, skipping insertion in model container [2020-06-22 09:30:48,685 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (2/5) ... [2020-06-22 09:30:48,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a2c61df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:30:48, skipping insertion in model container [2020-06-22 09:30:48,686 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:43" (3/5) ... [2020-06-22 09:30:48,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a2c61df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:48, skipping insertion in model container [2020-06-22 09:30:48,686 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:43" (4/5) ... [2020-06-22 09:30:48,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a2c61df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:48, skipping insertion in model container [2020-06-22 09:30:48,687 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:48" (5/5) ... [2020-06-22 09:30:48,689 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:30:48,710 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:30:48,710 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:30:48,710 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:30:48,710 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:30:48,710 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:30:48,711 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:30:48,711 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:30:48,711 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:30:48,711 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:30:48,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-06-22 09:30:48,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:30:48,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:48,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:48,724 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:30:48,725 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:48,725 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:30:48,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-06-22 09:30:48,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:30:48,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:48,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:48,727 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:30:48,727 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:48,732 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue [133] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 14#L21true [60] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 10#L21-2true [100] L21-2-->L25: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 21#L25true [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (<= 1 .cse0) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 6#L14-8true [2020-06-22 09:30:48,732 INFO L796 eck$LassoCheckResult]: Loop: 6#L14-8true [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 20#L14-1true [113] L14-1-->L14-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short2_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 18#L14-2true [66] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short2_5|) InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} AuxVars[] AssignedVars[] 9#L14-6true [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 6#L14-8true [2020-06-22 09:30:48,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash 4946618, now seen corresponding path program 1 times [2020-06-22 09:30:48,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash 3387732, now seen corresponding path program 1 times [2020-06-22 09:30:48,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:48,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:48,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:30:48,783 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:30:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:48,784 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-06-22 09:30:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,837 INFO L93 Difference]: Finished difference Result 21 states and 42 transitions. [2020-06-22 09:30:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:48,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 42 transitions. [2020-06-22 09:30:48,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 09:30:48,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 12 states and 25 transitions. [2020-06-22 09:30:48,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 09:30:48,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 09:30:48,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 25 transitions. [2020-06-22 09:30:48,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:30:48,844 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 25 transitions. [2020-06-22 09:30:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 25 transitions. [2020-06-22 09:30:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-06-22 09:30:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:30:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2020-06-22 09:30:48,846 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. [2020-06-22 09:30:48,846 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. [2020-06-22 09:30:48,847 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:30:48,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 24 transitions. [2020-06-22 09:30:48,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:30:48,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:48,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:48,848 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:30:48,848 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:48,848 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY [133] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 51#L21 [60] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 52#L21-2 [100] L21-2-->L25: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 59#L25 [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (<= 1 .cse0) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 55#L14-8 [2020-06-22 09:30:48,849 INFO L796 eck$LassoCheckResult]: Loop: 55#L14-8 [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 56#L14-1 [114] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_cstrchr_#t~short2_2|) (= 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 58#L14-2 [66] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short2_5|) InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} AuxVars[] AssignedVars[] 50#L14-6 [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 55#L14-8 [2020-06-22 09:30:48,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,849 INFO L82 PathProgramCache]: Analyzing trace with hash 4946618, now seen corresponding path program 2 times [2020-06-22 09:30:48,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash 3388693, now seen corresponding path program 1 times [2020-06-22 09:30:48,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:48,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:48,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:48,872 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:30:48,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:48,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:48,873 INFO L87 Difference]: Start difference. First operand 11 states and 24 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-06-22 09:30:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,904 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2020-06-22 09:30:48,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:48,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 23 transitions. [2020-06-22 09:30:48,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:30:48,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 19 transitions. [2020-06-22 09:30:48,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 09:30:48,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 09:30:48,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 19 transitions. [2020-06-22 09:30:48,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:30:48,906 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. [2020-06-22 09:30:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 19 transitions. [2020-06-22 09:30:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 09:30:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:30:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2020-06-22 09:30:48,907 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. [2020-06-22 09:30:48,908 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. [2020-06-22 09:30:48,908 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:30:48,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 19 transitions. [2020-06-22 09:30:48,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:30:48,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:48,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:48,909 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:30:48,909 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,909 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY [133] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 80#L21 [60] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 81#L21-2 [100] L21-2-->L25: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 87#L25 [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (<= 1 .cse0) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 84#L14-8 [2020-06-22 09:30:48,910 INFO L796 eck$LassoCheckResult]: Loop: 84#L14-8 [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 85#L14-1 [113] L14-1-->L14-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short2_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 86#L14-2 [65] L14-2-->L14-3: Formula: |v_ULTIMATE.start_cstrchr_#t~short2_3| InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_3|} AuxVars[] AssignedVars[] 83#L14-3 [62] L14-3-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrchr_~s.base_6)) (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_5) (= (select |v_#valid_9| v_ULTIMATE.start_cstrchr_~s.base_6) 1) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrchr_~s.base_6) v_ULTIMATE.start_cstrchr_~s.offset_5) |v_ULTIMATE.start_cstrchr_#t~mem1_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem1] 78#L14-4 [128] L14-4-->L14-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrchr_~c_3 256))) (and |v_ULTIMATE.start_cstrchr_#t~short2_4| (< (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrchr_#t~mem1_3|) (< .cse0 |v_ULTIMATE.start_cstrchr_#t~mem1_3|))) InVars {ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_4|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 79#L14-6 [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 84#L14-8 [2020-06-22 09:30:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 4946618, now seen corresponding path program 3 times [2020-06-22 09:30:48,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1039402765, now seen corresponding path program 1 times [2020-06-22 09:30:48,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 280282348, now seen corresponding path program 1 times [2020-06-22 09:30:48,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:49,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:49,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 09:30:49,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:30:49,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:49,063 INFO L87 Difference]: Start difference. First operand 10 states and 19 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-06-22 09:30:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:49,133 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2020-06-22 09:30:49,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:30:49,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 23 transitions. [2020-06-22 09:30:49,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:30:49,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 18 transitions. [2020-06-22 09:30:49,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 09:30:49,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 09:30:49,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. [2020-06-22 09:30:49,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:30:49,135 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 09:30:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. [2020-06-22 09:30:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 09:30:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:30:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-06-22 09:30:49,138 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 09:30:49,138 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 09:30:49,138 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:30:49,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. [2020-06-22 09:30:49,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:30:49,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:49,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:49,139 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:30:49,139 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:30:49,139 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY [133] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 119#L21 [86] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 120#L21-2 [100] L21-2-->L25: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 126#L25 [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (<= 1 .cse0) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 123#L14-8 [2020-06-22 09:30:49,140 INFO L796 eck$LassoCheckResult]: Loop: 123#L14-8 [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 124#L14-1 [113] L14-1-->L14-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short2_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 125#L14-2 [65] L14-2-->L14-3: Formula: |v_ULTIMATE.start_cstrchr_#t~short2_3| InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_3|} AuxVars[] AssignedVars[] 122#L14-3 [62] L14-3-->L14-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrchr_~s.base_6)) (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_5) (= (select |v_#valid_9| v_ULTIMATE.start_cstrchr_~s.base_6) 1) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrchr_~s.base_6) v_ULTIMATE.start_cstrchr_~s.offset_5) |v_ULTIMATE.start_cstrchr_#t~mem1_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem1] 117#L14-4 [128] L14-4-->L14-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrchr_~c_3 256))) (and |v_ULTIMATE.start_cstrchr_#t~short2_4| (< (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrchr_#t~mem1_3|) (< .cse0 |v_ULTIMATE.start_cstrchr_#t~mem1_3|))) InVars {ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_4|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 118#L14-6 [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 123#L14-8 [2020-06-22 09:30:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash 4971604, now seen corresponding path program 1 times [2020-06-22 09:30:49,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:49,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:49,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:49,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:49,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1039402765, now seen corresponding path program 2 times [2020-06-22 09:30:49,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:49,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:49,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash 531106566, now seen corresponding path program 1 times [2020-06-22 09:30:49,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:49,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:49,396 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:30:49,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:30:49,398 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:30:49,398 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:30:49,398 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:30:49,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:30:49,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:30:49,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:30:49,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:30:49,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:30:49,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:30:49,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,879 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:30:49,884 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:30:49,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,970 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:30:49,988 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 09:30:49,988 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 09:30:49,991 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:30:49,992 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:30:49,992 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:30:49,993 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrchr_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1) = -1*ULTIMATE.start_cstrchr_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1 Supporting invariants [] [2020-06-22 09:30:50,003 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 09:30:50,008 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:50,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:30:50,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:50,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:30:50,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:50,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:30:50,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:50,207 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 09:30:50,211 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 09:30:50,212 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-06-22 09:30:50,315 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 16 states and 32 transitions. Complement of second has 5 states. [2020-06-22 09:30:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 09:30:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 09:30:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-06-22 09:30:50,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 09:30:50,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:50,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 09:30:50,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:50,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 09:30:50,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:50,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 32 transitions. [2020-06-22 09:30:50,326 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:30:50,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-06-22 09:30:50,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:30:50,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:30:50,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:30:50,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:30:50,327 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:50,327 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:50,327 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:50,327 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:30:50,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:30:50,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:30:50,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:30:50,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:50 BasicIcfg [2020-06-22 09:30:50,333 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:30:50,334 INFO L168 Benchmark]: Toolchain (without parser) took 7242.05 ms. Allocated memory was 649.6 MB in the beginning and 768.6 MB in the end (delta: 119.0 MB). Free memory was 565.2 MB in the beginning and 451.7 MB in the end (delta: 113.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:50,334 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:30:50,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.91 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 565.2 MB in the beginning and 654.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:50,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 690.5 MB. Free memory was 654.0 MB in the beginning and 651.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:50,336 INFO L168 Benchmark]: Boogie Preprocessor took 23.85 ms. Allocated memory is still 690.5 MB. Free memory was 651.3 MB in the beginning and 650.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:50,336 INFO L168 Benchmark]: RCFGBuilder took 282.88 ms. Allocated memory is still 690.5 MB. Free memory was 650.0 MB in the beginning and 630.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:50,337 INFO L168 Benchmark]: BlockEncodingV2 took 122.02 ms. Allocated memory is still 690.5 MB. Free memory was 630.0 MB in the beginning and 621.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:50,337 INFO L168 Benchmark]: TraceAbstraction took 4821.58 ms. Allocated memory was 690.5 MB in the beginning and 754.5 MB in the end (delta: 64.0 MB). Free memory was 621.9 MB in the beginning and 377.7 MB in the end (delta: 244.2 MB). Peak memory consumption was 308.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:50,338 INFO L168 Benchmark]: BuchiAutomizer took 1652.86 ms. Allocated memory was 754.5 MB in the beginning and 768.6 MB in the end (delta: 14.2 MB). Free memory was 377.7 MB in the beginning and 451.7 MB in the end (delta: -74.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:30:50,342 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 27 locations, 31 edges - StatisticsResult: Encoded RCFG 19 locations, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 294.91 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 565.2 MB in the beginning and 654.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 690.5 MB. Free memory was 654.0 MB in the beginning and 651.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.85 ms. Allocated memory is still 690.5 MB. Free memory was 651.3 MB in the beginning and 650.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 282.88 ms. Allocated memory is still 690.5 MB. Free memory was 650.0 MB in the beginning and 630.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 122.02 ms. Allocated memory is still 690.5 MB. Free memory was 630.0 MB in the beginning and 621.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4821.58 ms. Allocated memory was 690.5 MB in the beginning and 754.5 MB in the end (delta: 64.0 MB). Free memory was 621.9 MB in the beginning and 377.7 MB in the end (delta: 244.2 MB). Peak memory consumption was 308.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1652.86 ms. Allocated memory was 754.5 MB in the beginning and 768.6 MB in the end (delta: 14.2 MB). Free memory was 377.7 MB in the beginning and 451.7 MB in the end (delta: -74.0 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 09:30:50,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:50,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:50,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:50,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:50,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:50,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:50,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:50,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:50,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:50,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:50,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 09:30:50,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:50,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:50,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:50,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:50,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((nondetString == 0 && 1 <= s) && s + 1 <= unknown-#length-unknown[s]) && 1 == \valid[s]) && 1 <= length) && length == unknown-#length-unknown[nondetString]) && \valid[nondetString] == 1) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) || (((((((nondetString == 0 && 1 == \valid[s]) && 1 <= length) && length == unknown-#length-unknown[nondetString]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && \valid[nondetString] == 1) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((1 <= ULTIMATE.start_main_~length~0 && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s]) && s <= ULTIMATE.start_main_~nondetString~0.offset) && unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0)) && 0 == s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. SAFE Result, 4.7s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 921 SDslu, 266 SDs, 0 SdLazy, 709 SolverSat, 87 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 4 NumberOfFragments, 105 HoareAnnotationTreeSize, 1 FomulaSimplifications, 262 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 175 ConstructedInterpolants, 8 QuantifiedInterpolants, 20609 SizeOfPredicates, 24 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 39/85 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[alloca(length * sizeof(char))] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 77 SDslu, 87 SDs, 0 SdLazy, 202 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital113 mio100 ax100 hnf100 lsp94 ukn91 mio100 lsp42 div123 bol100 ite100 ukn100 eq153 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:30:39.816 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:30:50.589 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check