/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test24-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:30:08,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:30:08,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:30:08,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:30:08,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:30:08,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:30:08,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:30:08,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:30:08,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:30:08,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:30:08,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:30:08,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:30:08,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:30:08,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:30:08,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:30:08,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:30:08,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:30:08,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:30:08,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:30:08,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:30:08,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:30:08,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:30:08,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:30:08,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:30:08,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:30:08,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:30:08,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:30:08,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:30:08,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:30:08,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:30:08,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:30:08,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:30:08,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:30:08,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:30:08,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:30:08,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:30:08,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:30:08,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:30:08,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:30:08,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:30:08,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:30:08,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:30:08,174 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:30:08,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:30:08,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:30:08,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:30:08,176 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:30:08,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:30:08,177 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:30:08,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:30:08,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:30:08,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:30:08,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:30:08,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:30:08,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:30:08,178 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:30:08,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:30:08,178 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:30:08,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:30:08,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:30:08,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:30:08,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:30:08,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:30:08,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:30:08,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:30:08,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:30:08,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:30:08,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:30:08,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:30:08,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:30:08,181 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:30:08,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:30:08,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:30:08,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:30:08,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:30:08,522 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:30:08,522 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:30:08,523 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24-2.c [2020-07-17 22:30:08,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577d01e57/0414a421654943aeba34b72a32bf0e35/FLAG3b0a5e0e5 [2020-07-17 22:30:09,109 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:30:09,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-2.c [2020-07-17 22:30:09,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577d01e57/0414a421654943aeba34b72a32bf0e35/FLAG3b0a5e0e5 [2020-07-17 22:30:09,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577d01e57/0414a421654943aeba34b72a32bf0e35 [2020-07-17 22:30:09,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:30:09,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:30:09,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:30:09,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:30:09,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:30:09,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e0a361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09, skipping insertion in model container [2020-07-17 22:30:09,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:30:09,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:30:09,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:30:09,742 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:30:09,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:30:09,780 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:30:09,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09 WrapperNode [2020-07-17 22:30:09,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:30:09,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:30:09,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:30:09,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:30:09,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (1/1) ... [2020-07-17 22:30:09,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:30:09,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:30:09,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:30:09,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:30:09,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:30:09,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:30:09,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:30:09,976 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-17 22:30:09,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:30:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:30:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:30:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-17 22:30:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:30:09,977 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:30:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:30:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:30:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:30:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:30:09,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:30:10,387 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:30:10,388 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:30:10,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:30:10 BoogieIcfgContainer [2020-07-17 22:30:10,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:30:10,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:30:10,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:30:10,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:30:10,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:30:09" (1/3) ... [2020-07-17 22:30:10,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ce6965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:30:10, skipping insertion in model container [2020-07-17 22:30:10,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:30:09" (2/3) ... [2020-07-17 22:30:10,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ce6965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:30:10, skipping insertion in model container [2020-07-17 22:30:10,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:30:10" (3/3) ... [2020-07-17 22:30:10,401 INFO L109 eAbstractionObserver]: Analyzing ICFG test24-2.c [2020-07-17 22:30:10,410 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:30:10,418 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:30:10,431 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:30:10,453 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:30:10,453 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:30:10,453 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:30:10,454 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:30:10,454 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:30:10,454 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:30:10,454 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:30:10,454 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:30:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-17 22:30:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:30:10,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:10,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:10,478 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 855240046, now seen corresponding path program 1 times [2020-07-17 22:30:10,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:10,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154276506] [2020-07-17 22:30:10,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:10,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-17 22:30:10,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-17 22:30:10,703 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #53#return; {28#true} is VALID [2020-07-17 22:30:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:10,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {28#true} is VALID [2020-07-17 22:30:10,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-17 22:30:10,733 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {29#false} #57#return; {29#false} is VALID [2020-07-17 22:30:10,736 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:10,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-17 22:30:10,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-17 22:30:10,738 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #53#return; {28#true} is VALID [2020-07-17 22:30:10,740 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2020-07-17 22:30:10,740 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {28#true} is VALID [2020-07-17 22:30:10,742 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2020-07-17 22:30:10,743 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {29#false} is VALID [2020-07-17 22:30:10,743 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {29#false} is VALID [2020-07-17 22:30:10,744 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2020-07-17 22:30:10,744 INFO L263 TraceCheckUtils]: 10: Hoare triple {29#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {28#true} is VALID [2020-07-17 22:30:10,745 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {28#true} is VALID [2020-07-17 22:30:10,746 INFO L280 TraceCheckUtils]: 12: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-17 22:30:10,746 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {28#true} {29#false} #57#return; {29#false} is VALID [2020-07-17 22:30:10,747 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {29#false} is VALID [2020-07-17 22:30:10,747 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == #t~ret8;havoc #t~ret8; {29#false} is VALID [2020-07-17 22:30:10,747 INFO L280 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-17 22:30:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:10,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154276506] [2020-07-17 22:30:10,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:30:10,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:30:10,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7039748] [2020-07-17 22:30:10,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:30:10,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:10,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:30:10,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:10,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:30:10,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:10,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:30:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:30:10,855 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-17 22:30:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:11,070 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2020-07-17 22:30:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:30:11,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:30:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:30:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2020-07-17 22:30:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:30:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2020-07-17 22:30:11,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2020-07-17 22:30:11,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:11,192 INFO L225 Difference]: With dead ends: 42 [2020-07-17 22:30:11,192 INFO L226 Difference]: Without dead ends: 20 [2020-07-17 22:30:11,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-07-17 22:30:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-17 22:30:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-17 22:30:11,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:11,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-17 22:30:11,249 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-17 22:30:11,249 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-17 22:30:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:11,253 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-17 22:30:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-17 22:30:11,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:11,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:11,255 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-17 22:30:11,255 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-17 22:30:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:11,259 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-17 22:30:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-17 22:30:11,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:11,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:11,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:11,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:30:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-17 22:30:11,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2020-07-17 22:30:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:11,266 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-17 22:30:11,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:30:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-17 22:30:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:30:11,268 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:11,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:11,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:30:11,269 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:11,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1631497781, now seen corresponding path program 1 times [2020-07-17 22:30:11,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:11,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791025346] [2020-07-17 22:30:11,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:11,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {163#true} is VALID [2020-07-17 22:30:11,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-17 22:30:11,382 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #53#return; {163#true} is VALID [2020-07-17 22:30:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:11,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {163#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {163#true} is VALID [2020-07-17 22:30:11,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-17 22:30:11,394 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {163#true} {164#false} #57#return; {164#false} is VALID [2020-07-17 22:30:11,396 INFO L263 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:11,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {163#true} is VALID [2020-07-17 22:30:11,396 INFO L280 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-17 22:30:11,397 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #53#return; {163#true} is VALID [2020-07-17 22:30:11,397 INFO L263 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret9 := main(); {163#true} is VALID [2020-07-17 22:30:11,398 INFO L280 TraceCheckUtils]: 5: Hoare triple {163#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {168#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:11,399 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#(= 0 main_~j~0)} assume !(~j~0 < 20); {164#false} is VALID [2020-07-17 22:30:11,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {164#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {164#false} is VALID [2020-07-17 22:30:11,400 INFO L280 TraceCheckUtils]: 8: Hoare triple {164#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {164#false} is VALID [2020-07-17 22:30:11,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {164#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {164#false} is VALID [2020-07-17 22:30:11,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {164#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {164#false} is VALID [2020-07-17 22:30:11,401 INFO L263 TraceCheckUtils]: 11: Hoare triple {164#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {163#true} is VALID [2020-07-17 22:30:11,402 INFO L280 TraceCheckUtils]: 12: Hoare triple {163#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {163#true} is VALID [2020-07-17 22:30:11,402 INFO L280 TraceCheckUtils]: 13: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-17 22:30:11,403 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {163#true} {164#false} #57#return; {164#false} is VALID [2020-07-17 22:30:11,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {164#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {164#false} is VALID [2020-07-17 22:30:11,403 INFO L280 TraceCheckUtils]: 16: Hoare triple {164#false} assume 0 == #t~ret8;havoc #t~ret8; {164#false} is VALID [2020-07-17 22:30:11,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {164#false} assume !false; {164#false} is VALID [2020-07-17 22:30:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:11,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791025346] [2020-07-17 22:30:11,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:30:11,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:30:11,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726278402] [2020-07-17 22:30:11,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-17 22:30:11,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:11,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:30:11,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:11,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:30:11,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:11,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:30:11,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:30:11,452 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2020-07-17 22:30:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:11,591 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-17 22:30:11,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:30:11,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-17 22:30:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:30:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-17 22:30:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:30:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-17 22:30:11,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2020-07-17 22:30:11,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:11,654 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:30:11,654 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:30:11,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:30:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:30:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-17 22:30:11,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:11,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-17 22:30:11,675 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-17 22:30:11,675 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-17 22:30:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:11,678 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:30:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:30:11,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:11,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:11,679 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-17 22:30:11,679 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-17 22:30:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:11,681 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:30:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:30:11,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:11,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:11,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:11,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:30:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-17 22:30:11,685 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2020-07-17 22:30:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:11,685 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-17 22:30:11,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:30:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:30:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:30:11,686 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:11,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:11,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:30:11,687 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:11,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1934775405, now seen corresponding path program 1 times [2020-07-17 22:30:11,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:11,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489506657] [2020-07-17 22:30:11,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:11,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-17 22:30:11,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-17 22:30:11,765 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-17 22:30:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:11,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {298#true} is VALID [2020-07-17 22:30:11,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-17 22:30:11,774 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {298#true} {299#false} #57#return; {299#false} is VALID [2020-07-17 22:30:11,776 INFO L263 TraceCheckUtils]: 0: Hoare triple {298#true} call ULTIMATE.init(); {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:11,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-17 22:30:11,776 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-17 22:30:11,776 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-17 22:30:11,777 INFO L263 TraceCheckUtils]: 4: Hoare triple {298#true} call #t~ret9 := main(); {298#true} is VALID [2020-07-17 22:30:11,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {298#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {303#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:11,779 INFO L280 TraceCheckUtils]: 6: Hoare triple {303#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {303#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:11,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {304#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:11,780 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~j~0 1)} assume !(~j~0 < 20); {299#false} is VALID [2020-07-17 22:30:11,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {299#false} is VALID [2020-07-17 22:30:11,781 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {299#false} is VALID [2020-07-17 22:30:11,781 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {299#false} is VALID [2020-07-17 22:30:11,782 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {299#false} is VALID [2020-07-17 22:30:11,782 INFO L263 TraceCheckUtils]: 13: Hoare triple {299#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {298#true} is VALID [2020-07-17 22:30:11,782 INFO L280 TraceCheckUtils]: 14: Hoare triple {298#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {298#true} is VALID [2020-07-17 22:30:11,783 INFO L280 TraceCheckUtils]: 15: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-17 22:30:11,783 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {298#true} {299#false} #57#return; {299#false} is VALID [2020-07-17 22:30:11,783 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {299#false} is VALID [2020-07-17 22:30:11,783 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume 0 == #t~ret8;havoc #t~ret8; {299#false} is VALID [2020-07-17 22:30:11,784 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-17 22:30:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:11,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489506657] [2020-07-17 22:30:11,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540749896] [2020-07-17 22:30:11,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:11,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:30:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:11,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:11,926 INFO L263 TraceCheckUtils]: 0: Hoare triple {298#true} call ULTIMATE.init(); {298#true} is VALID [2020-07-17 22:30:11,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {298#true} is VALID [2020-07-17 22:30:11,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-17 22:30:11,927 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {298#true} #53#return; {298#true} is VALID [2020-07-17 22:30:11,927 INFO L263 TraceCheckUtils]: 4: Hoare triple {298#true} call #t~ret9 := main(); {298#true} is VALID [2020-07-17 22:30:11,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {298#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {327#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:11,929 INFO L280 TraceCheckUtils]: 6: Hoare triple {327#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {327#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:11,930 INFO L280 TraceCheckUtils]: 7: Hoare triple {327#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {304#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:11,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~j~0 1)} assume !(~j~0 < 20); {299#false} is VALID [2020-07-17 22:30:11,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {299#false} is VALID [2020-07-17 22:30:11,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {299#false} is VALID [2020-07-17 22:30:11,932 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {299#false} is VALID [2020-07-17 22:30:11,932 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {299#false} is VALID [2020-07-17 22:30:11,933 INFO L263 TraceCheckUtils]: 13: Hoare triple {299#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {299#false} is VALID [2020-07-17 22:30:11,933 INFO L280 TraceCheckUtils]: 14: Hoare triple {299#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {299#false} is VALID [2020-07-17 22:30:11,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {299#false} assume true; {299#false} is VALID [2020-07-17 22:30:11,934 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {299#false} {299#false} #57#return; {299#false} is VALID [2020-07-17 22:30:11,934 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {299#false} is VALID [2020-07-17 22:30:11,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume 0 == #t~ret8;havoc #t~ret8; {299#false} is VALID [2020-07-17 22:30:11,935 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-17 22:30:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:11,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:11,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-17 22:30:11,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488809017] [2020-07-17 22:30:11,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-17 22:30:11,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:11,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:30:11,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:30:11,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:11,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:30:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:30:11,975 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2020-07-17 22:30:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:12,106 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-17 22:30:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:30:12,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-17 22:30:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:30:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-17 22:30:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:30:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-17 22:30:12,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-17 22:30:12,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:12,170 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:30:12,171 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:30:12,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:30:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:30:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-17 22:30:12,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:12,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-17 22:30:12,189 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-17 22:30:12,189 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-17 22:30:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:12,192 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-17 22:30:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:30:12,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:12,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:12,193 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-17 22:30:12,193 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-17 22:30:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:12,196 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-17 22:30:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:30:12,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:12,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:12,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:12,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:30:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-17 22:30:12,200 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2020-07-17 22:30:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:12,200 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-17 22:30:12,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:30:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-17 22:30:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:30:12,202 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:12,202 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:12,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:30:12,419 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:12,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1739404943, now seen corresponding path program 2 times [2020-07-17 22:30:12,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:12,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903592009] [2020-07-17 22:30:12,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:12,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {502#true} is VALID [2020-07-17 22:30:12,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-17 22:30:12,548 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-17 22:30:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:12,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {502#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {502#true} is VALID [2020-07-17 22:30:12,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-17 22:30:12,558 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {502#true} {503#false} #57#return; {503#false} is VALID [2020-07-17 22:30:12,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:12,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {502#true} is VALID [2020-07-17 22:30:12,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-17 22:30:12,560 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-17 22:30:12,561 INFO L263 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret9 := main(); {502#true} is VALID [2020-07-17 22:30:12,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {507#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:12,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {507#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {507#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:12,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {507#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {508#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:12,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {508#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {508#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:12,566 INFO L280 TraceCheckUtils]: 9: Hoare triple {508#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {509#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:12,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#(<= main_~j~0 2)} assume !(~j~0 < 20); {503#false} is VALID [2020-07-17 22:30:12,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {503#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {503#false} is VALID [2020-07-17 22:30:12,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {503#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {503#false} is VALID [2020-07-17 22:30:12,568 INFO L280 TraceCheckUtils]: 13: Hoare triple {503#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {503#false} is VALID [2020-07-17 22:30:12,568 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {503#false} is VALID [2020-07-17 22:30:12,569 INFO L263 TraceCheckUtils]: 15: Hoare triple {503#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {502#true} is VALID [2020-07-17 22:30:12,569 INFO L280 TraceCheckUtils]: 16: Hoare triple {502#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {502#true} is VALID [2020-07-17 22:30:12,569 INFO L280 TraceCheckUtils]: 17: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-17 22:30:12,570 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {502#true} {503#false} #57#return; {503#false} is VALID [2020-07-17 22:30:12,570 INFO L280 TraceCheckUtils]: 19: Hoare triple {503#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {503#false} is VALID [2020-07-17 22:30:12,570 INFO L280 TraceCheckUtils]: 20: Hoare triple {503#false} assume 0 == #t~ret8;havoc #t~ret8; {503#false} is VALID [2020-07-17 22:30:12,571 INFO L280 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2020-07-17 22:30:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:12,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903592009] [2020-07-17 22:30:12,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60292532] [2020-07-17 22:30:12,573 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:12,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:30:12,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:12,631 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:30:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:12,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:12,707 INFO L263 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2020-07-17 22:30:12,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {502#true} is VALID [2020-07-17 22:30:12,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-17 22:30:12,708 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #53#return; {502#true} is VALID [2020-07-17 22:30:12,708 INFO L263 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret9 := main(); {502#true} is VALID [2020-07-17 22:30:12,709 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {532#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:12,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {532#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {532#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:12,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {532#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {508#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:12,712 INFO L280 TraceCheckUtils]: 8: Hoare triple {508#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {508#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:12,713 INFO L280 TraceCheckUtils]: 9: Hoare triple {508#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {509#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:12,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#(<= main_~j~0 2)} assume !(~j~0 < 20); {503#false} is VALID [2020-07-17 22:30:12,714 INFO L280 TraceCheckUtils]: 11: Hoare triple {503#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {503#false} is VALID [2020-07-17 22:30:12,714 INFO L280 TraceCheckUtils]: 12: Hoare triple {503#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {503#false} is VALID [2020-07-17 22:30:12,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {503#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {503#false} is VALID [2020-07-17 22:30:12,715 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {503#false} is VALID [2020-07-17 22:30:12,715 INFO L263 TraceCheckUtils]: 15: Hoare triple {503#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {503#false} is VALID [2020-07-17 22:30:12,716 INFO L280 TraceCheckUtils]: 16: Hoare triple {503#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {503#false} is VALID [2020-07-17 22:30:12,716 INFO L280 TraceCheckUtils]: 17: Hoare triple {503#false} assume true; {503#false} is VALID [2020-07-17 22:30:12,716 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {503#false} {503#false} #57#return; {503#false} is VALID [2020-07-17 22:30:12,717 INFO L280 TraceCheckUtils]: 19: Hoare triple {503#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {503#false} is VALID [2020-07-17 22:30:12,717 INFO L280 TraceCheckUtils]: 20: Hoare triple {503#false} assume 0 == #t~ret8;havoc #t~ret8; {503#false} is VALID [2020-07-17 22:30:12,717 INFO L280 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2020-07-17 22:30:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:12,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:12,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-17 22:30:12,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333959405] [2020-07-17 22:30:12,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:30:12,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:12,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:30:12,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:12,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:30:12,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:12,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:30:12,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:30:12,766 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2020-07-17 22:30:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:12,961 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-17 22:30:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:30:12,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:30:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:30:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-17 22:30:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:30:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-17 22:30:12,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-17 22:30:13,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:13,020 INFO L225 Difference]: With dead ends: 38 [2020-07-17 22:30:13,020 INFO L226 Difference]: Without dead ends: 26 [2020-07-17 22:30:13,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:30:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-17 22:30:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-17 22:30:13,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:13,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-17 22:30:13,038 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-17 22:30:13,038 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-17 22:30:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:13,047 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-17 22:30:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-17 22:30:13,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:13,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:13,050 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-17 22:30:13,050 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-17 22:30:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:13,054 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-17 22:30:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-17 22:30:13,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:13,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:13,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:13,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:30:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-17 22:30:13,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2020-07-17 22:30:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:13,059 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-17 22:30:13,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:30:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-17 22:30:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:30:13,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:13,062 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:13,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:13,277 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:13,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:13,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1328015311, now seen corresponding path program 3 times [2020-07-17 22:30:13,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:13,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308686330] [2020-07-17 22:30:13,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:13,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {723#true} is VALID [2020-07-17 22:30:13,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-17 22:30:13,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-17 22:30:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:13,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {723#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {723#true} is VALID [2020-07-17 22:30:13,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-17 22:30:13,407 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {723#true} {724#false} #57#return; {724#false} is VALID [2020-07-17 22:30:13,409 INFO L263 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:13,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {723#true} is VALID [2020-07-17 22:30:13,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-17 22:30:13,410 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-17 22:30:13,410 INFO L263 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret9 := main(); {723#true} is VALID [2020-07-17 22:30:13,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {723#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {728#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:13,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {728#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {728#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:13,414 INFO L280 TraceCheckUtils]: 7: Hoare triple {728#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {729#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:13,415 INFO L280 TraceCheckUtils]: 8: Hoare triple {729#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {729#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:13,416 INFO L280 TraceCheckUtils]: 9: Hoare triple {729#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {730#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:13,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {730#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {730#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:13,418 INFO L280 TraceCheckUtils]: 11: Hoare triple {730#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {731#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:13,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {731#(<= main_~j~0 3)} assume !(~j~0 < 20); {724#false} is VALID [2020-07-17 22:30:13,420 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {724#false} is VALID [2020-07-17 22:30:13,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {724#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {724#false} is VALID [2020-07-17 22:30:13,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {724#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {724#false} is VALID [2020-07-17 22:30:13,420 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {724#false} is VALID [2020-07-17 22:30:13,421 INFO L263 TraceCheckUtils]: 17: Hoare triple {724#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {723#true} is VALID [2020-07-17 22:30:13,421 INFO L280 TraceCheckUtils]: 18: Hoare triple {723#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {723#true} is VALID [2020-07-17 22:30:13,421 INFO L280 TraceCheckUtils]: 19: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-17 22:30:13,421 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {723#true} {724#false} #57#return; {724#false} is VALID [2020-07-17 22:30:13,422 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {724#false} is VALID [2020-07-17 22:30:13,422 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#false} assume 0 == #t~ret8;havoc #t~ret8; {724#false} is VALID [2020-07-17 22:30:13,422 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#false} assume !false; {724#false} is VALID [2020-07-17 22:30:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:13,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308686330] [2020-07-17 22:30:13,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420123206] [2020-07-17 22:30:13,424 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:13,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:30:13,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:13,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:30:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:13,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:13,561 INFO L263 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2020-07-17 22:30:13,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {723#true} is VALID [2020-07-17 22:30:13,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-17 22:30:13,562 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #53#return; {723#true} is VALID [2020-07-17 22:30:13,563 INFO L263 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret9 := main(); {723#true} is VALID [2020-07-17 22:30:13,564 INFO L280 TraceCheckUtils]: 5: Hoare triple {723#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {754#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:13,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {754#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {754#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:13,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {754#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {729#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:13,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {729#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {729#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:13,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {729#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {730#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:13,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {730#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {730#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:13,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {730#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {731#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:13,570 INFO L280 TraceCheckUtils]: 12: Hoare triple {731#(<= main_~j~0 3)} assume !(~j~0 < 20); {724#false} is VALID [2020-07-17 22:30:13,570 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {724#false} is VALID [2020-07-17 22:30:13,570 INFO L280 TraceCheckUtils]: 14: Hoare triple {724#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {724#false} is VALID [2020-07-17 22:30:13,571 INFO L280 TraceCheckUtils]: 15: Hoare triple {724#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {724#false} is VALID [2020-07-17 22:30:13,571 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {724#false} is VALID [2020-07-17 22:30:13,571 INFO L263 TraceCheckUtils]: 17: Hoare triple {724#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {724#false} is VALID [2020-07-17 22:30:13,571 INFO L280 TraceCheckUtils]: 18: Hoare triple {724#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {724#false} is VALID [2020-07-17 22:30:13,571 INFO L280 TraceCheckUtils]: 19: Hoare triple {724#false} assume true; {724#false} is VALID [2020-07-17 22:30:13,572 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {724#false} {724#false} #57#return; {724#false} is VALID [2020-07-17 22:30:13,572 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {724#false} is VALID [2020-07-17 22:30:13,572 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#false} assume 0 == #t~ret8;havoc #t~ret8; {724#false} is VALID [2020-07-17 22:30:13,573 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#false} assume !false; {724#false} is VALID [2020-07-17 22:30:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:13,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:13,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-17 22:30:13,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650682109] [2020-07-17 22:30:13,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-17 22:30:13,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:13,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:30:13,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:13,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:30:13,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:13,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:30:13,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:30:13,617 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2020-07-17 22:30:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:13,817 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-17 22:30:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:30:13,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-17 22:30:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:30:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-17 22:30:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:30:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-17 22:30:13,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2020-07-17 22:30:13,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:13,871 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:30:13,872 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:30:13,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:30:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:30:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-17 22:30:13,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:13,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-17 22:30:13,887 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-17 22:30:13,887 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-17 22:30:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:13,889 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:30:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:30:13,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:13,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:13,890 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-17 22:30:13,890 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-17 22:30:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:13,892 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:30:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:30:13,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:13,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:13,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:13,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:30:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-17 22:30:13,895 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2020-07-17 22:30:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:13,895 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-17 22:30:13,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:30:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-17 22:30:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:30:13,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:13,896 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:14,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:14,106 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1523652947, now seen corresponding path program 4 times [2020-07-17 22:30:14,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:14,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693002253] [2020-07-17 22:30:14,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:14,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {961#true} is VALID [2020-07-17 22:30:14,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-17 22:30:14,233 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-17 22:30:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:14,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {961#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {961#true} is VALID [2020-07-17 22:30:14,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-17 22:30:14,243 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {961#true} {962#false} #57#return; {962#false} is VALID [2020-07-17 22:30:14,244 INFO L263 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:14,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {961#true} is VALID [2020-07-17 22:30:14,245 INFO L280 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-17 22:30:14,245 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-17 22:30:14,245 INFO L263 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret9 := main(); {961#true} is VALID [2020-07-17 22:30:14,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {961#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {966#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:14,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {966#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {966#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:14,247 INFO L280 TraceCheckUtils]: 7: Hoare triple {966#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {967#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:14,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {967#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {967#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:14,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {967#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {968#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:14,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {968#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {968#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:14,250 INFO L280 TraceCheckUtils]: 11: Hoare triple {968#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {969#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:14,250 INFO L280 TraceCheckUtils]: 12: Hoare triple {969#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {969#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:14,251 INFO L280 TraceCheckUtils]: 13: Hoare triple {969#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {970#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:14,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {970#(<= main_~j~0 4)} assume !(~j~0 < 20); {962#false} is VALID [2020-07-17 22:30:14,252 INFO L280 TraceCheckUtils]: 15: Hoare triple {962#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {962#false} is VALID [2020-07-17 22:30:14,252 INFO L280 TraceCheckUtils]: 16: Hoare triple {962#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {962#false} is VALID [2020-07-17 22:30:14,252 INFO L280 TraceCheckUtils]: 17: Hoare triple {962#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {962#false} is VALID [2020-07-17 22:30:14,252 INFO L280 TraceCheckUtils]: 18: Hoare triple {962#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {962#false} is VALID [2020-07-17 22:30:14,253 INFO L263 TraceCheckUtils]: 19: Hoare triple {962#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {961#true} is VALID [2020-07-17 22:30:14,253 INFO L280 TraceCheckUtils]: 20: Hoare triple {961#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {961#true} is VALID [2020-07-17 22:30:14,253 INFO L280 TraceCheckUtils]: 21: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-17 22:30:14,253 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {961#true} {962#false} #57#return; {962#false} is VALID [2020-07-17 22:30:14,253 INFO L280 TraceCheckUtils]: 23: Hoare triple {962#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {962#false} is VALID [2020-07-17 22:30:14,253 INFO L280 TraceCheckUtils]: 24: Hoare triple {962#false} assume 0 == #t~ret8;havoc #t~ret8; {962#false} is VALID [2020-07-17 22:30:14,254 INFO L280 TraceCheckUtils]: 25: Hoare triple {962#false} assume !false; {962#false} is VALID [2020-07-17 22:30:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:14,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693002253] [2020-07-17 22:30:14,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304090612] [2020-07-17 22:30:14,255 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:14,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:30:14,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:14,295 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:30:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:14,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:14,384 INFO L263 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {961#true} is VALID [2020-07-17 22:30:14,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {961#true} is VALID [2020-07-17 22:30:14,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2020-07-17 22:30:14,385 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #53#return; {961#true} is VALID [2020-07-17 22:30:14,385 INFO L263 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret9 := main(); {961#true} is VALID [2020-07-17 22:30:14,386 INFO L280 TraceCheckUtils]: 5: Hoare triple {961#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {993#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:14,387 INFO L280 TraceCheckUtils]: 6: Hoare triple {993#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {993#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:14,388 INFO L280 TraceCheckUtils]: 7: Hoare triple {993#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {967#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:14,389 INFO L280 TraceCheckUtils]: 8: Hoare triple {967#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {967#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:14,390 INFO L280 TraceCheckUtils]: 9: Hoare triple {967#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {968#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:14,390 INFO L280 TraceCheckUtils]: 10: Hoare triple {968#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {968#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:14,391 INFO L280 TraceCheckUtils]: 11: Hoare triple {968#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {969#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:14,392 INFO L280 TraceCheckUtils]: 12: Hoare triple {969#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {969#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:14,393 INFO L280 TraceCheckUtils]: 13: Hoare triple {969#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {970#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:14,394 INFO L280 TraceCheckUtils]: 14: Hoare triple {970#(<= main_~j~0 4)} assume !(~j~0 < 20); {962#false} is VALID [2020-07-17 22:30:14,394 INFO L280 TraceCheckUtils]: 15: Hoare triple {962#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {962#false} is VALID [2020-07-17 22:30:14,394 INFO L280 TraceCheckUtils]: 16: Hoare triple {962#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {962#false} is VALID [2020-07-17 22:30:14,395 INFO L280 TraceCheckUtils]: 17: Hoare triple {962#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {962#false} is VALID [2020-07-17 22:30:14,395 INFO L280 TraceCheckUtils]: 18: Hoare triple {962#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {962#false} is VALID [2020-07-17 22:30:14,395 INFO L263 TraceCheckUtils]: 19: Hoare triple {962#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {962#false} is VALID [2020-07-17 22:30:14,395 INFO L280 TraceCheckUtils]: 20: Hoare triple {962#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {962#false} is VALID [2020-07-17 22:30:14,396 INFO L280 TraceCheckUtils]: 21: Hoare triple {962#false} assume true; {962#false} is VALID [2020-07-17 22:30:14,396 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {962#false} {962#false} #57#return; {962#false} is VALID [2020-07-17 22:30:14,396 INFO L280 TraceCheckUtils]: 23: Hoare triple {962#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {962#false} is VALID [2020-07-17 22:30:14,396 INFO L280 TraceCheckUtils]: 24: Hoare triple {962#false} assume 0 == #t~ret8;havoc #t~ret8; {962#false} is VALID [2020-07-17 22:30:14,397 INFO L280 TraceCheckUtils]: 25: Hoare triple {962#false} assume !false; {962#false} is VALID [2020-07-17 22:30:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:14,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:14,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-17 22:30:14,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278988430] [2020-07-17 22:30:14,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-17 22:30:14,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:14,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:30:14,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:14,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:30:14,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:30:14,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:30:14,446 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-07-17 22:30:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:14,668 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-17 22:30:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:30:14,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-17 22:30:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:30:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-17 22:30:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:30:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-17 22:30:14,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-17 22:30:14,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:14,731 INFO L225 Difference]: With dead ends: 42 [2020-07-17 22:30:14,731 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:30:14,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:30:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:30:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-17 22:30:14,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:14,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-17 22:30:14,756 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-17 22:30:14,756 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-17 22:30:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:14,758 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-17 22:30:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 22:30:14,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:14,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:14,759 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-17 22:30:14,759 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-17 22:30:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:14,771 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-17 22:30:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 22:30:14,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:14,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:14,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:14,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:30:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-17 22:30:14,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2020-07-17 22:30:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:14,775 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-17 22:30:14,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:30:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-17 22:30:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:30:14,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:14,776 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:14,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:14,990 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:14,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:14,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1787714037, now seen corresponding path program 5 times [2020-07-17 22:30:14,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:14,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19972638] [2020-07-17 22:30:14,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:15,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {1230#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1216#true} is VALID [2020-07-17 22:30:15,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-17 22:30:15,102 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-17 22:30:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:15,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {1216#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1216#true} is VALID [2020-07-17 22:30:15,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-17 22:30:15,108 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1216#true} {1217#false} #57#return; {1217#false} is VALID [2020-07-17 22:30:15,109 INFO L263 TraceCheckUtils]: 0: Hoare triple {1216#true} call ULTIMATE.init(); {1230#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:15,109 INFO L280 TraceCheckUtils]: 1: Hoare triple {1230#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1216#true} is VALID [2020-07-17 22:30:15,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-17 22:30:15,110 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-17 22:30:15,110 INFO L263 TraceCheckUtils]: 4: Hoare triple {1216#true} call #t~ret9 := main(); {1216#true} is VALID [2020-07-17 22:30:15,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {1216#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1221#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:15,111 INFO L280 TraceCheckUtils]: 6: Hoare triple {1221#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1221#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:15,112 INFO L280 TraceCheckUtils]: 7: Hoare triple {1221#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1222#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:15,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {1222#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1222#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:15,113 INFO L280 TraceCheckUtils]: 9: Hoare triple {1222#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1223#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:15,114 INFO L280 TraceCheckUtils]: 10: Hoare triple {1223#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1223#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:15,115 INFO L280 TraceCheckUtils]: 11: Hoare triple {1223#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1224#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:15,116 INFO L280 TraceCheckUtils]: 12: Hoare triple {1224#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1224#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:15,116 INFO L280 TraceCheckUtils]: 13: Hoare triple {1224#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1225#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:15,117 INFO L280 TraceCheckUtils]: 14: Hoare triple {1225#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1225#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:15,118 INFO L280 TraceCheckUtils]: 15: Hoare triple {1225#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1226#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:15,119 INFO L280 TraceCheckUtils]: 16: Hoare triple {1226#(<= main_~j~0 5)} assume !(~j~0 < 20); {1217#false} is VALID [2020-07-17 22:30:15,119 INFO L280 TraceCheckUtils]: 17: Hoare triple {1217#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1217#false} is VALID [2020-07-17 22:30:15,119 INFO L280 TraceCheckUtils]: 18: Hoare triple {1217#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1217#false} is VALID [2020-07-17 22:30:15,119 INFO L280 TraceCheckUtils]: 19: Hoare triple {1217#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1217#false} is VALID [2020-07-17 22:30:15,120 INFO L280 TraceCheckUtils]: 20: Hoare triple {1217#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1217#false} is VALID [2020-07-17 22:30:15,120 INFO L263 TraceCheckUtils]: 21: Hoare triple {1217#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1216#true} is VALID [2020-07-17 22:30:15,120 INFO L280 TraceCheckUtils]: 22: Hoare triple {1216#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1216#true} is VALID [2020-07-17 22:30:15,121 INFO L280 TraceCheckUtils]: 23: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-17 22:30:15,121 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1216#true} {1217#false} #57#return; {1217#false} is VALID [2020-07-17 22:30:15,121 INFO L280 TraceCheckUtils]: 25: Hoare triple {1217#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1217#false} is VALID [2020-07-17 22:30:15,121 INFO L280 TraceCheckUtils]: 26: Hoare triple {1217#false} assume 0 == #t~ret8;havoc #t~ret8; {1217#false} is VALID [2020-07-17 22:30:15,122 INFO L280 TraceCheckUtils]: 27: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2020-07-17 22:30:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:15,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19972638] [2020-07-17 22:30:15,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028828409] [2020-07-17 22:30:15,124 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:15,184 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-17 22:30:15,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:15,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:30:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:15,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:15,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {1216#true} call ULTIMATE.init(); {1216#true} is VALID [2020-07-17 22:30:15,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1216#true} is VALID [2020-07-17 22:30:15,283 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-17 22:30:15,283 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1216#true} {1216#true} #53#return; {1216#true} is VALID [2020-07-17 22:30:15,284 INFO L263 TraceCheckUtils]: 4: Hoare triple {1216#true} call #t~ret9 := main(); {1216#true} is VALID [2020-07-17 22:30:15,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {1216#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1249#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:15,285 INFO L280 TraceCheckUtils]: 6: Hoare triple {1249#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1249#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:15,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {1249#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1222#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:15,286 INFO L280 TraceCheckUtils]: 8: Hoare triple {1222#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1222#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:15,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {1222#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1223#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:15,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {1223#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1223#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:15,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {1223#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1224#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:15,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {1224#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1224#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:15,289 INFO L280 TraceCheckUtils]: 13: Hoare triple {1224#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1225#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:15,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {1225#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1225#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:15,291 INFO L280 TraceCheckUtils]: 15: Hoare triple {1225#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1226#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:15,292 INFO L280 TraceCheckUtils]: 16: Hoare triple {1226#(<= main_~j~0 5)} assume !(~j~0 < 20); {1217#false} is VALID [2020-07-17 22:30:15,293 INFO L280 TraceCheckUtils]: 17: Hoare triple {1217#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1217#false} is VALID [2020-07-17 22:30:15,293 INFO L280 TraceCheckUtils]: 18: Hoare triple {1217#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1217#false} is VALID [2020-07-17 22:30:15,293 INFO L280 TraceCheckUtils]: 19: Hoare triple {1217#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1217#false} is VALID [2020-07-17 22:30:15,293 INFO L280 TraceCheckUtils]: 20: Hoare triple {1217#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1217#false} is VALID [2020-07-17 22:30:15,293 INFO L263 TraceCheckUtils]: 21: Hoare triple {1217#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1217#false} is VALID [2020-07-17 22:30:15,294 INFO L280 TraceCheckUtils]: 22: Hoare triple {1217#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1217#false} is VALID [2020-07-17 22:30:15,294 INFO L280 TraceCheckUtils]: 23: Hoare triple {1217#false} assume true; {1217#false} is VALID [2020-07-17 22:30:15,294 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1217#false} {1217#false} #57#return; {1217#false} is VALID [2020-07-17 22:30:15,294 INFO L280 TraceCheckUtils]: 25: Hoare triple {1217#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1217#false} is VALID [2020-07-17 22:30:15,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {1217#false} assume 0 == #t~ret8;havoc #t~ret8; {1217#false} is VALID [2020-07-17 22:30:15,295 INFO L280 TraceCheckUtils]: 27: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2020-07-17 22:30:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:15,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:15,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-17 22:30:15,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096535317] [2020-07-17 22:30:15,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-17 22:30:15,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:15,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:30:15,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:15,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:30:15,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:30:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:30:15,347 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2020-07-17 22:30:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:15,613 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-17 22:30:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:30:15,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-17 22:30:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:30:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-07-17 22:30:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:30:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-07-17 22:30:15,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2020-07-17 22:30:15,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:15,677 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:30:15,677 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:30:15,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:30:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:30:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-17 22:30:15,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:15,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-17 22:30:15,696 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-17 22:30:15,696 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-17 22:30:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:15,699 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-17 22:30:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-17 22:30:15,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:15,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:15,702 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-17 22:30:15,703 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-17 22:30:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:15,705 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-17 22:30:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-17 22:30:15,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:15,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:15,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:15,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:30:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-07-17 22:30:15,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2020-07-17 22:30:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:15,711 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-07-17 22:30:15,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:30:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-17 22:30:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:30:15,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:15,716 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:15,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:30:15,931 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2147351063, now seen corresponding path program 6 times [2020-07-17 22:30:15,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:15,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735957815] [2020-07-17 22:30:15,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:16,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {1503#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1488#true} is VALID [2020-07-17 22:30:16,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-17 22:30:16,110 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-17 22:30:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:16,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {1488#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1488#true} is VALID [2020-07-17 22:30:16,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-17 22:30:16,120 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1488#true} {1489#false} #57#return; {1489#false} is VALID [2020-07-17 22:30:16,121 INFO L263 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1503#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:16,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {1503#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1488#true} is VALID [2020-07-17 22:30:16,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-17 22:30:16,121 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-17 22:30:16,121 INFO L263 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret9 := main(); {1488#true} is VALID [2020-07-17 22:30:16,122 INFO L280 TraceCheckUtils]: 5: Hoare triple {1488#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1493#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:16,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {1493#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1493#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:16,123 INFO L280 TraceCheckUtils]: 7: Hoare triple {1493#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1494#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:16,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {1494#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1494#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:16,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {1494#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1495#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:16,125 INFO L280 TraceCheckUtils]: 10: Hoare triple {1495#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1495#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:16,125 INFO L280 TraceCheckUtils]: 11: Hoare triple {1495#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1496#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:16,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1496#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:16,130 INFO L280 TraceCheckUtils]: 13: Hoare triple {1496#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1497#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:16,131 INFO L280 TraceCheckUtils]: 14: Hoare triple {1497#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1497#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:16,132 INFO L280 TraceCheckUtils]: 15: Hoare triple {1497#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1498#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:16,133 INFO L280 TraceCheckUtils]: 16: Hoare triple {1498#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1498#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:16,134 INFO L280 TraceCheckUtils]: 17: Hoare triple {1498#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1499#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:16,134 INFO L280 TraceCheckUtils]: 18: Hoare triple {1499#(<= main_~j~0 6)} assume !(~j~0 < 20); {1489#false} is VALID [2020-07-17 22:30:16,135 INFO L280 TraceCheckUtils]: 19: Hoare triple {1489#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1489#false} is VALID [2020-07-17 22:30:16,135 INFO L280 TraceCheckUtils]: 20: Hoare triple {1489#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1489#false} is VALID [2020-07-17 22:30:16,135 INFO L280 TraceCheckUtils]: 21: Hoare triple {1489#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1489#false} is VALID [2020-07-17 22:30:16,135 INFO L280 TraceCheckUtils]: 22: Hoare triple {1489#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1489#false} is VALID [2020-07-17 22:30:16,136 INFO L263 TraceCheckUtils]: 23: Hoare triple {1489#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1488#true} is VALID [2020-07-17 22:30:16,136 INFO L280 TraceCheckUtils]: 24: Hoare triple {1488#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1488#true} is VALID [2020-07-17 22:30:16,136 INFO L280 TraceCheckUtils]: 25: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-17 22:30:16,136 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1488#true} {1489#false} #57#return; {1489#false} is VALID [2020-07-17 22:30:16,137 INFO L280 TraceCheckUtils]: 27: Hoare triple {1489#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1489#false} is VALID [2020-07-17 22:30:16,137 INFO L280 TraceCheckUtils]: 28: Hoare triple {1489#false} assume 0 == #t~ret8;havoc #t~ret8; {1489#false} is VALID [2020-07-17 22:30:16,137 INFO L280 TraceCheckUtils]: 29: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2020-07-17 22:30:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:16,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735957815] [2020-07-17 22:30:16,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844826437] [2020-07-17 22:30:16,140 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:16,256 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-17 22:30:16,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:16,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:30:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:16,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:16,391 INFO L263 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1488#true} is VALID [2020-07-17 22:30:16,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1488#true} is VALID [2020-07-17 22:30:16,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2020-07-17 22:30:16,392 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #53#return; {1488#true} is VALID [2020-07-17 22:30:16,392 INFO L263 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret9 := main(); {1488#true} is VALID [2020-07-17 22:30:16,393 INFO L280 TraceCheckUtils]: 5: Hoare triple {1488#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1522#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:16,393 INFO L280 TraceCheckUtils]: 6: Hoare triple {1522#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1522#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:16,394 INFO L280 TraceCheckUtils]: 7: Hoare triple {1522#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1494#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:16,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {1494#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1494#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:16,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {1494#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1495#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:16,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {1495#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1495#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:16,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {1495#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1496#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:16,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1496#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:16,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {1496#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1497#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:16,405 INFO L280 TraceCheckUtils]: 14: Hoare triple {1497#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1497#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:16,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {1497#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1498#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:16,406 INFO L280 TraceCheckUtils]: 16: Hoare triple {1498#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1498#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:16,407 INFO L280 TraceCheckUtils]: 17: Hoare triple {1498#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1499#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:16,407 INFO L280 TraceCheckUtils]: 18: Hoare triple {1499#(<= main_~j~0 6)} assume !(~j~0 < 20); {1489#false} is VALID [2020-07-17 22:30:16,407 INFO L280 TraceCheckUtils]: 19: Hoare triple {1489#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1489#false} is VALID [2020-07-17 22:30:16,408 INFO L280 TraceCheckUtils]: 20: Hoare triple {1489#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1489#false} is VALID [2020-07-17 22:30:16,408 INFO L280 TraceCheckUtils]: 21: Hoare triple {1489#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1489#false} is VALID [2020-07-17 22:30:16,408 INFO L280 TraceCheckUtils]: 22: Hoare triple {1489#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1489#false} is VALID [2020-07-17 22:30:16,408 INFO L263 TraceCheckUtils]: 23: Hoare triple {1489#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1489#false} is VALID [2020-07-17 22:30:16,408 INFO L280 TraceCheckUtils]: 24: Hoare triple {1489#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1489#false} is VALID [2020-07-17 22:30:16,409 INFO L280 TraceCheckUtils]: 25: Hoare triple {1489#false} assume true; {1489#false} is VALID [2020-07-17 22:30:16,409 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1489#false} {1489#false} #57#return; {1489#false} is VALID [2020-07-17 22:30:16,409 INFO L280 TraceCheckUtils]: 27: Hoare triple {1489#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1489#false} is VALID [2020-07-17 22:30:16,409 INFO L280 TraceCheckUtils]: 28: Hoare triple {1489#false} assume 0 == #t~ret8;havoc #t~ret8; {1489#false} is VALID [2020-07-17 22:30:16,409 INFO L280 TraceCheckUtils]: 29: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2020-07-17 22:30:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:16,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:16,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-17 22:30:16,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824222099] [2020-07-17 22:30:16,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-17 22:30:16,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:16,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:30:16,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:16,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:30:16,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:30:16,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:30:16,470 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 11 states. [2020-07-17 22:30:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:16,718 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-17 22:30:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:30:16,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-17 22:30:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:30:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-17 22:30:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:30:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-17 22:30:16,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2020-07-17 22:30:16,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:16,788 INFO L225 Difference]: With dead ends: 46 [2020-07-17 22:30:16,788 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:30:16,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:30:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:30:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-17 22:30:16,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:16,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-17 22:30:16,815 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-17 22:30:16,815 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-17 22:30:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:16,817 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-17 22:30:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-17 22:30:16,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:16,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:16,818 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-17 22:30:16,818 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-17 22:30:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:16,820 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-17 22:30:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-17 22:30:16,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:16,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:16,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:16,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:30:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-07-17 22:30:16,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2020-07-17 22:30:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:16,823 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-07-17 22:30:16,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:30:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-17 22:30:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:30:16,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:16,824 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:17,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:17,037 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:17,038 INFO L82 PathProgramCache]: Analyzing trace with hash -133817927, now seen corresponding path program 7 times [2020-07-17 22:30:17,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:17,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900402369] [2020-07-17 22:30:17,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:17,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {1793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-17 22:30:17,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-17 22:30:17,203 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-17 22:30:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:17,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {1777#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1777#true} is VALID [2020-07-17 22:30:17,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-17 22:30:17,213 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1778#false} #57#return; {1778#false} is VALID [2020-07-17 22:30:17,215 INFO L263 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:17,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {1793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-17 22:30:17,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-17 22:30:17,216 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-17 22:30:17,216 INFO L263 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2020-07-17 22:30:17,217 INFO L280 TraceCheckUtils]: 5: Hoare triple {1777#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1782#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:17,217 INFO L280 TraceCheckUtils]: 6: Hoare triple {1782#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1782#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:17,218 INFO L280 TraceCheckUtils]: 7: Hoare triple {1782#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1783#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:17,218 INFO L280 TraceCheckUtils]: 8: Hoare triple {1783#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1783#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:17,219 INFO L280 TraceCheckUtils]: 9: Hoare triple {1783#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1784#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:17,219 INFO L280 TraceCheckUtils]: 10: Hoare triple {1784#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1784#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:17,220 INFO L280 TraceCheckUtils]: 11: Hoare triple {1784#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1785#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:17,224 INFO L280 TraceCheckUtils]: 12: Hoare triple {1785#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1785#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:17,231 INFO L280 TraceCheckUtils]: 13: Hoare triple {1785#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1786#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:17,232 INFO L280 TraceCheckUtils]: 14: Hoare triple {1786#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1786#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:17,233 INFO L280 TraceCheckUtils]: 15: Hoare triple {1786#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1787#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:17,233 INFO L280 TraceCheckUtils]: 16: Hoare triple {1787#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1787#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:17,234 INFO L280 TraceCheckUtils]: 17: Hoare triple {1787#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1788#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:17,234 INFO L280 TraceCheckUtils]: 18: Hoare triple {1788#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1788#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:17,235 INFO L280 TraceCheckUtils]: 19: Hoare triple {1788#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1789#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:17,236 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= main_~j~0 7)} assume !(~j~0 < 20); {1778#false} is VALID [2020-07-17 22:30:17,236 INFO L280 TraceCheckUtils]: 21: Hoare triple {1778#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1778#false} is VALID [2020-07-17 22:30:17,236 INFO L280 TraceCheckUtils]: 22: Hoare triple {1778#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1778#false} is VALID [2020-07-17 22:30:17,237 INFO L280 TraceCheckUtils]: 23: Hoare triple {1778#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1778#false} is VALID [2020-07-17 22:30:17,237 INFO L280 TraceCheckUtils]: 24: Hoare triple {1778#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1778#false} is VALID [2020-07-17 22:30:17,237 INFO L263 TraceCheckUtils]: 25: Hoare triple {1778#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1777#true} is VALID [2020-07-17 22:30:17,237 INFO L280 TraceCheckUtils]: 26: Hoare triple {1777#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1777#true} is VALID [2020-07-17 22:30:17,237 INFO L280 TraceCheckUtils]: 27: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-17 22:30:17,238 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1777#true} {1778#false} #57#return; {1778#false} is VALID [2020-07-17 22:30:17,238 INFO L280 TraceCheckUtils]: 29: Hoare triple {1778#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1778#false} is VALID [2020-07-17 22:30:17,238 INFO L280 TraceCheckUtils]: 30: Hoare triple {1778#false} assume 0 == #t~ret8;havoc #t~ret8; {1778#false} is VALID [2020-07-17 22:30:17,239 INFO L280 TraceCheckUtils]: 31: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2020-07-17 22:30:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:17,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900402369] [2020-07-17 22:30:17,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982296615] [2020-07-17 22:30:17,241 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:17,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:30:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:17,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:17,396 INFO L263 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2020-07-17 22:30:17,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-17 22:30:17,396 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-17 22:30:17,397 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #53#return; {1777#true} is VALID [2020-07-17 22:30:17,397 INFO L263 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2020-07-17 22:30:17,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {1777#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1812#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:17,398 INFO L280 TraceCheckUtils]: 6: Hoare triple {1812#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1812#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:17,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {1812#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1783#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:17,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {1783#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1783#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:17,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {1783#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1784#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:17,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {1784#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1784#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:17,406 INFO L280 TraceCheckUtils]: 11: Hoare triple {1784#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1785#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:17,407 INFO L280 TraceCheckUtils]: 12: Hoare triple {1785#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1785#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:17,408 INFO L280 TraceCheckUtils]: 13: Hoare triple {1785#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1786#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:17,408 INFO L280 TraceCheckUtils]: 14: Hoare triple {1786#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1786#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:17,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {1786#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1787#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:17,409 INFO L280 TraceCheckUtils]: 16: Hoare triple {1787#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1787#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:17,410 INFO L280 TraceCheckUtils]: 17: Hoare triple {1787#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1788#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:17,410 INFO L280 TraceCheckUtils]: 18: Hoare triple {1788#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1788#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:17,412 INFO L280 TraceCheckUtils]: 19: Hoare triple {1788#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1789#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:17,419 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= main_~j~0 7)} assume !(~j~0 < 20); {1778#false} is VALID [2020-07-17 22:30:17,420 INFO L280 TraceCheckUtils]: 21: Hoare triple {1778#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1778#false} is VALID [2020-07-17 22:30:17,420 INFO L280 TraceCheckUtils]: 22: Hoare triple {1778#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1778#false} is VALID [2020-07-17 22:30:17,420 INFO L280 TraceCheckUtils]: 23: Hoare triple {1778#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1778#false} is VALID [2020-07-17 22:30:17,420 INFO L280 TraceCheckUtils]: 24: Hoare triple {1778#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1778#false} is VALID [2020-07-17 22:30:17,421 INFO L263 TraceCheckUtils]: 25: Hoare triple {1778#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1778#false} is VALID [2020-07-17 22:30:17,421 INFO L280 TraceCheckUtils]: 26: Hoare triple {1778#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1778#false} is VALID [2020-07-17 22:30:17,421 INFO L280 TraceCheckUtils]: 27: Hoare triple {1778#false} assume true; {1778#false} is VALID [2020-07-17 22:30:17,421 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1778#false} {1778#false} #57#return; {1778#false} is VALID [2020-07-17 22:30:17,421 INFO L280 TraceCheckUtils]: 29: Hoare triple {1778#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1778#false} is VALID [2020-07-17 22:30:17,421 INFO L280 TraceCheckUtils]: 30: Hoare triple {1778#false} assume 0 == #t~ret8;havoc #t~ret8; {1778#false} is VALID [2020-07-17 22:30:17,422 INFO L280 TraceCheckUtils]: 31: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2020-07-17 22:30:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:17,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:17,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-07-17 22:30:17,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359995478] [2020-07-17 22:30:17,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-17 22:30:17,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:17,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:30:17,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:17,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:30:17,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:17,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:30:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:30:17,472 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 12 states. [2020-07-17 22:30:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:17,762 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-17 22:30:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:30:17,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-17 22:30:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:30:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-17 22:30:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:30:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-17 22:30:17,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2020-07-17 22:30:17,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:17,838 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:30:17,838 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:30:17,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:30:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:30:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-17 22:30:17,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:17,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-17 22:30:17,857 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-17 22:30:17,857 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-17 22:30:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:17,859 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 22:30:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-17 22:30:17,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:17,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:17,860 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-17 22:30:17,860 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-17 22:30:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:17,862 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 22:30:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-17 22:30:17,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:17,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:17,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:17,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:30:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-17 22:30:17,864 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2020-07-17 22:30:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:17,865 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-17 22:30:17,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:30:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-17 22:30:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:30:17,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:17,866 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:18,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:18,079 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1903896357, now seen corresponding path program 8 times [2020-07-17 22:30:18,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:18,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137290416] [2020-07-17 22:30:18,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:18,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {2100#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2083#true} is VALID [2020-07-17 22:30:18,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-17 22:30:18,252 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-17 22:30:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:18,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {2083#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2083#true} is VALID [2020-07-17 22:30:18,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-17 22:30:18,267 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2083#true} {2084#false} #57#return; {2084#false} is VALID [2020-07-17 22:30:18,268 INFO L263 TraceCheckUtils]: 0: Hoare triple {2083#true} call ULTIMATE.init(); {2100#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:18,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {2100#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2083#true} is VALID [2020-07-17 22:30:18,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-17 22:30:18,268 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-17 22:30:18,269 INFO L263 TraceCheckUtils]: 4: Hoare triple {2083#true} call #t~ret9 := main(); {2083#true} is VALID [2020-07-17 22:30:18,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {2083#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2088#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:18,270 INFO L280 TraceCheckUtils]: 6: Hoare triple {2088#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2088#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:18,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {2088#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2089#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:18,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {2089#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2089#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:18,272 INFO L280 TraceCheckUtils]: 9: Hoare triple {2089#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2090#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:18,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {2090#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2090#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:18,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {2090#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2091#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:18,275 INFO L280 TraceCheckUtils]: 12: Hoare triple {2091#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2091#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:18,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {2091#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2092#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:18,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {2092#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2092#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:18,277 INFO L280 TraceCheckUtils]: 15: Hoare triple {2092#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2093#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:18,277 INFO L280 TraceCheckUtils]: 16: Hoare triple {2093#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2093#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:18,278 INFO L280 TraceCheckUtils]: 17: Hoare triple {2093#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2094#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:18,279 INFO L280 TraceCheckUtils]: 18: Hoare triple {2094#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2094#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:18,279 INFO L280 TraceCheckUtils]: 19: Hoare triple {2094#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2095#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:18,280 INFO L280 TraceCheckUtils]: 20: Hoare triple {2095#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2095#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:18,281 INFO L280 TraceCheckUtils]: 21: Hoare triple {2095#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2096#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:18,281 INFO L280 TraceCheckUtils]: 22: Hoare triple {2096#(<= main_~j~0 8)} assume !(~j~0 < 20); {2084#false} is VALID [2020-07-17 22:30:18,282 INFO L280 TraceCheckUtils]: 23: Hoare triple {2084#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2084#false} is VALID [2020-07-17 22:30:18,282 INFO L280 TraceCheckUtils]: 24: Hoare triple {2084#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2084#false} is VALID [2020-07-17 22:30:18,282 INFO L280 TraceCheckUtils]: 25: Hoare triple {2084#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2084#false} is VALID [2020-07-17 22:30:18,282 INFO L280 TraceCheckUtils]: 26: Hoare triple {2084#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2084#false} is VALID [2020-07-17 22:30:18,282 INFO L263 TraceCheckUtils]: 27: Hoare triple {2084#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2083#true} is VALID [2020-07-17 22:30:18,283 INFO L280 TraceCheckUtils]: 28: Hoare triple {2083#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2083#true} is VALID [2020-07-17 22:30:18,283 INFO L280 TraceCheckUtils]: 29: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-17 22:30:18,283 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2083#true} {2084#false} #57#return; {2084#false} is VALID [2020-07-17 22:30:18,283 INFO L280 TraceCheckUtils]: 31: Hoare triple {2084#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2084#false} is VALID [2020-07-17 22:30:18,283 INFO L280 TraceCheckUtils]: 32: Hoare triple {2084#false} assume 0 == #t~ret8;havoc #t~ret8; {2084#false} is VALID [2020-07-17 22:30:18,283 INFO L280 TraceCheckUtils]: 33: Hoare triple {2084#false} assume !false; {2084#false} is VALID [2020-07-17 22:30:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:18,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137290416] [2020-07-17 22:30:18,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665086249] [2020-07-17 22:30:18,285 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:18,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:30:18,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:18,351 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:30:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:18,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:18,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {2083#true} call ULTIMATE.init(); {2083#true} is VALID [2020-07-17 22:30:18,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {2083#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2083#true} is VALID [2020-07-17 22:30:18,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {2083#true} assume true; {2083#true} is VALID [2020-07-17 22:30:18,524 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2083#true} {2083#true} #53#return; {2083#true} is VALID [2020-07-17 22:30:18,524 INFO L263 TraceCheckUtils]: 4: Hoare triple {2083#true} call #t~ret9 := main(); {2083#true} is VALID [2020-07-17 22:30:18,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {2083#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2119#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:18,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {2119#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2119#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:18,527 INFO L280 TraceCheckUtils]: 7: Hoare triple {2119#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2089#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:18,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {2089#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2089#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:18,528 INFO L280 TraceCheckUtils]: 9: Hoare triple {2089#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2090#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:18,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {2090#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2090#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:18,529 INFO L280 TraceCheckUtils]: 11: Hoare triple {2090#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2091#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:18,530 INFO L280 TraceCheckUtils]: 12: Hoare triple {2091#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2091#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:18,531 INFO L280 TraceCheckUtils]: 13: Hoare triple {2091#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2092#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:18,531 INFO L280 TraceCheckUtils]: 14: Hoare triple {2092#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2092#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:18,532 INFO L280 TraceCheckUtils]: 15: Hoare triple {2092#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2093#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:18,533 INFO L280 TraceCheckUtils]: 16: Hoare triple {2093#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2093#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:18,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {2093#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2094#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:18,535 INFO L280 TraceCheckUtils]: 18: Hoare triple {2094#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2094#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:18,555 INFO L280 TraceCheckUtils]: 19: Hoare triple {2094#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2095#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:18,556 INFO L280 TraceCheckUtils]: 20: Hoare triple {2095#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2095#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:18,558 INFO L280 TraceCheckUtils]: 21: Hoare triple {2095#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2096#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:18,559 INFO L280 TraceCheckUtils]: 22: Hoare triple {2096#(<= main_~j~0 8)} assume !(~j~0 < 20); {2084#false} is VALID [2020-07-17 22:30:18,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {2084#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2084#false} is VALID [2020-07-17 22:30:18,560 INFO L280 TraceCheckUtils]: 24: Hoare triple {2084#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2084#false} is VALID [2020-07-17 22:30:18,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {2084#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2084#false} is VALID [2020-07-17 22:30:18,560 INFO L280 TraceCheckUtils]: 26: Hoare triple {2084#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2084#false} is VALID [2020-07-17 22:30:18,560 INFO L263 TraceCheckUtils]: 27: Hoare triple {2084#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2084#false} is VALID [2020-07-17 22:30:18,560 INFO L280 TraceCheckUtils]: 28: Hoare triple {2084#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2084#false} is VALID [2020-07-17 22:30:18,561 INFO L280 TraceCheckUtils]: 29: Hoare triple {2084#false} assume true; {2084#false} is VALID [2020-07-17 22:30:18,561 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2084#false} {2084#false} #57#return; {2084#false} is VALID [2020-07-17 22:30:18,561 INFO L280 TraceCheckUtils]: 31: Hoare triple {2084#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2084#false} is VALID [2020-07-17 22:30:18,561 INFO L280 TraceCheckUtils]: 32: Hoare triple {2084#false} assume 0 == #t~ret8;havoc #t~ret8; {2084#false} is VALID [2020-07-17 22:30:18,561 INFO L280 TraceCheckUtils]: 33: Hoare triple {2084#false} assume !false; {2084#false} is VALID [2020-07-17 22:30:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:18,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:18,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2020-07-17 22:30:18,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185622753] [2020-07-17 22:30:18,564 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-17 22:30:18,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:18,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:30:18,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:18,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:30:18,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:18,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:30:18,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:30:18,619 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2020-07-17 22:30:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:18,789 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2020-07-17 22:30:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:30:18,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-07-17 22:30:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:30:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-17 22:30:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:30:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-17 22:30:18,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2020-07-17 22:30:18,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:18,867 INFO L225 Difference]: With dead ends: 50 [2020-07-17 22:30:18,867 INFO L226 Difference]: Without dead ends: 38 [2020-07-17 22:30:18,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:30:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-17 22:30:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-17 22:30:18,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:18,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-17 22:30:18,915 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-17 22:30:18,915 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-17 22:30:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:18,916 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-17 22:30:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-17 22:30:18,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:18,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:18,917 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-17 22:30:18,917 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-17 22:30:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:18,920 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-17 22:30:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-17 22:30:18,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:18,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:18,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:18,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:30:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-07-17 22:30:18,922 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2020-07-17 22:30:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:18,923 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-07-17 22:30:18,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:30:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-07-17 22:30:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 22:30:18,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:18,925 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:19,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-17 22:30:19,136 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:19,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2142218371, now seen corresponding path program 9 times [2020-07-17 22:30:19,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:19,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093920344] [2020-07-17 22:30:19,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:19,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {2424#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2406#true} is VALID [2020-07-17 22:30:19,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-17 22:30:19,352 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-17 22:30:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:19,358 INFO L280 TraceCheckUtils]: 0: Hoare triple {2406#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2406#true} is VALID [2020-07-17 22:30:19,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-17 22:30:19,359 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2407#false} #57#return; {2407#false} is VALID [2020-07-17 22:30:19,361 INFO L263 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2424#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:19,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {2424#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2406#true} is VALID [2020-07-17 22:30:19,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-17 22:30:19,382 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-17 22:30:19,382 INFO L263 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret9 := main(); {2406#true} is VALID [2020-07-17 22:30:19,383 INFO L280 TraceCheckUtils]: 5: Hoare triple {2406#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2411#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:19,384 INFO L280 TraceCheckUtils]: 6: Hoare triple {2411#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2411#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:19,386 INFO L280 TraceCheckUtils]: 7: Hoare triple {2411#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2412#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:19,388 INFO L280 TraceCheckUtils]: 8: Hoare triple {2412#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2412#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:19,390 INFO L280 TraceCheckUtils]: 9: Hoare triple {2412#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2413#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:19,391 INFO L280 TraceCheckUtils]: 10: Hoare triple {2413#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2413#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:19,392 INFO L280 TraceCheckUtils]: 11: Hoare triple {2413#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2414#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:19,393 INFO L280 TraceCheckUtils]: 12: Hoare triple {2414#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2414#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:19,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {2414#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2415#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:19,395 INFO L280 TraceCheckUtils]: 14: Hoare triple {2415#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2415#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:19,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {2415#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2416#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:19,396 INFO L280 TraceCheckUtils]: 16: Hoare triple {2416#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2416#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:19,397 INFO L280 TraceCheckUtils]: 17: Hoare triple {2416#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2417#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:19,398 INFO L280 TraceCheckUtils]: 18: Hoare triple {2417#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2417#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:19,399 INFO L280 TraceCheckUtils]: 19: Hoare triple {2417#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2418#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:19,400 INFO L280 TraceCheckUtils]: 20: Hoare triple {2418#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2418#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:19,401 INFO L280 TraceCheckUtils]: 21: Hoare triple {2418#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2419#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:19,401 INFO L280 TraceCheckUtils]: 22: Hoare triple {2419#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2419#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:19,404 INFO L280 TraceCheckUtils]: 23: Hoare triple {2419#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2420#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:19,406 INFO L280 TraceCheckUtils]: 24: Hoare triple {2420#(<= main_~j~0 9)} assume !(~j~0 < 20); {2407#false} is VALID [2020-07-17 22:30:19,406 INFO L280 TraceCheckUtils]: 25: Hoare triple {2407#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2407#false} is VALID [2020-07-17 22:30:19,406 INFO L280 TraceCheckUtils]: 26: Hoare triple {2407#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2407#false} is VALID [2020-07-17 22:30:19,406 INFO L280 TraceCheckUtils]: 27: Hoare triple {2407#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2407#false} is VALID [2020-07-17 22:30:19,407 INFO L280 TraceCheckUtils]: 28: Hoare triple {2407#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2407#false} is VALID [2020-07-17 22:30:19,407 INFO L263 TraceCheckUtils]: 29: Hoare triple {2407#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2406#true} is VALID [2020-07-17 22:30:19,407 INFO L280 TraceCheckUtils]: 30: Hoare triple {2406#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2406#true} is VALID [2020-07-17 22:30:19,407 INFO L280 TraceCheckUtils]: 31: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-17 22:30:19,407 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2406#true} {2407#false} #57#return; {2407#false} is VALID [2020-07-17 22:30:19,408 INFO L280 TraceCheckUtils]: 33: Hoare triple {2407#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2407#false} is VALID [2020-07-17 22:30:19,408 INFO L280 TraceCheckUtils]: 34: Hoare triple {2407#false} assume 0 == #t~ret8;havoc #t~ret8; {2407#false} is VALID [2020-07-17 22:30:19,408 INFO L280 TraceCheckUtils]: 35: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2020-07-17 22:30:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:19,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093920344] [2020-07-17 22:30:19,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721904556] [2020-07-17 22:30:19,411 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:19,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-07-17 22:30:19,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:19,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:30:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:19,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:19,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2020-07-17 22:30:19,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {2406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2406#true} is VALID [2020-07-17 22:30:19,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2020-07-17 22:30:19,796 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #53#return; {2406#true} is VALID [2020-07-17 22:30:19,796 INFO L263 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret9 := main(); {2406#true} is VALID [2020-07-17 22:30:19,797 INFO L280 TraceCheckUtils]: 5: Hoare triple {2406#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2443#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:19,798 INFO L280 TraceCheckUtils]: 6: Hoare triple {2443#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2443#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:19,798 INFO L280 TraceCheckUtils]: 7: Hoare triple {2443#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2412#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:19,799 INFO L280 TraceCheckUtils]: 8: Hoare triple {2412#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2412#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:19,800 INFO L280 TraceCheckUtils]: 9: Hoare triple {2412#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2413#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:19,800 INFO L280 TraceCheckUtils]: 10: Hoare triple {2413#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2413#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:19,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {2413#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2414#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:19,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {2414#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2414#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:19,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {2414#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2415#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:19,803 INFO L280 TraceCheckUtils]: 14: Hoare triple {2415#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2415#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:19,804 INFO L280 TraceCheckUtils]: 15: Hoare triple {2415#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2416#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:19,804 INFO L280 TraceCheckUtils]: 16: Hoare triple {2416#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2416#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:19,805 INFO L280 TraceCheckUtils]: 17: Hoare triple {2416#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2417#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:19,805 INFO L280 TraceCheckUtils]: 18: Hoare triple {2417#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2417#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:19,806 INFO L280 TraceCheckUtils]: 19: Hoare triple {2417#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2418#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:19,807 INFO L280 TraceCheckUtils]: 20: Hoare triple {2418#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2418#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:19,807 INFO L280 TraceCheckUtils]: 21: Hoare triple {2418#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2419#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:19,808 INFO L280 TraceCheckUtils]: 22: Hoare triple {2419#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2419#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:19,809 INFO L280 TraceCheckUtils]: 23: Hoare triple {2419#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2420#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:19,809 INFO L280 TraceCheckUtils]: 24: Hoare triple {2420#(<= main_~j~0 9)} assume !(~j~0 < 20); {2407#false} is VALID [2020-07-17 22:30:19,810 INFO L280 TraceCheckUtils]: 25: Hoare triple {2407#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2407#false} is VALID [2020-07-17 22:30:19,810 INFO L280 TraceCheckUtils]: 26: Hoare triple {2407#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2407#false} is VALID [2020-07-17 22:30:19,810 INFO L280 TraceCheckUtils]: 27: Hoare triple {2407#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2407#false} is VALID [2020-07-17 22:30:19,810 INFO L280 TraceCheckUtils]: 28: Hoare triple {2407#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2407#false} is VALID [2020-07-17 22:30:19,811 INFO L263 TraceCheckUtils]: 29: Hoare triple {2407#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2407#false} is VALID [2020-07-17 22:30:19,811 INFO L280 TraceCheckUtils]: 30: Hoare triple {2407#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2407#false} is VALID [2020-07-17 22:30:19,811 INFO L280 TraceCheckUtils]: 31: Hoare triple {2407#false} assume true; {2407#false} is VALID [2020-07-17 22:30:19,811 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2407#false} {2407#false} #57#return; {2407#false} is VALID [2020-07-17 22:30:19,812 INFO L280 TraceCheckUtils]: 33: Hoare triple {2407#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2407#false} is VALID [2020-07-17 22:30:19,812 INFO L280 TraceCheckUtils]: 34: Hoare triple {2407#false} assume 0 == #t~ret8;havoc #t~ret8; {2407#false} is VALID [2020-07-17 22:30:19,812 INFO L280 TraceCheckUtils]: 35: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2020-07-17 22:30:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:19,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:19,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-07-17 22:30:19,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56938912] [2020-07-17 22:30:19,815 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-17 22:30:19,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:19,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:30:19,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:19,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:30:19,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:19,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:30:19,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:30:19,867 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2020-07-17 22:30:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:20,089 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-17 22:30:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:30:20,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-17 22:30:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:30:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2020-07-17 22:30:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:30:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2020-07-17 22:30:20,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2020-07-17 22:30:20,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:20,163 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:30:20,163 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:30:20,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:30:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:30:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-17 22:30:20,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:20,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-17 22:30:20,186 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-17 22:30:20,186 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-17 22:30:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:20,187 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-17 22:30:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-17 22:30:20,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:20,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:20,188 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-17 22:30:20,188 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-17 22:30:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:20,189 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-07-17 22:30:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-17 22:30:20,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:20,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:20,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:20,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:30:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-07-17 22:30:20,193 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-07-17 22:30:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:20,193 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-07-17 22:30:20,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:30:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-17 22:30:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:30:20,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:20,195 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:20,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:20,396 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:20,396 INFO L82 PathProgramCache]: Analyzing trace with hash 758560159, now seen corresponding path program 10 times [2020-07-17 22:30:20,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:20,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093732113] [2020-07-17 22:30:20,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:20,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {2765#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2746#true} is VALID [2020-07-17 22:30:20,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-17 22:30:20,604 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-17 22:30:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:20,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {2746#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2746#true} is VALID [2020-07-17 22:30:20,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-17 22:30:20,607 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2746#true} {2747#false} #57#return; {2747#false} is VALID [2020-07-17 22:30:20,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2765#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:20,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {2765#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2746#true} is VALID [2020-07-17 22:30:20,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-17 22:30:20,609 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-17 22:30:20,609 INFO L263 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret9 := main(); {2746#true} is VALID [2020-07-17 22:30:20,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {2746#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2751#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:20,610 INFO L280 TraceCheckUtils]: 6: Hoare triple {2751#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2751#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:20,610 INFO L280 TraceCheckUtils]: 7: Hoare triple {2751#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2752#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:20,611 INFO L280 TraceCheckUtils]: 8: Hoare triple {2752#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2752#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:20,611 INFO L280 TraceCheckUtils]: 9: Hoare triple {2752#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2753#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:20,612 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2753#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:20,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {2753#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2754#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:20,612 INFO L280 TraceCheckUtils]: 12: Hoare triple {2754#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2754#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:20,613 INFO L280 TraceCheckUtils]: 13: Hoare triple {2754#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2755#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:20,613 INFO L280 TraceCheckUtils]: 14: Hoare triple {2755#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2755#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:20,614 INFO L280 TraceCheckUtils]: 15: Hoare triple {2755#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2756#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:20,614 INFO L280 TraceCheckUtils]: 16: Hoare triple {2756#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2756#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:20,615 INFO L280 TraceCheckUtils]: 17: Hoare triple {2756#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2757#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:20,615 INFO L280 TraceCheckUtils]: 18: Hoare triple {2757#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2757#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:20,615 INFO L280 TraceCheckUtils]: 19: Hoare triple {2757#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2758#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:20,616 INFO L280 TraceCheckUtils]: 20: Hoare triple {2758#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2758#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:20,616 INFO L280 TraceCheckUtils]: 21: Hoare triple {2758#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2759#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:20,617 INFO L280 TraceCheckUtils]: 22: Hoare triple {2759#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2759#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:20,617 INFO L280 TraceCheckUtils]: 23: Hoare triple {2759#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2760#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:20,618 INFO L280 TraceCheckUtils]: 24: Hoare triple {2760#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2760#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:20,618 INFO L280 TraceCheckUtils]: 25: Hoare triple {2760#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2761#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:20,618 INFO L280 TraceCheckUtils]: 26: Hoare triple {2761#(<= main_~j~0 10)} assume !(~j~0 < 20); {2747#false} is VALID [2020-07-17 22:30:20,619 INFO L280 TraceCheckUtils]: 27: Hoare triple {2747#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2747#false} is VALID [2020-07-17 22:30:20,619 INFO L280 TraceCheckUtils]: 28: Hoare triple {2747#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2747#false} is VALID [2020-07-17 22:30:20,619 INFO L280 TraceCheckUtils]: 29: Hoare triple {2747#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2747#false} is VALID [2020-07-17 22:30:20,619 INFO L280 TraceCheckUtils]: 30: Hoare triple {2747#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2747#false} is VALID [2020-07-17 22:30:20,619 INFO L263 TraceCheckUtils]: 31: Hoare triple {2747#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2746#true} is VALID [2020-07-17 22:30:20,619 INFO L280 TraceCheckUtils]: 32: Hoare triple {2746#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2746#true} is VALID [2020-07-17 22:30:20,619 INFO L280 TraceCheckUtils]: 33: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-17 22:30:20,619 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2746#true} {2747#false} #57#return; {2747#false} is VALID [2020-07-17 22:30:20,620 INFO L280 TraceCheckUtils]: 35: Hoare triple {2747#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2747#false} is VALID [2020-07-17 22:30:20,620 INFO L280 TraceCheckUtils]: 36: Hoare triple {2747#false} assume 0 == #t~ret8;havoc #t~ret8; {2747#false} is VALID [2020-07-17 22:30:20,620 INFO L280 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2020-07-17 22:30:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:20,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093732113] [2020-07-17 22:30:20,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543485816] [2020-07-17 22:30:20,621 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:20,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:30:20,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:20,663 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:30:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:20,679 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:20,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {2746#true} call ULTIMATE.init(); {2746#true} is VALID [2020-07-17 22:30:20,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {2746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2746#true} is VALID [2020-07-17 22:30:20,783 INFO L280 TraceCheckUtils]: 2: Hoare triple {2746#true} assume true; {2746#true} is VALID [2020-07-17 22:30:20,783 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2746#true} {2746#true} #53#return; {2746#true} is VALID [2020-07-17 22:30:20,783 INFO L263 TraceCheckUtils]: 4: Hoare triple {2746#true} call #t~ret9 := main(); {2746#true} is VALID [2020-07-17 22:30:20,801 INFO L280 TraceCheckUtils]: 5: Hoare triple {2746#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2784#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:20,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {2784#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2784#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:20,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {2784#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2752#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:20,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {2752#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2752#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:20,809 INFO L280 TraceCheckUtils]: 9: Hoare triple {2752#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2753#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:20,809 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2753#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:20,810 INFO L280 TraceCheckUtils]: 11: Hoare triple {2753#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2754#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:20,810 INFO L280 TraceCheckUtils]: 12: Hoare triple {2754#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2754#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:20,810 INFO L280 TraceCheckUtils]: 13: Hoare triple {2754#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2755#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:20,811 INFO L280 TraceCheckUtils]: 14: Hoare triple {2755#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2755#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:20,811 INFO L280 TraceCheckUtils]: 15: Hoare triple {2755#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2756#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:20,812 INFO L280 TraceCheckUtils]: 16: Hoare triple {2756#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2756#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:20,812 INFO L280 TraceCheckUtils]: 17: Hoare triple {2756#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2757#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:20,812 INFO L280 TraceCheckUtils]: 18: Hoare triple {2757#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2757#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:20,813 INFO L280 TraceCheckUtils]: 19: Hoare triple {2757#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2758#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:20,814 INFO L280 TraceCheckUtils]: 20: Hoare triple {2758#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2758#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:20,817 INFO L280 TraceCheckUtils]: 21: Hoare triple {2758#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2759#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:20,818 INFO L280 TraceCheckUtils]: 22: Hoare triple {2759#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2759#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:20,818 INFO L280 TraceCheckUtils]: 23: Hoare triple {2759#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2760#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:20,819 INFO L280 TraceCheckUtils]: 24: Hoare triple {2760#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2760#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:20,819 INFO L280 TraceCheckUtils]: 25: Hoare triple {2760#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2761#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:20,820 INFO L280 TraceCheckUtils]: 26: Hoare triple {2761#(<= main_~j~0 10)} assume !(~j~0 < 20); {2747#false} is VALID [2020-07-17 22:30:20,820 INFO L280 TraceCheckUtils]: 27: Hoare triple {2747#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2747#false} is VALID [2020-07-17 22:30:20,820 INFO L280 TraceCheckUtils]: 28: Hoare triple {2747#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2747#false} is VALID [2020-07-17 22:30:20,820 INFO L280 TraceCheckUtils]: 29: Hoare triple {2747#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2747#false} is VALID [2020-07-17 22:30:20,820 INFO L280 TraceCheckUtils]: 30: Hoare triple {2747#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2747#false} is VALID [2020-07-17 22:30:20,820 INFO L263 TraceCheckUtils]: 31: Hoare triple {2747#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2747#false} is VALID [2020-07-17 22:30:20,821 INFO L280 TraceCheckUtils]: 32: Hoare triple {2747#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2747#false} is VALID [2020-07-17 22:30:20,821 INFO L280 TraceCheckUtils]: 33: Hoare triple {2747#false} assume true; {2747#false} is VALID [2020-07-17 22:30:20,821 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2747#false} {2747#false} #57#return; {2747#false} is VALID [2020-07-17 22:30:20,821 INFO L280 TraceCheckUtils]: 35: Hoare triple {2747#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2747#false} is VALID [2020-07-17 22:30:20,821 INFO L280 TraceCheckUtils]: 36: Hoare triple {2747#false} assume 0 == #t~ret8;havoc #t~ret8; {2747#false} is VALID [2020-07-17 22:30:20,821 INFO L280 TraceCheckUtils]: 37: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2020-07-17 22:30:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:20,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:20,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2020-07-17 22:30:20,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401219427] [2020-07-17 22:30:20,823 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-17 22:30:20,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:20,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-17 22:30:20,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:20,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 22:30:20,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:20,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 22:30:20,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:30:20,884 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 15 states. [2020-07-17 22:30:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:21,205 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-17 22:30:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:30:21,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-17 22:30:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:30:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-17 22:30:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:30:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-17 22:30:21,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2020-07-17 22:30:21,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:21,281 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:30:21,282 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:30:21,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:30:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:30:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-17 22:30:21,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:21,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-17 22:30:21,303 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-17 22:30:21,303 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-17 22:30:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:21,304 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-17 22:30:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-17 22:30:21,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:21,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:21,305 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-17 22:30:21,305 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-17 22:30:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:21,306 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-17 22:30:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-17 22:30:21,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:21,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:21,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:21,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-17 22:30:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2020-07-17 22:30:21,309 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2020-07-17 22:30:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:21,309 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2020-07-17 22:30:21,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 22:30:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-07-17 22:30:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:30:21,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:21,310 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:21,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:21,518 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash 972952385, now seen corresponding path program 11 times [2020-07-17 22:30:21,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:21,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652122589] [2020-07-17 22:30:21,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:21,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {3123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3103#true} is VALID [2020-07-17 22:30:21,730 INFO L280 TraceCheckUtils]: 1: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-17 22:30:21,730 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-17 22:30:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:21,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {3103#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3103#true} is VALID [2020-07-17 22:30:21,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-17 22:30:21,737 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3103#true} {3104#false} #57#return; {3104#false} is VALID [2020-07-17 22:30:21,738 INFO L263 TraceCheckUtils]: 0: Hoare triple {3103#true} call ULTIMATE.init(); {3123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:21,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {3123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3103#true} is VALID [2020-07-17 22:30:21,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-17 22:30:21,738 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-17 22:30:21,738 INFO L263 TraceCheckUtils]: 4: Hoare triple {3103#true} call #t~ret9 := main(); {3103#true} is VALID [2020-07-17 22:30:21,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {3103#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3108#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:21,739 INFO L280 TraceCheckUtils]: 6: Hoare triple {3108#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3108#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:21,740 INFO L280 TraceCheckUtils]: 7: Hoare triple {3108#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3109#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:21,740 INFO L280 TraceCheckUtils]: 8: Hoare triple {3109#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3109#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:21,741 INFO L280 TraceCheckUtils]: 9: Hoare triple {3109#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3110#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:21,742 INFO L280 TraceCheckUtils]: 10: Hoare triple {3110#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3110#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:21,742 INFO L280 TraceCheckUtils]: 11: Hoare triple {3110#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3111#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:21,743 INFO L280 TraceCheckUtils]: 12: Hoare triple {3111#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3111#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:21,743 INFO L280 TraceCheckUtils]: 13: Hoare triple {3111#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3112#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:21,744 INFO L280 TraceCheckUtils]: 14: Hoare triple {3112#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3112#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:21,744 INFO L280 TraceCheckUtils]: 15: Hoare triple {3112#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3113#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:21,744 INFO L280 TraceCheckUtils]: 16: Hoare triple {3113#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3113#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:21,745 INFO L280 TraceCheckUtils]: 17: Hoare triple {3113#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3114#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:21,745 INFO L280 TraceCheckUtils]: 18: Hoare triple {3114#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3114#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:21,747 INFO L280 TraceCheckUtils]: 19: Hoare triple {3114#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3115#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:21,750 INFO L280 TraceCheckUtils]: 20: Hoare triple {3115#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3115#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:21,751 INFO L280 TraceCheckUtils]: 21: Hoare triple {3115#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3116#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:21,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {3116#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3116#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:21,752 INFO L280 TraceCheckUtils]: 23: Hoare triple {3116#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3117#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:21,752 INFO L280 TraceCheckUtils]: 24: Hoare triple {3117#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3117#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:21,753 INFO L280 TraceCheckUtils]: 25: Hoare triple {3117#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3118#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:21,753 INFO L280 TraceCheckUtils]: 26: Hoare triple {3118#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3118#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:21,754 INFO L280 TraceCheckUtils]: 27: Hoare triple {3118#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3119#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:21,754 INFO L280 TraceCheckUtils]: 28: Hoare triple {3119#(<= main_~j~0 11)} assume !(~j~0 < 20); {3104#false} is VALID [2020-07-17 22:30:21,754 INFO L280 TraceCheckUtils]: 29: Hoare triple {3104#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3104#false} is VALID [2020-07-17 22:30:21,754 INFO L280 TraceCheckUtils]: 30: Hoare triple {3104#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3104#false} is VALID [2020-07-17 22:30:21,755 INFO L280 TraceCheckUtils]: 31: Hoare triple {3104#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3104#false} is VALID [2020-07-17 22:30:21,755 INFO L280 TraceCheckUtils]: 32: Hoare triple {3104#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3104#false} is VALID [2020-07-17 22:30:21,755 INFO L263 TraceCheckUtils]: 33: Hoare triple {3104#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3103#true} is VALID [2020-07-17 22:30:21,755 INFO L280 TraceCheckUtils]: 34: Hoare triple {3103#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3103#true} is VALID [2020-07-17 22:30:21,755 INFO L280 TraceCheckUtils]: 35: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-17 22:30:21,755 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3103#true} {3104#false} #57#return; {3104#false} is VALID [2020-07-17 22:30:21,756 INFO L280 TraceCheckUtils]: 37: Hoare triple {3104#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3104#false} is VALID [2020-07-17 22:30:21,756 INFO L280 TraceCheckUtils]: 38: Hoare triple {3104#false} assume 0 == #t~ret8;havoc #t~ret8; {3104#false} is VALID [2020-07-17 22:30:21,756 INFO L280 TraceCheckUtils]: 39: Hoare triple {3104#false} assume !false; {3104#false} is VALID [2020-07-17 22:30:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:21,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652122589] [2020-07-17 22:30:21,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877219760] [2020-07-17 22:30:21,758 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:21,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2020-07-17 22:30:21,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:22,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-17 22:30:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:22,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:22,160 INFO L263 TraceCheckUtils]: 0: Hoare triple {3103#true} call ULTIMATE.init(); {3103#true} is VALID [2020-07-17 22:30:22,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {3103#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3103#true} is VALID [2020-07-17 22:30:22,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {3103#true} assume true; {3103#true} is VALID [2020-07-17 22:30:22,160 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3103#true} {3103#true} #53#return; {3103#true} is VALID [2020-07-17 22:30:22,160 INFO L263 TraceCheckUtils]: 4: Hoare triple {3103#true} call #t~ret9 := main(); {3103#true} is VALID [2020-07-17 22:30:22,161 INFO L280 TraceCheckUtils]: 5: Hoare triple {3103#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3142#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:22,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {3142#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3142#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:22,162 INFO L280 TraceCheckUtils]: 7: Hoare triple {3142#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3109#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:22,162 INFO L280 TraceCheckUtils]: 8: Hoare triple {3109#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3109#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:22,163 INFO L280 TraceCheckUtils]: 9: Hoare triple {3109#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3110#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:22,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {3110#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3110#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:22,164 INFO L280 TraceCheckUtils]: 11: Hoare triple {3110#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3111#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:22,164 INFO L280 TraceCheckUtils]: 12: Hoare triple {3111#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3111#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:22,165 INFO L280 TraceCheckUtils]: 13: Hoare triple {3111#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3112#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:22,165 INFO L280 TraceCheckUtils]: 14: Hoare triple {3112#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3112#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:22,166 INFO L280 TraceCheckUtils]: 15: Hoare triple {3112#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3113#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:22,166 INFO L280 TraceCheckUtils]: 16: Hoare triple {3113#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3113#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:22,167 INFO L280 TraceCheckUtils]: 17: Hoare triple {3113#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3114#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:22,167 INFO L280 TraceCheckUtils]: 18: Hoare triple {3114#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3114#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:22,168 INFO L280 TraceCheckUtils]: 19: Hoare triple {3114#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3115#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:22,168 INFO L280 TraceCheckUtils]: 20: Hoare triple {3115#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3115#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:22,168 INFO L280 TraceCheckUtils]: 21: Hoare triple {3115#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3116#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:22,169 INFO L280 TraceCheckUtils]: 22: Hoare triple {3116#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3116#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:22,169 INFO L280 TraceCheckUtils]: 23: Hoare triple {3116#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3117#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:22,170 INFO L280 TraceCheckUtils]: 24: Hoare triple {3117#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3117#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:22,170 INFO L280 TraceCheckUtils]: 25: Hoare triple {3117#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3118#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:22,171 INFO L280 TraceCheckUtils]: 26: Hoare triple {3118#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3118#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:22,171 INFO L280 TraceCheckUtils]: 27: Hoare triple {3118#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3119#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:22,172 INFO L280 TraceCheckUtils]: 28: Hoare triple {3119#(<= main_~j~0 11)} assume !(~j~0 < 20); {3104#false} is VALID [2020-07-17 22:30:22,172 INFO L280 TraceCheckUtils]: 29: Hoare triple {3104#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3104#false} is VALID [2020-07-17 22:30:22,172 INFO L280 TraceCheckUtils]: 30: Hoare triple {3104#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3104#false} is VALID [2020-07-17 22:30:22,172 INFO L280 TraceCheckUtils]: 31: Hoare triple {3104#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3104#false} is VALID [2020-07-17 22:30:22,172 INFO L280 TraceCheckUtils]: 32: Hoare triple {3104#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3104#false} is VALID [2020-07-17 22:30:22,172 INFO L263 TraceCheckUtils]: 33: Hoare triple {3104#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3104#false} is VALID [2020-07-17 22:30:22,172 INFO L280 TraceCheckUtils]: 34: Hoare triple {3104#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3104#false} is VALID [2020-07-17 22:30:22,173 INFO L280 TraceCheckUtils]: 35: Hoare triple {3104#false} assume true; {3104#false} is VALID [2020-07-17 22:30:22,173 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3104#false} {3104#false} #57#return; {3104#false} is VALID [2020-07-17 22:30:22,173 INFO L280 TraceCheckUtils]: 37: Hoare triple {3104#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3104#false} is VALID [2020-07-17 22:30:22,173 INFO L280 TraceCheckUtils]: 38: Hoare triple {3104#false} assume 0 == #t~ret8;havoc #t~ret8; {3104#false} is VALID [2020-07-17 22:30:22,173 INFO L280 TraceCheckUtils]: 39: Hoare triple {3104#false} assume !false; {3104#false} is VALID [2020-07-17 22:30:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:22,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:22,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2020-07-17 22:30:22,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098755816] [2020-07-17 22:30:22,176 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-17 22:30:22,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:22,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:30:22,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:22,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:30:22,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:30:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:30:22,237 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 16 states. [2020-07-17 22:30:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:22,623 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-17 22:30:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:30:22,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-17 22:30:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:30:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2020-07-17 22:30:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:30:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2020-07-17 22:30:22,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2020-07-17 22:30:22,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:22,705 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:30:22,705 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:30:22,706 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:30:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:30:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-17 22:30:22,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:22,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-17 22:30:22,730 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-17 22:30:22,731 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-17 22:30:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:22,732 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-17 22:30:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-17 22:30:22,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:22,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:22,733 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-17 22:30:22,733 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-17 22:30:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:22,734 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-17 22:30:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-17 22:30:22,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:22,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:22,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:22,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:30:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-07-17 22:30:22,736 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2020-07-17 22:30:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:22,737 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-07-17 22:30:22,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:30:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-07-17 22:30:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-17 22:30:22,737 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:22,738 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:22,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-17 22:30:22,947 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:22,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash 845451363, now seen corresponding path program 12 times [2020-07-17 22:30:22,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:22,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122218619] [2020-07-17 22:30:22,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:23,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {3498#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3477#true} is VALID [2020-07-17 22:30:23,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-17 22:30:23,184 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-17 22:30:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:23,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {3477#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3477#true} is VALID [2020-07-17 22:30:23,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-17 22:30:23,195 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3477#true} {3478#false} #57#return; {3478#false} is VALID [2020-07-17 22:30:23,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3498#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:23,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {3498#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3477#true} is VALID [2020-07-17 22:30:23,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-17 22:30:23,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-17 22:30:23,198 INFO L263 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret9 := main(); {3477#true} is VALID [2020-07-17 22:30:23,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {3477#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3482#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:23,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {3482#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3482#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:23,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {3482#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3483#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:23,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {3483#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3483#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:23,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {3483#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3484#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:23,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {3484#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3484#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:23,203 INFO L280 TraceCheckUtils]: 11: Hoare triple {3484#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3485#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:23,203 INFO L280 TraceCheckUtils]: 12: Hoare triple {3485#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3485#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:23,204 INFO L280 TraceCheckUtils]: 13: Hoare triple {3485#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3486#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:23,204 INFO L280 TraceCheckUtils]: 14: Hoare triple {3486#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3486#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:23,205 INFO L280 TraceCheckUtils]: 15: Hoare triple {3486#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3487#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:23,206 INFO L280 TraceCheckUtils]: 16: Hoare triple {3487#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3487#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:23,206 INFO L280 TraceCheckUtils]: 17: Hoare triple {3487#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3488#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:23,207 INFO L280 TraceCheckUtils]: 18: Hoare triple {3488#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3488#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:23,207 INFO L280 TraceCheckUtils]: 19: Hoare triple {3488#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3489#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:23,208 INFO L280 TraceCheckUtils]: 20: Hoare triple {3489#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3489#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:23,209 INFO L280 TraceCheckUtils]: 21: Hoare triple {3489#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3490#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:23,209 INFO L280 TraceCheckUtils]: 22: Hoare triple {3490#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3490#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:23,210 INFO L280 TraceCheckUtils]: 23: Hoare triple {3490#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3491#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:23,210 INFO L280 TraceCheckUtils]: 24: Hoare triple {3491#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3491#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:23,211 INFO L280 TraceCheckUtils]: 25: Hoare triple {3491#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3492#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:23,212 INFO L280 TraceCheckUtils]: 26: Hoare triple {3492#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3492#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:23,212 INFO L280 TraceCheckUtils]: 27: Hoare triple {3492#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3493#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:23,213 INFO L280 TraceCheckUtils]: 28: Hoare triple {3493#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3493#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:23,213 INFO L280 TraceCheckUtils]: 29: Hoare triple {3493#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3494#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:23,214 INFO L280 TraceCheckUtils]: 30: Hoare triple {3494#(<= main_~j~0 12)} assume !(~j~0 < 20); {3478#false} is VALID [2020-07-17 22:30:23,214 INFO L280 TraceCheckUtils]: 31: Hoare triple {3478#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3478#false} is VALID [2020-07-17 22:30:23,215 INFO L280 TraceCheckUtils]: 32: Hoare triple {3478#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3478#false} is VALID [2020-07-17 22:30:23,215 INFO L280 TraceCheckUtils]: 33: Hoare triple {3478#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3478#false} is VALID [2020-07-17 22:30:23,215 INFO L280 TraceCheckUtils]: 34: Hoare triple {3478#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3478#false} is VALID [2020-07-17 22:30:23,215 INFO L263 TraceCheckUtils]: 35: Hoare triple {3478#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3477#true} is VALID [2020-07-17 22:30:23,215 INFO L280 TraceCheckUtils]: 36: Hoare triple {3477#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3477#true} is VALID [2020-07-17 22:30:23,216 INFO L280 TraceCheckUtils]: 37: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-17 22:30:23,216 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3477#true} {3478#false} #57#return; {3478#false} is VALID [2020-07-17 22:30:23,216 INFO L280 TraceCheckUtils]: 39: Hoare triple {3478#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3478#false} is VALID [2020-07-17 22:30:23,216 INFO L280 TraceCheckUtils]: 40: Hoare triple {3478#false} assume 0 == #t~ret8;havoc #t~ret8; {3478#false} is VALID [2020-07-17 22:30:23,216 INFO L280 TraceCheckUtils]: 41: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2020-07-17 22:30:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:23,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122218619] [2020-07-17 22:30:23,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225559062] [2020-07-17 22:30:23,219 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:24,043 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-07-17 22:30:24,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:24,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 22:30:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:24,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:24,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3477#true} is VALID [2020-07-17 22:30:24,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {3477#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3477#true} is VALID [2020-07-17 22:30:24,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2020-07-17 22:30:24,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #53#return; {3477#true} is VALID [2020-07-17 22:30:24,198 INFO L263 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret9 := main(); {3477#true} is VALID [2020-07-17 22:30:24,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {3477#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3517#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:24,199 INFO L280 TraceCheckUtils]: 6: Hoare triple {3517#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3517#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:24,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {3517#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3483#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:24,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {3483#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3483#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:24,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {3483#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3484#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:24,201 INFO L280 TraceCheckUtils]: 10: Hoare triple {3484#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3484#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:24,202 INFO L280 TraceCheckUtils]: 11: Hoare triple {3484#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3485#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:24,202 INFO L280 TraceCheckUtils]: 12: Hoare triple {3485#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3485#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:24,203 INFO L280 TraceCheckUtils]: 13: Hoare triple {3485#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3486#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:24,203 INFO L280 TraceCheckUtils]: 14: Hoare triple {3486#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3486#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:24,203 INFO L280 TraceCheckUtils]: 15: Hoare triple {3486#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3487#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:24,204 INFO L280 TraceCheckUtils]: 16: Hoare triple {3487#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3487#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:24,204 INFO L280 TraceCheckUtils]: 17: Hoare triple {3487#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3488#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:24,205 INFO L280 TraceCheckUtils]: 18: Hoare triple {3488#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3488#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:24,205 INFO L280 TraceCheckUtils]: 19: Hoare triple {3488#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3489#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:24,206 INFO L280 TraceCheckUtils]: 20: Hoare triple {3489#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3489#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:24,206 INFO L280 TraceCheckUtils]: 21: Hoare triple {3489#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3490#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:24,206 INFO L280 TraceCheckUtils]: 22: Hoare triple {3490#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3490#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:24,207 INFO L280 TraceCheckUtils]: 23: Hoare triple {3490#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3491#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:24,207 INFO L280 TraceCheckUtils]: 24: Hoare triple {3491#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3491#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:24,208 INFO L280 TraceCheckUtils]: 25: Hoare triple {3491#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3492#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:24,209 INFO L280 TraceCheckUtils]: 26: Hoare triple {3492#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3492#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:24,209 INFO L280 TraceCheckUtils]: 27: Hoare triple {3492#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3493#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:24,210 INFO L280 TraceCheckUtils]: 28: Hoare triple {3493#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3493#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:24,210 INFO L280 TraceCheckUtils]: 29: Hoare triple {3493#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3494#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:24,211 INFO L280 TraceCheckUtils]: 30: Hoare triple {3494#(<= main_~j~0 12)} assume !(~j~0 < 20); {3478#false} is VALID [2020-07-17 22:30:24,211 INFO L280 TraceCheckUtils]: 31: Hoare triple {3478#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3478#false} is VALID [2020-07-17 22:30:24,211 INFO L280 TraceCheckUtils]: 32: Hoare triple {3478#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3478#false} is VALID [2020-07-17 22:30:24,211 INFO L280 TraceCheckUtils]: 33: Hoare triple {3478#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3478#false} is VALID [2020-07-17 22:30:24,211 INFO L280 TraceCheckUtils]: 34: Hoare triple {3478#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3478#false} is VALID [2020-07-17 22:30:24,211 INFO L263 TraceCheckUtils]: 35: Hoare triple {3478#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3478#false} is VALID [2020-07-17 22:30:24,212 INFO L280 TraceCheckUtils]: 36: Hoare triple {3478#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3478#false} is VALID [2020-07-17 22:30:24,212 INFO L280 TraceCheckUtils]: 37: Hoare triple {3478#false} assume true; {3478#false} is VALID [2020-07-17 22:30:24,212 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3478#false} {3478#false} #57#return; {3478#false} is VALID [2020-07-17 22:30:24,212 INFO L280 TraceCheckUtils]: 39: Hoare triple {3478#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3478#false} is VALID [2020-07-17 22:30:24,212 INFO L280 TraceCheckUtils]: 40: Hoare triple {3478#false} assume 0 == #t~ret8;havoc #t~ret8; {3478#false} is VALID [2020-07-17 22:30:24,212 INFO L280 TraceCheckUtils]: 41: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2020-07-17 22:30:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:24,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:24,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 17 [2020-07-17 22:30:24,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920127919] [2020-07-17 22:30:24,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2020-07-17 22:30:24,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:24,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-17 22:30:24,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:24,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 22:30:24,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:24,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 22:30:24,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:30:24,278 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 17 states. [2020-07-17 22:30:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:24,575 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2020-07-17 22:30:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 22:30:24,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2020-07-17 22:30:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:30:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2020-07-17 22:30:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:30:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2020-07-17 22:30:24,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 60 transitions. [2020-07-17 22:30:24,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:24,668 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:30:24,669 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 22:30:24,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:30:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 22:30:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-17 22:30:24,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:24,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-17 22:30:24,695 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-17 22:30:24,695 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-17 22:30:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:24,698 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-17 22:30:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-17 22:30:24,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:24,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:24,699 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-17 22:30:24,699 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-17 22:30:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:24,700 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-17 22:30:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-07-17 22:30:24,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:24,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:24,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:24,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:30:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-17 22:30:24,702 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2020-07-17 22:30:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:24,703 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-17 22:30:24,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 22:30:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-17 22:30:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-17 22:30:24,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:24,703 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:24,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-17 22:30:24,916 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1423946491, now seen corresponding path program 13 times [2020-07-17 22:30:24,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:24,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190788610] [2020-07-17 22:30:24,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:25,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {3890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3868#true} is VALID [2020-07-17 22:30:25,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-17 22:30:25,219 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-17 22:30:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:25,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {3868#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3868#true} is VALID [2020-07-17 22:30:25,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-17 22:30:25,224 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3868#true} {3869#false} #57#return; {3869#false} is VALID [2020-07-17 22:30:25,225 INFO L263 TraceCheckUtils]: 0: Hoare triple {3868#true} call ULTIMATE.init(); {3890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:25,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {3890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3868#true} is VALID [2020-07-17 22:30:25,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-17 22:30:25,225 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-17 22:30:25,225 INFO L263 TraceCheckUtils]: 4: Hoare triple {3868#true} call #t~ret9 := main(); {3868#true} is VALID [2020-07-17 22:30:25,226 INFO L280 TraceCheckUtils]: 5: Hoare triple {3868#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3873#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:25,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {3873#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3873#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:25,227 INFO L280 TraceCheckUtils]: 7: Hoare triple {3873#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3874#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:25,228 INFO L280 TraceCheckUtils]: 8: Hoare triple {3874#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3874#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:25,229 INFO L280 TraceCheckUtils]: 9: Hoare triple {3874#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3875#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:25,229 INFO L280 TraceCheckUtils]: 10: Hoare triple {3875#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3875#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:25,230 INFO L280 TraceCheckUtils]: 11: Hoare triple {3875#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3876#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:25,230 INFO L280 TraceCheckUtils]: 12: Hoare triple {3876#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3876#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:25,231 INFO L280 TraceCheckUtils]: 13: Hoare triple {3876#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3877#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:25,232 INFO L280 TraceCheckUtils]: 14: Hoare triple {3877#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3877#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:25,233 INFO L280 TraceCheckUtils]: 15: Hoare triple {3877#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3878#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:25,233 INFO L280 TraceCheckUtils]: 16: Hoare triple {3878#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3878#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:25,233 INFO L280 TraceCheckUtils]: 17: Hoare triple {3878#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3879#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:25,234 INFO L280 TraceCheckUtils]: 18: Hoare triple {3879#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3879#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:25,234 INFO L280 TraceCheckUtils]: 19: Hoare triple {3879#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3880#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:25,235 INFO L280 TraceCheckUtils]: 20: Hoare triple {3880#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3880#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:25,235 INFO L280 TraceCheckUtils]: 21: Hoare triple {3880#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3881#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:25,236 INFO L280 TraceCheckUtils]: 22: Hoare triple {3881#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3881#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:25,236 INFO L280 TraceCheckUtils]: 23: Hoare triple {3881#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3882#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:25,237 INFO L280 TraceCheckUtils]: 24: Hoare triple {3882#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3882#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:25,237 INFO L280 TraceCheckUtils]: 25: Hoare triple {3882#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3883#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:25,238 INFO L280 TraceCheckUtils]: 26: Hoare triple {3883#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3883#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:25,238 INFO L280 TraceCheckUtils]: 27: Hoare triple {3883#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3884#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:25,238 INFO L280 TraceCheckUtils]: 28: Hoare triple {3884#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3884#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:25,239 INFO L280 TraceCheckUtils]: 29: Hoare triple {3884#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3885#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:25,239 INFO L280 TraceCheckUtils]: 30: Hoare triple {3885#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3885#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:25,240 INFO L280 TraceCheckUtils]: 31: Hoare triple {3885#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3886#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:25,240 INFO L280 TraceCheckUtils]: 32: Hoare triple {3886#(<= main_~j~0 13)} assume !(~j~0 < 20); {3869#false} is VALID [2020-07-17 22:30:25,240 INFO L280 TraceCheckUtils]: 33: Hoare triple {3869#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3869#false} is VALID [2020-07-17 22:30:25,241 INFO L280 TraceCheckUtils]: 34: Hoare triple {3869#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3869#false} is VALID [2020-07-17 22:30:25,241 INFO L280 TraceCheckUtils]: 35: Hoare triple {3869#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3869#false} is VALID [2020-07-17 22:30:25,241 INFO L280 TraceCheckUtils]: 36: Hoare triple {3869#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3869#false} is VALID [2020-07-17 22:30:25,241 INFO L263 TraceCheckUtils]: 37: Hoare triple {3869#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3868#true} is VALID [2020-07-17 22:30:25,241 INFO L280 TraceCheckUtils]: 38: Hoare triple {3868#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3868#true} is VALID [2020-07-17 22:30:25,241 INFO L280 TraceCheckUtils]: 39: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-17 22:30:25,241 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3868#true} {3869#false} #57#return; {3869#false} is VALID [2020-07-17 22:30:25,242 INFO L280 TraceCheckUtils]: 41: Hoare triple {3869#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3869#false} is VALID [2020-07-17 22:30:25,242 INFO L280 TraceCheckUtils]: 42: Hoare triple {3869#false} assume 0 == #t~ret8;havoc #t~ret8; {3869#false} is VALID [2020-07-17 22:30:25,242 INFO L280 TraceCheckUtils]: 43: Hoare triple {3869#false} assume !false; {3869#false} is VALID [2020-07-17 22:30:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:25,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190788610] [2020-07-17 22:30:25,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634636323] [2020-07-17 22:30:25,244 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:25,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-17 22:30:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:25,305 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:25,449 INFO L263 TraceCheckUtils]: 0: Hoare triple {3868#true} call ULTIMATE.init(); {3868#true} is VALID [2020-07-17 22:30:25,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3868#true} is VALID [2020-07-17 22:30:25,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {3868#true} assume true; {3868#true} is VALID [2020-07-17 22:30:25,450 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3868#true} {3868#true} #53#return; {3868#true} is VALID [2020-07-17 22:30:25,450 INFO L263 TraceCheckUtils]: 4: Hoare triple {3868#true} call #t~ret9 := main(); {3868#true} is VALID [2020-07-17 22:30:25,452 INFO L280 TraceCheckUtils]: 5: Hoare triple {3868#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3909#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:25,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {3909#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3909#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:25,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {3909#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3874#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:25,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {3874#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3874#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:25,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {3874#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3875#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:25,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {3875#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3875#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:25,456 INFO L280 TraceCheckUtils]: 11: Hoare triple {3875#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3876#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:25,456 INFO L280 TraceCheckUtils]: 12: Hoare triple {3876#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3876#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:25,457 INFO L280 TraceCheckUtils]: 13: Hoare triple {3876#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3877#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:25,458 INFO L280 TraceCheckUtils]: 14: Hoare triple {3877#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3877#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:25,458 INFO L280 TraceCheckUtils]: 15: Hoare triple {3877#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3878#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:25,459 INFO L280 TraceCheckUtils]: 16: Hoare triple {3878#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3878#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:25,459 INFO L280 TraceCheckUtils]: 17: Hoare triple {3878#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3879#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:25,460 INFO L280 TraceCheckUtils]: 18: Hoare triple {3879#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3879#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:25,468 INFO L280 TraceCheckUtils]: 19: Hoare triple {3879#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3880#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:25,469 INFO L280 TraceCheckUtils]: 20: Hoare triple {3880#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3880#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:25,470 INFO L280 TraceCheckUtils]: 21: Hoare triple {3880#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3881#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:25,470 INFO L280 TraceCheckUtils]: 22: Hoare triple {3881#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3881#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:25,471 INFO L280 TraceCheckUtils]: 23: Hoare triple {3881#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3882#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:25,471 INFO L280 TraceCheckUtils]: 24: Hoare triple {3882#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3882#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:25,472 INFO L280 TraceCheckUtils]: 25: Hoare triple {3882#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3883#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:25,472 INFO L280 TraceCheckUtils]: 26: Hoare triple {3883#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3883#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:25,472 INFO L280 TraceCheckUtils]: 27: Hoare triple {3883#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3884#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:25,473 INFO L280 TraceCheckUtils]: 28: Hoare triple {3884#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3884#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:25,474 INFO L280 TraceCheckUtils]: 29: Hoare triple {3884#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3885#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:25,474 INFO L280 TraceCheckUtils]: 30: Hoare triple {3885#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3885#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:25,475 INFO L280 TraceCheckUtils]: 31: Hoare triple {3885#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3886#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:25,475 INFO L280 TraceCheckUtils]: 32: Hoare triple {3886#(<= main_~j~0 13)} assume !(~j~0 < 20); {3869#false} is VALID [2020-07-17 22:30:25,475 INFO L280 TraceCheckUtils]: 33: Hoare triple {3869#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3869#false} is VALID [2020-07-17 22:30:25,475 INFO L280 TraceCheckUtils]: 34: Hoare triple {3869#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3869#false} is VALID [2020-07-17 22:30:25,475 INFO L280 TraceCheckUtils]: 35: Hoare triple {3869#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3869#false} is VALID [2020-07-17 22:30:25,476 INFO L280 TraceCheckUtils]: 36: Hoare triple {3869#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3869#false} is VALID [2020-07-17 22:30:25,476 INFO L263 TraceCheckUtils]: 37: Hoare triple {3869#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3869#false} is VALID [2020-07-17 22:30:25,476 INFO L280 TraceCheckUtils]: 38: Hoare triple {3869#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3869#false} is VALID [2020-07-17 22:30:25,476 INFO L280 TraceCheckUtils]: 39: Hoare triple {3869#false} assume true; {3869#false} is VALID [2020-07-17 22:30:25,476 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3869#false} {3869#false} #57#return; {3869#false} is VALID [2020-07-17 22:30:25,476 INFO L280 TraceCheckUtils]: 41: Hoare triple {3869#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3869#false} is VALID [2020-07-17 22:30:25,476 INFO L280 TraceCheckUtils]: 42: Hoare triple {3869#false} assume 0 == #t~ret8;havoc #t~ret8; {3869#false} is VALID [2020-07-17 22:30:25,477 INFO L280 TraceCheckUtils]: 43: Hoare triple {3869#false} assume !false; {3869#false} is VALID [2020-07-17 22:30:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:25,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:25,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2020-07-17 22:30:25,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553544675] [2020-07-17 22:30:25,479 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2020-07-17 22:30:25,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:25,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-17 22:30:25,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:25,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 22:30:25,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:25,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 22:30:25,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:30:25,547 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 18 states. [2020-07-17 22:30:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:25,967 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-17 22:30:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 22:30:25,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2020-07-17 22:30:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:30:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2020-07-17 22:30:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:30:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2020-07-17 22:30:25,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 62 transitions. [2020-07-17 22:30:26,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:26,062 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:30:26,063 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:30:26,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:30:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:30:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-17 22:30:26,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:26,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-17 22:30:26,096 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-17 22:30:26,097 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-17 22:30:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:26,098 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-17 22:30:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-17 22:30:26,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:26,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:26,099 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-17 22:30:26,099 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-17 22:30:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:26,102 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-07-17 22:30:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-07-17 22:30:26,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:26,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:26,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:26,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:30:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-07-17 22:30:26,105 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2020-07-17 22:30:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:26,106 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-07-17 22:30:26,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 22:30:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-07-17 22:30:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-17 22:30:26,108 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:26,108 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:26,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-17 22:30:26,309 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash -471897817, now seen corresponding path program 14 times [2020-07-17 22:30:26,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:26,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064882951] [2020-07-17 22:30:26,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:26,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {4299#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4276#true} is VALID [2020-07-17 22:30:26,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-17 22:30:26,612 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-17 22:30:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:26,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {4276#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4276#true} is VALID [2020-07-17 22:30:26,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-17 22:30:26,618 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4276#true} {4277#false} #57#return; {4277#false} is VALID [2020-07-17 22:30:26,619 INFO L263 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4299#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:26,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {4299#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4276#true} is VALID [2020-07-17 22:30:26,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-17 22:30:26,619 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-17 22:30:26,619 INFO L263 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret9 := main(); {4276#true} is VALID [2020-07-17 22:30:26,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {4276#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4281#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:26,621 INFO L280 TraceCheckUtils]: 6: Hoare triple {4281#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4281#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:26,621 INFO L280 TraceCheckUtils]: 7: Hoare triple {4281#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4282#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:26,622 INFO L280 TraceCheckUtils]: 8: Hoare triple {4282#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4282#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:26,623 INFO L280 TraceCheckUtils]: 9: Hoare triple {4282#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4283#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:26,623 INFO L280 TraceCheckUtils]: 10: Hoare triple {4283#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4283#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:26,624 INFO L280 TraceCheckUtils]: 11: Hoare triple {4283#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4284#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:26,624 INFO L280 TraceCheckUtils]: 12: Hoare triple {4284#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4284#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:26,625 INFO L280 TraceCheckUtils]: 13: Hoare triple {4284#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4285#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:26,626 INFO L280 TraceCheckUtils]: 14: Hoare triple {4285#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4285#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:26,626 INFO L280 TraceCheckUtils]: 15: Hoare triple {4285#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4286#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:26,627 INFO L280 TraceCheckUtils]: 16: Hoare triple {4286#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4286#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:26,627 INFO L280 TraceCheckUtils]: 17: Hoare triple {4286#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4287#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:26,629 INFO L280 TraceCheckUtils]: 18: Hoare triple {4287#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4287#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:26,630 INFO L280 TraceCheckUtils]: 19: Hoare triple {4287#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4288#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:26,630 INFO L280 TraceCheckUtils]: 20: Hoare triple {4288#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4288#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:26,631 INFO L280 TraceCheckUtils]: 21: Hoare triple {4288#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4289#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:26,632 INFO L280 TraceCheckUtils]: 22: Hoare triple {4289#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4289#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:26,632 INFO L280 TraceCheckUtils]: 23: Hoare triple {4289#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4290#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:26,633 INFO L280 TraceCheckUtils]: 24: Hoare triple {4290#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4290#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:26,634 INFO L280 TraceCheckUtils]: 25: Hoare triple {4290#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4291#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:26,634 INFO L280 TraceCheckUtils]: 26: Hoare triple {4291#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4291#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:26,635 INFO L280 TraceCheckUtils]: 27: Hoare triple {4291#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4292#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:26,636 INFO L280 TraceCheckUtils]: 28: Hoare triple {4292#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4292#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:26,637 INFO L280 TraceCheckUtils]: 29: Hoare triple {4292#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4293#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:26,637 INFO L280 TraceCheckUtils]: 30: Hoare triple {4293#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4293#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:26,638 INFO L280 TraceCheckUtils]: 31: Hoare triple {4293#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4294#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:26,639 INFO L280 TraceCheckUtils]: 32: Hoare triple {4294#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4294#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:26,640 INFO L280 TraceCheckUtils]: 33: Hoare triple {4294#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4295#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:26,641 INFO L280 TraceCheckUtils]: 34: Hoare triple {4295#(<= main_~j~0 14)} assume !(~j~0 < 20); {4277#false} is VALID [2020-07-17 22:30:26,641 INFO L280 TraceCheckUtils]: 35: Hoare triple {4277#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4277#false} is VALID [2020-07-17 22:30:26,641 INFO L280 TraceCheckUtils]: 36: Hoare triple {4277#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4277#false} is VALID [2020-07-17 22:30:26,642 INFO L280 TraceCheckUtils]: 37: Hoare triple {4277#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4277#false} is VALID [2020-07-17 22:30:26,642 INFO L280 TraceCheckUtils]: 38: Hoare triple {4277#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4277#false} is VALID [2020-07-17 22:30:26,642 INFO L263 TraceCheckUtils]: 39: Hoare triple {4277#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4276#true} is VALID [2020-07-17 22:30:26,642 INFO L280 TraceCheckUtils]: 40: Hoare triple {4276#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4276#true} is VALID [2020-07-17 22:30:26,642 INFO L280 TraceCheckUtils]: 41: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-17 22:30:26,643 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {4276#true} {4277#false} #57#return; {4277#false} is VALID [2020-07-17 22:30:26,643 INFO L280 TraceCheckUtils]: 43: Hoare triple {4277#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4277#false} is VALID [2020-07-17 22:30:26,643 INFO L280 TraceCheckUtils]: 44: Hoare triple {4277#false} assume 0 == #t~ret8;havoc #t~ret8; {4277#false} is VALID [2020-07-17 22:30:26,643 INFO L280 TraceCheckUtils]: 45: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2020-07-17 22:30:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:26,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064882951] [2020-07-17 22:30:26,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87835308] [2020-07-17 22:30:26,647 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:26,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:30:26,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:26,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-17 22:30:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:26,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:26,872 INFO L263 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4276#true} is VALID [2020-07-17 22:30:26,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {4276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4276#true} is VALID [2020-07-17 22:30:26,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2020-07-17 22:30:26,873 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #53#return; {4276#true} is VALID [2020-07-17 22:30:26,873 INFO L263 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret9 := main(); {4276#true} is VALID [2020-07-17 22:30:26,874 INFO L280 TraceCheckUtils]: 5: Hoare triple {4276#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4318#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:26,874 INFO L280 TraceCheckUtils]: 6: Hoare triple {4318#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4318#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:26,875 INFO L280 TraceCheckUtils]: 7: Hoare triple {4318#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4282#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:26,876 INFO L280 TraceCheckUtils]: 8: Hoare triple {4282#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4282#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:26,877 INFO L280 TraceCheckUtils]: 9: Hoare triple {4282#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4283#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:26,878 INFO L280 TraceCheckUtils]: 10: Hoare triple {4283#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4283#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:26,878 INFO L280 TraceCheckUtils]: 11: Hoare triple {4283#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4284#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:26,879 INFO L280 TraceCheckUtils]: 12: Hoare triple {4284#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4284#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:26,880 INFO L280 TraceCheckUtils]: 13: Hoare triple {4284#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4285#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:26,880 INFO L280 TraceCheckUtils]: 14: Hoare triple {4285#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4285#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:26,881 INFO L280 TraceCheckUtils]: 15: Hoare triple {4285#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4286#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:26,882 INFO L280 TraceCheckUtils]: 16: Hoare triple {4286#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4286#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:26,883 INFO L280 TraceCheckUtils]: 17: Hoare triple {4286#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4287#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:26,883 INFO L280 TraceCheckUtils]: 18: Hoare triple {4287#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4287#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:26,884 INFO L280 TraceCheckUtils]: 19: Hoare triple {4287#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4288#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:26,885 INFO L280 TraceCheckUtils]: 20: Hoare triple {4288#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4288#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:26,886 INFO L280 TraceCheckUtils]: 21: Hoare triple {4288#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4289#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:26,886 INFO L280 TraceCheckUtils]: 22: Hoare triple {4289#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4289#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:26,887 INFO L280 TraceCheckUtils]: 23: Hoare triple {4289#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4290#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:26,888 INFO L280 TraceCheckUtils]: 24: Hoare triple {4290#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4290#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:26,889 INFO L280 TraceCheckUtils]: 25: Hoare triple {4290#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4291#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:26,890 INFO L280 TraceCheckUtils]: 26: Hoare triple {4291#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4291#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:26,890 INFO L280 TraceCheckUtils]: 27: Hoare triple {4291#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4292#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:26,891 INFO L280 TraceCheckUtils]: 28: Hoare triple {4292#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4292#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:26,892 INFO L280 TraceCheckUtils]: 29: Hoare triple {4292#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4293#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:26,893 INFO L280 TraceCheckUtils]: 30: Hoare triple {4293#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4293#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:26,894 INFO L280 TraceCheckUtils]: 31: Hoare triple {4293#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4294#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:26,894 INFO L280 TraceCheckUtils]: 32: Hoare triple {4294#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4294#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:26,895 INFO L280 TraceCheckUtils]: 33: Hoare triple {4294#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4295#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:26,896 INFO L280 TraceCheckUtils]: 34: Hoare triple {4295#(<= main_~j~0 14)} assume !(~j~0 < 20); {4277#false} is VALID [2020-07-17 22:30:26,896 INFO L280 TraceCheckUtils]: 35: Hoare triple {4277#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4277#false} is VALID [2020-07-17 22:30:26,896 INFO L280 TraceCheckUtils]: 36: Hoare triple {4277#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4277#false} is VALID [2020-07-17 22:30:26,896 INFO L280 TraceCheckUtils]: 37: Hoare triple {4277#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4277#false} is VALID [2020-07-17 22:30:26,896 INFO L280 TraceCheckUtils]: 38: Hoare triple {4277#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4277#false} is VALID [2020-07-17 22:30:26,897 INFO L263 TraceCheckUtils]: 39: Hoare triple {4277#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4277#false} is VALID [2020-07-17 22:30:26,897 INFO L280 TraceCheckUtils]: 40: Hoare triple {4277#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4277#false} is VALID [2020-07-17 22:30:26,897 INFO L280 TraceCheckUtils]: 41: Hoare triple {4277#false} assume true; {4277#false} is VALID [2020-07-17 22:30:26,897 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {4277#false} {4277#false} #57#return; {4277#false} is VALID [2020-07-17 22:30:26,897 INFO L280 TraceCheckUtils]: 43: Hoare triple {4277#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4277#false} is VALID [2020-07-17 22:30:26,898 INFO L280 TraceCheckUtils]: 44: Hoare triple {4277#false} assume 0 == #t~ret8;havoc #t~ret8; {4277#false} is VALID [2020-07-17 22:30:26,898 INFO L280 TraceCheckUtils]: 45: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2020-07-17 22:30:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:26,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:26,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2020-07-17 22:30:26,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228858170] [2020-07-17 22:30:26,902 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2020-07-17 22:30:26,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:26,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:30:26,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:26,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:30:26,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:30:26,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:30:26,970 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 19 states. [2020-07-17 22:30:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:27,284 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2020-07-17 22:30:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 22:30:27,285 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2020-07-17 22:30:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:30:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 64 transitions. [2020-07-17 22:30:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:30:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 64 transitions. [2020-07-17 22:30:27,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 64 transitions. [2020-07-17 22:30:27,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:27,372 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:30:27,372 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:30:27,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:30:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:30:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2020-07-17 22:30:27,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:27,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2020-07-17 22:30:27,399 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2020-07-17 22:30:27,399 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2020-07-17 22:30:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:27,401 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-17 22:30:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-17 22:30:27,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:27,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:27,402 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2020-07-17 22:30:27,402 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2020-07-17 22:30:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:27,404 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-07-17 22:30:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-17 22:30:27,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:27,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:27,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:27,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-17 22:30:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-07-17 22:30:27,407 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2020-07-17 22:30:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:27,408 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-07-17 22:30:27,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:30:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-07-17 22:30:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-17 22:30:27,410 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:27,410 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:27,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:27,621 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:27,621 INFO L82 PathProgramCache]: Analyzing trace with hash -381156151, now seen corresponding path program 15 times [2020-07-17 22:30:27,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:27,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391149367] [2020-07-17 22:30:27,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:27,917 INFO L280 TraceCheckUtils]: 0: Hoare triple {4725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4701#true} is VALID [2020-07-17 22:30:27,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-17 22:30:27,918 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-17 22:30:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:27,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {4701#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4701#true} is VALID [2020-07-17 22:30:27,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-17 22:30:27,923 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4701#true} {4702#false} #57#return; {4702#false} is VALID [2020-07-17 22:30:27,924 INFO L263 TraceCheckUtils]: 0: Hoare triple {4701#true} call ULTIMATE.init(); {4725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:27,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {4725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4701#true} is VALID [2020-07-17 22:30:27,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-17 22:30:27,925 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-17 22:30:27,925 INFO L263 TraceCheckUtils]: 4: Hoare triple {4701#true} call #t~ret9 := main(); {4701#true} is VALID [2020-07-17 22:30:27,926 INFO L280 TraceCheckUtils]: 5: Hoare triple {4701#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4706#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:27,926 INFO L280 TraceCheckUtils]: 6: Hoare triple {4706#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4706#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:27,927 INFO L280 TraceCheckUtils]: 7: Hoare triple {4706#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4707#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:27,928 INFO L280 TraceCheckUtils]: 8: Hoare triple {4707#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4707#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:27,928 INFO L280 TraceCheckUtils]: 9: Hoare triple {4707#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4708#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:27,929 INFO L280 TraceCheckUtils]: 10: Hoare triple {4708#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4708#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:27,930 INFO L280 TraceCheckUtils]: 11: Hoare triple {4708#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4709#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:27,931 INFO L280 TraceCheckUtils]: 12: Hoare triple {4709#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4709#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:27,932 INFO L280 TraceCheckUtils]: 13: Hoare triple {4709#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4710#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:27,932 INFO L280 TraceCheckUtils]: 14: Hoare triple {4710#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4710#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:27,934 INFO L280 TraceCheckUtils]: 15: Hoare triple {4710#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4711#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:27,934 INFO L280 TraceCheckUtils]: 16: Hoare triple {4711#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4711#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:27,935 INFO L280 TraceCheckUtils]: 17: Hoare triple {4711#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4712#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:27,936 INFO L280 TraceCheckUtils]: 18: Hoare triple {4712#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4712#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:27,937 INFO L280 TraceCheckUtils]: 19: Hoare triple {4712#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4713#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:27,938 INFO L280 TraceCheckUtils]: 20: Hoare triple {4713#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4713#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:27,938 INFO L280 TraceCheckUtils]: 21: Hoare triple {4713#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4714#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:27,939 INFO L280 TraceCheckUtils]: 22: Hoare triple {4714#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4714#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:27,940 INFO L280 TraceCheckUtils]: 23: Hoare triple {4714#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4715#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:27,941 INFO L280 TraceCheckUtils]: 24: Hoare triple {4715#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4715#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:27,942 INFO L280 TraceCheckUtils]: 25: Hoare triple {4715#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4716#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:27,943 INFO L280 TraceCheckUtils]: 26: Hoare triple {4716#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4716#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:27,944 INFO L280 TraceCheckUtils]: 27: Hoare triple {4716#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4717#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:27,945 INFO L280 TraceCheckUtils]: 28: Hoare triple {4717#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4717#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:27,967 INFO L280 TraceCheckUtils]: 29: Hoare triple {4717#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4718#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:27,968 INFO L280 TraceCheckUtils]: 30: Hoare triple {4718#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4718#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:27,969 INFO L280 TraceCheckUtils]: 31: Hoare triple {4718#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4719#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:27,970 INFO L280 TraceCheckUtils]: 32: Hoare triple {4719#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4719#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:27,970 INFO L280 TraceCheckUtils]: 33: Hoare triple {4719#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4720#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:27,971 INFO L280 TraceCheckUtils]: 34: Hoare triple {4720#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4720#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:27,972 INFO L280 TraceCheckUtils]: 35: Hoare triple {4720#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4721#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:27,973 INFO L280 TraceCheckUtils]: 36: Hoare triple {4721#(<= main_~j~0 15)} assume !(~j~0 < 20); {4702#false} is VALID [2020-07-17 22:30:27,973 INFO L280 TraceCheckUtils]: 37: Hoare triple {4702#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4702#false} is VALID [2020-07-17 22:30:27,974 INFO L280 TraceCheckUtils]: 38: Hoare triple {4702#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4702#false} is VALID [2020-07-17 22:30:27,974 INFO L280 TraceCheckUtils]: 39: Hoare triple {4702#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4702#false} is VALID [2020-07-17 22:30:27,974 INFO L280 TraceCheckUtils]: 40: Hoare triple {4702#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4702#false} is VALID [2020-07-17 22:30:27,974 INFO L263 TraceCheckUtils]: 41: Hoare triple {4702#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4701#true} is VALID [2020-07-17 22:30:27,975 INFO L280 TraceCheckUtils]: 42: Hoare triple {4701#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4701#true} is VALID [2020-07-17 22:30:27,975 INFO L280 TraceCheckUtils]: 43: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-17 22:30:27,975 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4701#true} {4702#false} #57#return; {4702#false} is VALID [2020-07-17 22:30:27,976 INFO L280 TraceCheckUtils]: 45: Hoare triple {4702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4702#false} is VALID [2020-07-17 22:30:27,976 INFO L280 TraceCheckUtils]: 46: Hoare triple {4702#false} assume 0 == #t~ret8;havoc #t~ret8; {4702#false} is VALID [2020-07-17 22:30:27,976 INFO L280 TraceCheckUtils]: 47: Hoare triple {4702#false} assume !false; {4702#false} is VALID [2020-07-17 22:30:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:27,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391149367] [2020-07-17 22:30:27,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368785033] [2020-07-17 22:30:27,981 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:28,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2020-07-17 22:30:28,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:28,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-17 22:30:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:28,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:29,008 INFO L263 TraceCheckUtils]: 0: Hoare triple {4701#true} call ULTIMATE.init(); {4701#true} is VALID [2020-07-17 22:30:29,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {4701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4701#true} is VALID [2020-07-17 22:30:29,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {4701#true} assume true; {4701#true} is VALID [2020-07-17 22:30:29,009 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4701#true} {4701#true} #53#return; {4701#true} is VALID [2020-07-17 22:30:29,009 INFO L263 TraceCheckUtils]: 4: Hoare triple {4701#true} call #t~ret9 := main(); {4701#true} is VALID [2020-07-17 22:30:29,010 INFO L280 TraceCheckUtils]: 5: Hoare triple {4701#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4744#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:29,011 INFO L280 TraceCheckUtils]: 6: Hoare triple {4744#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4744#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:29,011 INFO L280 TraceCheckUtils]: 7: Hoare triple {4744#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4707#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:29,012 INFO L280 TraceCheckUtils]: 8: Hoare triple {4707#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4707#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:29,012 INFO L280 TraceCheckUtils]: 9: Hoare triple {4707#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4708#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:29,012 INFO L280 TraceCheckUtils]: 10: Hoare triple {4708#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4708#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:29,013 INFO L280 TraceCheckUtils]: 11: Hoare triple {4708#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4709#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:29,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {4709#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4709#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:29,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {4709#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4710#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:29,014 INFO L280 TraceCheckUtils]: 14: Hoare triple {4710#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4710#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:29,015 INFO L280 TraceCheckUtils]: 15: Hoare triple {4710#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4711#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:29,016 INFO L280 TraceCheckUtils]: 16: Hoare triple {4711#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4711#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:29,016 INFO L280 TraceCheckUtils]: 17: Hoare triple {4711#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4712#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:29,017 INFO L280 TraceCheckUtils]: 18: Hoare triple {4712#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4712#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:29,017 INFO L280 TraceCheckUtils]: 19: Hoare triple {4712#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4713#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:29,018 INFO L280 TraceCheckUtils]: 20: Hoare triple {4713#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4713#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:29,018 INFO L280 TraceCheckUtils]: 21: Hoare triple {4713#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4714#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:29,019 INFO L280 TraceCheckUtils]: 22: Hoare triple {4714#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4714#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:29,019 INFO L280 TraceCheckUtils]: 23: Hoare triple {4714#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4715#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:29,019 INFO L280 TraceCheckUtils]: 24: Hoare triple {4715#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4715#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:29,020 INFO L280 TraceCheckUtils]: 25: Hoare triple {4715#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4716#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:29,020 INFO L280 TraceCheckUtils]: 26: Hoare triple {4716#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4716#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:29,021 INFO L280 TraceCheckUtils]: 27: Hoare triple {4716#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4717#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:29,021 INFO L280 TraceCheckUtils]: 28: Hoare triple {4717#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4717#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:29,022 INFO L280 TraceCheckUtils]: 29: Hoare triple {4717#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4718#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:29,022 INFO L280 TraceCheckUtils]: 30: Hoare triple {4718#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4718#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:29,023 INFO L280 TraceCheckUtils]: 31: Hoare triple {4718#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4719#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:29,023 INFO L280 TraceCheckUtils]: 32: Hoare triple {4719#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4719#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:29,023 INFO L280 TraceCheckUtils]: 33: Hoare triple {4719#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4720#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:29,024 INFO L280 TraceCheckUtils]: 34: Hoare triple {4720#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4720#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:29,024 INFO L280 TraceCheckUtils]: 35: Hoare triple {4720#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4721#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:29,025 INFO L280 TraceCheckUtils]: 36: Hoare triple {4721#(<= main_~j~0 15)} assume !(~j~0 < 20); {4702#false} is VALID [2020-07-17 22:30:29,025 INFO L280 TraceCheckUtils]: 37: Hoare triple {4702#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4702#false} is VALID [2020-07-17 22:30:29,025 INFO L280 TraceCheckUtils]: 38: Hoare triple {4702#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4702#false} is VALID [2020-07-17 22:30:29,025 INFO L280 TraceCheckUtils]: 39: Hoare triple {4702#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4702#false} is VALID [2020-07-17 22:30:29,025 INFO L280 TraceCheckUtils]: 40: Hoare triple {4702#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4702#false} is VALID [2020-07-17 22:30:29,026 INFO L263 TraceCheckUtils]: 41: Hoare triple {4702#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4702#false} is VALID [2020-07-17 22:30:29,026 INFO L280 TraceCheckUtils]: 42: Hoare triple {4702#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4702#false} is VALID [2020-07-17 22:30:29,026 INFO L280 TraceCheckUtils]: 43: Hoare triple {4702#false} assume true; {4702#false} is VALID [2020-07-17 22:30:29,026 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4702#false} {4702#false} #57#return; {4702#false} is VALID [2020-07-17 22:30:29,026 INFO L280 TraceCheckUtils]: 45: Hoare triple {4702#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4702#false} is VALID [2020-07-17 22:30:29,026 INFO L280 TraceCheckUtils]: 46: Hoare triple {4702#false} assume 0 == #t~ret8;havoc #t~ret8; {4702#false} is VALID [2020-07-17 22:30:29,026 INFO L280 TraceCheckUtils]: 47: Hoare triple {4702#false} assume !false; {4702#false} is VALID [2020-07-17 22:30:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:29,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:29,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 20 [2020-07-17 22:30:29,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483534223] [2020-07-17 22:30:29,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-17 22:30:29,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:29,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-17 22:30:29,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:29,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 22:30:29,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:29,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 22:30:29,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:30:29,106 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 20 states. [2020-07-17 22:30:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:29,592 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2020-07-17 22:30:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 22:30:29,592 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-17 22:30:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:30:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2020-07-17 22:30:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:30:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2020-07-17 22:30:29,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2020-07-17 22:30:29,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:29,681 INFO L225 Difference]: With dead ends: 64 [2020-07-17 22:30:29,681 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 22:30:29,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:30:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 22:30:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-17 22:30:29,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:29,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-17 22:30:29,711 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-17 22:30:29,711 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-17 22:30:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:29,714 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-17 22:30:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-17 22:30:29,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:29,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:29,715 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-17 22:30:29,715 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-17 22:30:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:29,717 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-07-17 22:30:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-07-17 22:30:29,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:29,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:29,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:29,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-17 22:30:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-07-17 22:30:29,719 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2020-07-17 22:30:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:29,719 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-07-17 22:30:29,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 22:30:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-17 22:30:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 22:30:29,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:29,720 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:29,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-17 22:30:29,935 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:29,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash 922238955, now seen corresponding path program 16 times [2020-07-17 22:30:29,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:29,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025556776] [2020-07-17 22:30:29,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:30,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {5168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5143#true} is VALID [2020-07-17 22:30:30,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-17 22:30:30,289 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-17 22:30:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:30,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {5143#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5143#true} is VALID [2020-07-17 22:30:30,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-17 22:30:30,294 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5144#false} #57#return; {5144#false} is VALID [2020-07-17 22:30:30,295 INFO L263 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:30,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {5168#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5143#true} is VALID [2020-07-17 22:30:30,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-17 22:30:30,295 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-17 22:30:30,296 INFO L263 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret9 := main(); {5143#true} is VALID [2020-07-17 22:30:30,296 INFO L280 TraceCheckUtils]: 5: Hoare triple {5143#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5148#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:30,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {5148#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5148#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:30,298 INFO L280 TraceCheckUtils]: 7: Hoare triple {5148#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5149#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:30,298 INFO L280 TraceCheckUtils]: 8: Hoare triple {5149#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5149#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:30,299 INFO L280 TraceCheckUtils]: 9: Hoare triple {5149#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5150#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:30,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {5150#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5150#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:30,300 INFO L280 TraceCheckUtils]: 11: Hoare triple {5150#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5151#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:30,301 INFO L280 TraceCheckUtils]: 12: Hoare triple {5151#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5151#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:30,302 INFO L280 TraceCheckUtils]: 13: Hoare triple {5151#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5152#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:30,302 INFO L280 TraceCheckUtils]: 14: Hoare triple {5152#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5152#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:30,303 INFO L280 TraceCheckUtils]: 15: Hoare triple {5152#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5153#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:30,303 INFO L280 TraceCheckUtils]: 16: Hoare triple {5153#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5153#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:30,304 INFO L280 TraceCheckUtils]: 17: Hoare triple {5153#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5154#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:30,305 INFO L280 TraceCheckUtils]: 18: Hoare triple {5154#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5154#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:30,305 INFO L280 TraceCheckUtils]: 19: Hoare triple {5154#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5155#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:30,306 INFO L280 TraceCheckUtils]: 20: Hoare triple {5155#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5155#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:30,306 INFO L280 TraceCheckUtils]: 21: Hoare triple {5155#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5156#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:30,307 INFO L280 TraceCheckUtils]: 22: Hoare triple {5156#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5156#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:30,308 INFO L280 TraceCheckUtils]: 23: Hoare triple {5156#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5157#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:30,308 INFO L280 TraceCheckUtils]: 24: Hoare triple {5157#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5157#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:30,309 INFO L280 TraceCheckUtils]: 25: Hoare triple {5157#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5158#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:30,310 INFO L280 TraceCheckUtils]: 26: Hoare triple {5158#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5158#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:30,310 INFO L280 TraceCheckUtils]: 27: Hoare triple {5158#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5159#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:30,311 INFO L280 TraceCheckUtils]: 28: Hoare triple {5159#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5159#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:30,311 INFO L280 TraceCheckUtils]: 29: Hoare triple {5159#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5160#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:30,312 INFO L280 TraceCheckUtils]: 30: Hoare triple {5160#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5160#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:30,313 INFO L280 TraceCheckUtils]: 31: Hoare triple {5160#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5161#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:30,313 INFO L280 TraceCheckUtils]: 32: Hoare triple {5161#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5161#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:30,314 INFO L280 TraceCheckUtils]: 33: Hoare triple {5161#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5162#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:30,314 INFO L280 TraceCheckUtils]: 34: Hoare triple {5162#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5162#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:30,315 INFO L280 TraceCheckUtils]: 35: Hoare triple {5162#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5163#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:30,316 INFO L280 TraceCheckUtils]: 36: Hoare triple {5163#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5163#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:30,316 INFO L280 TraceCheckUtils]: 37: Hoare triple {5163#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5164#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:30,317 INFO L280 TraceCheckUtils]: 38: Hoare triple {5164#(<= main_~j~0 16)} assume !(~j~0 < 20); {5144#false} is VALID [2020-07-17 22:30:30,317 INFO L280 TraceCheckUtils]: 39: Hoare triple {5144#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5144#false} is VALID [2020-07-17 22:30:30,318 INFO L280 TraceCheckUtils]: 40: Hoare triple {5144#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5144#false} is VALID [2020-07-17 22:30:30,318 INFO L280 TraceCheckUtils]: 41: Hoare triple {5144#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5144#false} is VALID [2020-07-17 22:30:30,318 INFO L280 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5144#false} is VALID [2020-07-17 22:30:30,318 INFO L263 TraceCheckUtils]: 43: Hoare triple {5144#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5143#true} is VALID [2020-07-17 22:30:30,318 INFO L280 TraceCheckUtils]: 44: Hoare triple {5143#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5143#true} is VALID [2020-07-17 22:30:30,319 INFO L280 TraceCheckUtils]: 45: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-17 22:30:30,319 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {5143#true} {5144#false} #57#return; {5144#false} is VALID [2020-07-17 22:30:30,319 INFO L280 TraceCheckUtils]: 47: Hoare triple {5144#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5144#false} is VALID [2020-07-17 22:30:30,319 INFO L280 TraceCheckUtils]: 48: Hoare triple {5144#false} assume 0 == #t~ret8;havoc #t~ret8; {5144#false} is VALID [2020-07-17 22:30:30,319 INFO L280 TraceCheckUtils]: 49: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2020-07-17 22:30:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:30,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025556776] [2020-07-17 22:30:30,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113128830] [2020-07-17 22:30:30,324 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:30,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:30:30,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:30,391 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-17 22:30:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:30,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:30,578 INFO L263 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5143#true} is VALID [2020-07-17 22:30:30,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {5143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5143#true} is VALID [2020-07-17 22:30:30,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2020-07-17 22:30:30,579 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #53#return; {5143#true} is VALID [2020-07-17 22:30:30,579 INFO L263 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret9 := main(); {5143#true} is VALID [2020-07-17 22:30:30,583 INFO L280 TraceCheckUtils]: 5: Hoare triple {5143#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5187#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:30,583 INFO L280 TraceCheckUtils]: 6: Hoare triple {5187#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5187#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:30,584 INFO L280 TraceCheckUtils]: 7: Hoare triple {5187#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5149#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:30,585 INFO L280 TraceCheckUtils]: 8: Hoare triple {5149#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5149#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:30,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {5149#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5150#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:30,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {5150#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5150#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:30,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {5150#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5151#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:30,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {5151#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5151#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:30,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {5151#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5152#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:30,590 INFO L280 TraceCheckUtils]: 14: Hoare triple {5152#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5152#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:30,591 INFO L280 TraceCheckUtils]: 15: Hoare triple {5152#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5153#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:30,591 INFO L280 TraceCheckUtils]: 16: Hoare triple {5153#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5153#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:30,592 INFO L280 TraceCheckUtils]: 17: Hoare triple {5153#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5154#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:30,593 INFO L280 TraceCheckUtils]: 18: Hoare triple {5154#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5154#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:30,593 INFO L280 TraceCheckUtils]: 19: Hoare triple {5154#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5155#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:30,594 INFO L280 TraceCheckUtils]: 20: Hoare triple {5155#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5155#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:30,594 INFO L280 TraceCheckUtils]: 21: Hoare triple {5155#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5156#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:30,594 INFO L280 TraceCheckUtils]: 22: Hoare triple {5156#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5156#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:30,595 INFO L280 TraceCheckUtils]: 23: Hoare triple {5156#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5157#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:30,595 INFO L280 TraceCheckUtils]: 24: Hoare triple {5157#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5157#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:30,596 INFO L280 TraceCheckUtils]: 25: Hoare triple {5157#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5158#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:30,596 INFO L280 TraceCheckUtils]: 26: Hoare triple {5158#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5158#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:30,597 INFO L280 TraceCheckUtils]: 27: Hoare triple {5158#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5159#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:30,597 INFO L280 TraceCheckUtils]: 28: Hoare triple {5159#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5159#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:30,598 INFO L280 TraceCheckUtils]: 29: Hoare triple {5159#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5160#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:30,598 INFO L280 TraceCheckUtils]: 30: Hoare triple {5160#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5160#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:30,599 INFO L280 TraceCheckUtils]: 31: Hoare triple {5160#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5161#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:30,599 INFO L280 TraceCheckUtils]: 32: Hoare triple {5161#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5161#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:30,599 INFO L280 TraceCheckUtils]: 33: Hoare triple {5161#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5162#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:30,600 INFO L280 TraceCheckUtils]: 34: Hoare triple {5162#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5162#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:30,600 INFO L280 TraceCheckUtils]: 35: Hoare triple {5162#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5163#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:30,601 INFO L280 TraceCheckUtils]: 36: Hoare triple {5163#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5163#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:30,601 INFO L280 TraceCheckUtils]: 37: Hoare triple {5163#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5164#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:30,602 INFO L280 TraceCheckUtils]: 38: Hoare triple {5164#(<= main_~j~0 16)} assume !(~j~0 < 20); {5144#false} is VALID [2020-07-17 22:30:30,602 INFO L280 TraceCheckUtils]: 39: Hoare triple {5144#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5144#false} is VALID [2020-07-17 22:30:30,602 INFO L280 TraceCheckUtils]: 40: Hoare triple {5144#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5144#false} is VALID [2020-07-17 22:30:30,602 INFO L280 TraceCheckUtils]: 41: Hoare triple {5144#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5144#false} is VALID [2020-07-17 22:30:30,602 INFO L280 TraceCheckUtils]: 42: Hoare triple {5144#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5144#false} is VALID [2020-07-17 22:30:30,602 INFO L263 TraceCheckUtils]: 43: Hoare triple {5144#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5144#false} is VALID [2020-07-17 22:30:30,602 INFO L280 TraceCheckUtils]: 44: Hoare triple {5144#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5144#false} is VALID [2020-07-17 22:30:30,603 INFO L280 TraceCheckUtils]: 45: Hoare triple {5144#false} assume true; {5144#false} is VALID [2020-07-17 22:30:30,603 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {5144#false} {5144#false} #57#return; {5144#false} is VALID [2020-07-17 22:30:30,603 INFO L280 TraceCheckUtils]: 47: Hoare triple {5144#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5144#false} is VALID [2020-07-17 22:30:30,603 INFO L280 TraceCheckUtils]: 48: Hoare triple {5144#false} assume 0 == #t~ret8;havoc #t~ret8; {5144#false} is VALID [2020-07-17 22:30:30,603 INFO L280 TraceCheckUtils]: 49: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2020-07-17 22:30:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:30,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:30,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 21 [2020-07-17 22:30:30,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450337777] [2020-07-17 22:30:30,606 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2020-07-17 22:30:30,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:30,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-17 22:30:30,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:30,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 22:30:30,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:30,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 22:30:30,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:30:30,683 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 21 states. [2020-07-17 22:30:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:31,095 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2020-07-17 22:30:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 22:30:31,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2020-07-17 22:30:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:30:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2020-07-17 22:30:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:30:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2020-07-17 22:30:31,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 68 transitions. [2020-07-17 22:30:31,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:31,189 INFO L225 Difference]: With dead ends: 66 [2020-07-17 22:30:31,189 INFO L226 Difference]: Without dead ends: 54 [2020-07-17 22:30:31,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:30:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-17 22:30:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-07-17 22:30:31,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:31,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2020-07-17 22:30:31,224 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2020-07-17 22:30:31,224 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2020-07-17 22:30:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:31,225 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-17 22:30:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-17 22:30:31,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:31,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:31,226 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2020-07-17 22:30:31,226 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2020-07-17 22:30:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:31,228 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-17 22:30:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-17 22:30:31,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:31,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:31,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:31,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-17 22:30:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-07-17 22:30:31,230 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2020-07-17 22:30:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:31,230 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-07-17 22:30:31,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 22:30:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-07-17 22:30:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 22:30:31,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:31,231 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:31,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-17 22:30:31,443 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash -645514611, now seen corresponding path program 17 times [2020-07-17 22:30:31,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:31,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984559201] [2020-07-17 22:30:31,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:31,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {5628#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5602#true} is VALID [2020-07-17 22:30:31,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-17 22:30:31,748 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-17 22:30:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:31,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {5602#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5602#true} is VALID [2020-07-17 22:30:31,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-17 22:30:31,751 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5602#true} {5603#false} #57#return; {5603#false} is VALID [2020-07-17 22:30:31,752 INFO L263 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5628#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:31,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {5628#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5602#true} is VALID [2020-07-17 22:30:31,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-17 22:30:31,752 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-17 22:30:31,752 INFO L263 TraceCheckUtils]: 4: Hoare triple {5602#true} call #t~ret9 := main(); {5602#true} is VALID [2020-07-17 22:30:31,753 INFO L280 TraceCheckUtils]: 5: Hoare triple {5602#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5607#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:31,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {5607#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5607#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:31,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {5607#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5608#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:31,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {5608#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5608#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:31,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {5608#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5609#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:31,755 INFO L280 TraceCheckUtils]: 10: Hoare triple {5609#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5609#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:31,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {5609#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5610#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:31,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {5610#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5610#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:31,756 INFO L280 TraceCheckUtils]: 13: Hoare triple {5610#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5611#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:31,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {5611#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5611#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:31,757 INFO L280 TraceCheckUtils]: 15: Hoare triple {5611#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5612#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:31,758 INFO L280 TraceCheckUtils]: 16: Hoare triple {5612#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5612#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:31,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {5612#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5613#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:31,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {5613#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5613#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:31,759 INFO L280 TraceCheckUtils]: 19: Hoare triple {5613#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5614#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:31,759 INFO L280 TraceCheckUtils]: 20: Hoare triple {5614#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5614#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:31,760 INFO L280 TraceCheckUtils]: 21: Hoare triple {5614#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5615#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:31,760 INFO L280 TraceCheckUtils]: 22: Hoare triple {5615#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5615#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:31,761 INFO L280 TraceCheckUtils]: 23: Hoare triple {5615#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5616#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:31,761 INFO L280 TraceCheckUtils]: 24: Hoare triple {5616#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5616#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:31,762 INFO L280 TraceCheckUtils]: 25: Hoare triple {5616#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5617#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:31,762 INFO L280 TraceCheckUtils]: 26: Hoare triple {5617#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5617#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:31,762 INFO L280 TraceCheckUtils]: 27: Hoare triple {5617#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5618#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:31,763 INFO L280 TraceCheckUtils]: 28: Hoare triple {5618#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5618#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:31,763 INFO L280 TraceCheckUtils]: 29: Hoare triple {5618#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5619#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:31,764 INFO L280 TraceCheckUtils]: 30: Hoare triple {5619#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5619#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:31,764 INFO L280 TraceCheckUtils]: 31: Hoare triple {5619#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5620#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:31,765 INFO L280 TraceCheckUtils]: 32: Hoare triple {5620#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5620#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:31,765 INFO L280 TraceCheckUtils]: 33: Hoare triple {5620#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5621#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:31,765 INFO L280 TraceCheckUtils]: 34: Hoare triple {5621#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5621#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:31,766 INFO L280 TraceCheckUtils]: 35: Hoare triple {5621#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5622#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:31,767 INFO L280 TraceCheckUtils]: 36: Hoare triple {5622#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5622#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:31,768 INFO L280 TraceCheckUtils]: 37: Hoare triple {5622#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5623#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:31,768 INFO L280 TraceCheckUtils]: 38: Hoare triple {5623#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5623#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:31,769 INFO L280 TraceCheckUtils]: 39: Hoare triple {5623#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5624#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:31,776 INFO L280 TraceCheckUtils]: 40: Hoare triple {5624#(<= main_~j~0 17)} assume !(~j~0 < 20); {5603#false} is VALID [2020-07-17 22:30:31,776 INFO L280 TraceCheckUtils]: 41: Hoare triple {5603#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5603#false} is VALID [2020-07-17 22:30:31,777 INFO L280 TraceCheckUtils]: 42: Hoare triple {5603#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5603#false} is VALID [2020-07-17 22:30:31,777 INFO L280 TraceCheckUtils]: 43: Hoare triple {5603#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5603#false} is VALID [2020-07-17 22:30:31,777 INFO L280 TraceCheckUtils]: 44: Hoare triple {5603#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5603#false} is VALID [2020-07-17 22:30:31,777 INFO L263 TraceCheckUtils]: 45: Hoare triple {5603#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5602#true} is VALID [2020-07-17 22:30:31,777 INFO L280 TraceCheckUtils]: 46: Hoare triple {5602#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5602#true} is VALID [2020-07-17 22:30:31,777 INFO L280 TraceCheckUtils]: 47: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-17 22:30:31,778 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5602#true} {5603#false} #57#return; {5603#false} is VALID [2020-07-17 22:30:31,778 INFO L280 TraceCheckUtils]: 49: Hoare triple {5603#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5603#false} is VALID [2020-07-17 22:30:31,778 INFO L280 TraceCheckUtils]: 50: Hoare triple {5603#false} assume 0 == #t~ret8;havoc #t~ret8; {5603#false} is VALID [2020-07-17 22:30:31,778 INFO L280 TraceCheckUtils]: 51: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2020-07-17 22:30:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:31,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984559201] [2020-07-17 22:30:31,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700221283] [2020-07-17 22:30:31,782 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:33,008 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2020-07-17 22:30:33,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:33,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-17 22:30:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:33,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:33,206 INFO L263 TraceCheckUtils]: 0: Hoare triple {5602#true} call ULTIMATE.init(); {5602#true} is VALID [2020-07-17 22:30:33,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {5602#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5602#true} is VALID [2020-07-17 22:30:33,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {5602#true} assume true; {5602#true} is VALID [2020-07-17 22:30:33,206 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5602#true} {5602#true} #53#return; {5602#true} is VALID [2020-07-17 22:30:33,206 INFO L263 TraceCheckUtils]: 4: Hoare triple {5602#true} call #t~ret9 := main(); {5602#true} is VALID [2020-07-17 22:30:33,207 INFO L280 TraceCheckUtils]: 5: Hoare triple {5602#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5647#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:33,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {5647#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5647#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:33,208 INFO L280 TraceCheckUtils]: 7: Hoare triple {5647#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5608#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:33,209 INFO L280 TraceCheckUtils]: 8: Hoare triple {5608#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5608#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:33,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {5608#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5609#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:33,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {5609#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5609#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:33,211 INFO L280 TraceCheckUtils]: 11: Hoare triple {5609#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5610#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:33,211 INFO L280 TraceCheckUtils]: 12: Hoare triple {5610#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5610#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:33,212 INFO L280 TraceCheckUtils]: 13: Hoare triple {5610#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5611#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:33,213 INFO L280 TraceCheckUtils]: 14: Hoare triple {5611#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5611#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:33,213 INFO L280 TraceCheckUtils]: 15: Hoare triple {5611#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5612#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:33,214 INFO L280 TraceCheckUtils]: 16: Hoare triple {5612#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5612#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:33,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {5612#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5613#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:33,215 INFO L280 TraceCheckUtils]: 18: Hoare triple {5613#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5613#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:33,215 INFO L280 TraceCheckUtils]: 19: Hoare triple {5613#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5614#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:33,216 INFO L280 TraceCheckUtils]: 20: Hoare triple {5614#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5614#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:33,217 INFO L280 TraceCheckUtils]: 21: Hoare triple {5614#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5615#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:33,217 INFO L280 TraceCheckUtils]: 22: Hoare triple {5615#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5615#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:33,218 INFO L280 TraceCheckUtils]: 23: Hoare triple {5615#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5616#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:33,218 INFO L280 TraceCheckUtils]: 24: Hoare triple {5616#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5616#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:33,219 INFO L280 TraceCheckUtils]: 25: Hoare triple {5616#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5617#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:33,219 INFO L280 TraceCheckUtils]: 26: Hoare triple {5617#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5617#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:33,220 INFO L280 TraceCheckUtils]: 27: Hoare triple {5617#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5618#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:33,221 INFO L280 TraceCheckUtils]: 28: Hoare triple {5618#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5618#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:33,221 INFO L280 TraceCheckUtils]: 29: Hoare triple {5618#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5619#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:33,222 INFO L280 TraceCheckUtils]: 30: Hoare triple {5619#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5619#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:33,222 INFO L280 TraceCheckUtils]: 31: Hoare triple {5619#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5620#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:33,223 INFO L280 TraceCheckUtils]: 32: Hoare triple {5620#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5620#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:33,224 INFO L280 TraceCheckUtils]: 33: Hoare triple {5620#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5621#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:33,224 INFO L280 TraceCheckUtils]: 34: Hoare triple {5621#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5621#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:33,225 INFO L280 TraceCheckUtils]: 35: Hoare triple {5621#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5622#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:33,225 INFO L280 TraceCheckUtils]: 36: Hoare triple {5622#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5622#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:33,226 INFO L280 TraceCheckUtils]: 37: Hoare triple {5622#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5623#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:33,227 INFO L280 TraceCheckUtils]: 38: Hoare triple {5623#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5623#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:33,227 INFO L280 TraceCheckUtils]: 39: Hoare triple {5623#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5624#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:33,228 INFO L280 TraceCheckUtils]: 40: Hoare triple {5624#(<= main_~j~0 17)} assume !(~j~0 < 20); {5603#false} is VALID [2020-07-17 22:30:33,228 INFO L280 TraceCheckUtils]: 41: Hoare triple {5603#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5603#false} is VALID [2020-07-17 22:30:33,228 INFO L280 TraceCheckUtils]: 42: Hoare triple {5603#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5603#false} is VALID [2020-07-17 22:30:33,228 INFO L280 TraceCheckUtils]: 43: Hoare triple {5603#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5603#false} is VALID [2020-07-17 22:30:33,229 INFO L280 TraceCheckUtils]: 44: Hoare triple {5603#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5603#false} is VALID [2020-07-17 22:30:33,229 INFO L263 TraceCheckUtils]: 45: Hoare triple {5603#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5603#false} is VALID [2020-07-17 22:30:33,229 INFO L280 TraceCheckUtils]: 46: Hoare triple {5603#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5603#false} is VALID [2020-07-17 22:30:33,229 INFO L280 TraceCheckUtils]: 47: Hoare triple {5603#false} assume true; {5603#false} is VALID [2020-07-17 22:30:33,229 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5603#false} {5603#false} #57#return; {5603#false} is VALID [2020-07-17 22:30:33,229 INFO L280 TraceCheckUtils]: 49: Hoare triple {5603#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5603#false} is VALID [2020-07-17 22:30:33,230 INFO L280 TraceCheckUtils]: 50: Hoare triple {5603#false} assume 0 == #t~ret8;havoc #t~ret8; {5603#false} is VALID [2020-07-17 22:30:33,230 INFO L280 TraceCheckUtils]: 51: Hoare triple {5603#false} assume !false; {5603#false} is VALID [2020-07-17 22:30:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:33,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:33,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 22 [2020-07-17 22:30:33,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637654737] [2020-07-17 22:30:33,237 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2020-07-17 22:30:33,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:33,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-17 22:30:33,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:33,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-17 22:30:33,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:33,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-17 22:30:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2020-07-17 22:30:33,316 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2020-07-17 22:30:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:33,808 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2020-07-17 22:30:33,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-17 22:30:33,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2020-07-17 22:30:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:30:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2020-07-17 22:30:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:30:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2020-07-17 22:30:33,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 70 transitions. [2020-07-17 22:30:33,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:33,912 INFO L225 Difference]: With dead ends: 68 [2020-07-17 22:30:33,912 INFO L226 Difference]: Without dead ends: 56 [2020-07-17 22:30:33,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2020-07-17 22:30:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-17 22:30:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-07-17 22:30:33,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:33,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2020-07-17 22:30:33,946 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2020-07-17 22:30:33,946 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2020-07-17 22:30:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:33,948 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-17 22:30:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-17 22:30:33,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:33,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:33,949 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2020-07-17 22:30:33,949 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2020-07-17 22:30:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:33,951 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-17 22:30:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-17 22:30:33,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:33,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:33,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:33,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:30:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-07-17 22:30:33,953 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2020-07-17 22:30:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:33,953 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-07-17 22:30:33,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-17 22:30:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-07-17 22:30:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 22:30:33,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:33,954 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:34,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:34,167 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash 276829359, now seen corresponding path program 18 times [2020-07-17 22:30:34,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:34,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773334855] [2020-07-17 22:30:34,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:34,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {6105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6078#true} is VALID [2020-07-17 22:30:34,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-17 22:30:34,554 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-17 22:30:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:34,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {6078#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6078#true} is VALID [2020-07-17 22:30:34,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-17 22:30:34,558 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6078#true} {6079#false} #57#return; {6079#false} is VALID [2020-07-17 22:30:34,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {6078#true} call ULTIMATE.init(); {6105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:34,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {6105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6078#true} is VALID [2020-07-17 22:30:34,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-17 22:30:34,560 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-17 22:30:34,560 INFO L263 TraceCheckUtils]: 4: Hoare triple {6078#true} call #t~ret9 := main(); {6078#true} is VALID [2020-07-17 22:30:34,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {6078#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6083#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:34,561 INFO L280 TraceCheckUtils]: 6: Hoare triple {6083#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6083#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:34,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {6083#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6084#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:34,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {6084#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6084#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:34,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {6084#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6085#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:34,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {6085#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6085#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:34,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {6085#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6086#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:34,565 INFO L280 TraceCheckUtils]: 12: Hoare triple {6086#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6086#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:34,566 INFO L280 TraceCheckUtils]: 13: Hoare triple {6086#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6087#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:34,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {6087#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6087#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:34,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {6087#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6088#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:34,568 INFO L280 TraceCheckUtils]: 16: Hoare triple {6088#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6088#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:34,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {6088#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6089#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:34,572 INFO L280 TraceCheckUtils]: 18: Hoare triple {6089#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6089#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:34,573 INFO L280 TraceCheckUtils]: 19: Hoare triple {6089#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6090#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:34,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {6090#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6090#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:34,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {6090#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6091#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:34,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {6091#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6091#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:34,576 INFO L280 TraceCheckUtils]: 23: Hoare triple {6091#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6092#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:34,576 INFO L280 TraceCheckUtils]: 24: Hoare triple {6092#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6092#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:34,577 INFO L280 TraceCheckUtils]: 25: Hoare triple {6092#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6093#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:34,577 INFO L280 TraceCheckUtils]: 26: Hoare triple {6093#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6093#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:34,578 INFO L280 TraceCheckUtils]: 27: Hoare triple {6093#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6094#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:34,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {6094#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6094#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:34,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {6094#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6095#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:34,580 INFO L280 TraceCheckUtils]: 30: Hoare triple {6095#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6095#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:34,581 INFO L280 TraceCheckUtils]: 31: Hoare triple {6095#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6096#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:34,581 INFO L280 TraceCheckUtils]: 32: Hoare triple {6096#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6096#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:34,582 INFO L280 TraceCheckUtils]: 33: Hoare triple {6096#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6097#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:34,582 INFO L280 TraceCheckUtils]: 34: Hoare triple {6097#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6097#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:34,583 INFO L280 TraceCheckUtils]: 35: Hoare triple {6097#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6098#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:34,584 INFO L280 TraceCheckUtils]: 36: Hoare triple {6098#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6098#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:34,584 INFO L280 TraceCheckUtils]: 37: Hoare triple {6098#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6099#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:34,585 INFO L280 TraceCheckUtils]: 38: Hoare triple {6099#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6099#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:34,586 INFO L280 TraceCheckUtils]: 39: Hoare triple {6099#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6100#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:34,586 INFO L280 TraceCheckUtils]: 40: Hoare triple {6100#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6100#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:34,587 INFO L280 TraceCheckUtils]: 41: Hoare triple {6100#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6101#(<= main_~j~0 18)} is VALID [2020-07-17 22:30:34,587 INFO L280 TraceCheckUtils]: 42: Hoare triple {6101#(<= main_~j~0 18)} assume !(~j~0 < 20); {6079#false} is VALID [2020-07-17 22:30:34,588 INFO L280 TraceCheckUtils]: 43: Hoare triple {6079#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6079#false} is VALID [2020-07-17 22:30:34,588 INFO L280 TraceCheckUtils]: 44: Hoare triple {6079#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6079#false} is VALID [2020-07-17 22:30:34,588 INFO L280 TraceCheckUtils]: 45: Hoare triple {6079#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6079#false} is VALID [2020-07-17 22:30:34,588 INFO L280 TraceCheckUtils]: 46: Hoare triple {6079#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6079#false} is VALID [2020-07-17 22:30:34,588 INFO L263 TraceCheckUtils]: 47: Hoare triple {6079#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6078#true} is VALID [2020-07-17 22:30:34,589 INFO L280 TraceCheckUtils]: 48: Hoare triple {6078#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6078#true} is VALID [2020-07-17 22:30:34,589 INFO L280 TraceCheckUtils]: 49: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-17 22:30:34,589 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {6078#true} {6079#false} #57#return; {6079#false} is VALID [2020-07-17 22:30:34,589 INFO L280 TraceCheckUtils]: 51: Hoare triple {6079#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6079#false} is VALID [2020-07-17 22:30:34,589 INFO L280 TraceCheckUtils]: 52: Hoare triple {6079#false} assume 0 == #t~ret8;havoc #t~ret8; {6079#false} is VALID [2020-07-17 22:30:34,590 INFO L280 TraceCheckUtils]: 53: Hoare triple {6079#false} assume !false; {6079#false} is VALID [2020-07-17 22:30:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:34,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773334855] [2020-07-17 22:30:34,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86398260] [2020-07-17 22:30:34,593 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:39,707 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2020-07-17 22:30:39,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:30:39,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-17 22:30:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:39,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:39,925 INFO L263 TraceCheckUtils]: 0: Hoare triple {6078#true} call ULTIMATE.init(); {6078#true} is VALID [2020-07-17 22:30:39,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {6078#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6078#true} is VALID [2020-07-17 22:30:39,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {6078#true} assume true; {6078#true} is VALID [2020-07-17 22:30:39,926 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6078#true} {6078#true} #53#return; {6078#true} is VALID [2020-07-17 22:30:39,926 INFO L263 TraceCheckUtils]: 4: Hoare triple {6078#true} call #t~ret9 := main(); {6078#true} is VALID [2020-07-17 22:30:39,927 INFO L280 TraceCheckUtils]: 5: Hoare triple {6078#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6124#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:39,927 INFO L280 TraceCheckUtils]: 6: Hoare triple {6124#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6124#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:39,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {6124#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6084#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:39,928 INFO L280 TraceCheckUtils]: 8: Hoare triple {6084#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6084#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:39,929 INFO L280 TraceCheckUtils]: 9: Hoare triple {6084#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6085#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:39,929 INFO L280 TraceCheckUtils]: 10: Hoare triple {6085#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6085#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:39,930 INFO L280 TraceCheckUtils]: 11: Hoare triple {6085#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6086#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:39,930 INFO L280 TraceCheckUtils]: 12: Hoare triple {6086#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6086#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:39,931 INFO L280 TraceCheckUtils]: 13: Hoare triple {6086#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6087#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:39,931 INFO L280 TraceCheckUtils]: 14: Hoare triple {6087#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6087#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:39,932 INFO L280 TraceCheckUtils]: 15: Hoare triple {6087#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6088#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:39,933 INFO L280 TraceCheckUtils]: 16: Hoare triple {6088#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6088#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:39,934 INFO L280 TraceCheckUtils]: 17: Hoare triple {6088#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6089#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:39,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {6089#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6089#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:39,935 INFO L280 TraceCheckUtils]: 19: Hoare triple {6089#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6090#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:39,935 INFO L280 TraceCheckUtils]: 20: Hoare triple {6090#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6090#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:39,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {6090#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6091#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:39,937 INFO L280 TraceCheckUtils]: 22: Hoare triple {6091#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6091#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:39,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {6091#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6092#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:39,938 INFO L280 TraceCheckUtils]: 24: Hoare triple {6092#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6092#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:39,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {6092#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6093#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:39,939 INFO L280 TraceCheckUtils]: 26: Hoare triple {6093#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6093#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:39,940 INFO L280 TraceCheckUtils]: 27: Hoare triple {6093#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6094#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:39,941 INFO L280 TraceCheckUtils]: 28: Hoare triple {6094#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6094#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:39,941 INFO L280 TraceCheckUtils]: 29: Hoare triple {6094#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6095#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:39,942 INFO L280 TraceCheckUtils]: 30: Hoare triple {6095#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6095#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:39,942 INFO L280 TraceCheckUtils]: 31: Hoare triple {6095#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6096#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:39,943 INFO L280 TraceCheckUtils]: 32: Hoare triple {6096#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6096#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:39,944 INFO L280 TraceCheckUtils]: 33: Hoare triple {6096#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6097#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:39,944 INFO L280 TraceCheckUtils]: 34: Hoare triple {6097#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6097#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:39,945 INFO L280 TraceCheckUtils]: 35: Hoare triple {6097#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6098#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:39,946 INFO L280 TraceCheckUtils]: 36: Hoare triple {6098#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6098#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:39,947 INFO L280 TraceCheckUtils]: 37: Hoare triple {6098#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6099#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:39,948 INFO L280 TraceCheckUtils]: 38: Hoare triple {6099#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6099#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:39,948 INFO L280 TraceCheckUtils]: 39: Hoare triple {6099#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6100#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:39,949 INFO L280 TraceCheckUtils]: 40: Hoare triple {6100#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6100#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:39,949 INFO L280 TraceCheckUtils]: 41: Hoare triple {6100#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6101#(<= main_~j~0 18)} is VALID [2020-07-17 22:30:39,950 INFO L280 TraceCheckUtils]: 42: Hoare triple {6101#(<= main_~j~0 18)} assume !(~j~0 < 20); {6079#false} is VALID [2020-07-17 22:30:39,950 INFO L280 TraceCheckUtils]: 43: Hoare triple {6079#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6079#false} is VALID [2020-07-17 22:30:39,950 INFO L280 TraceCheckUtils]: 44: Hoare triple {6079#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6079#false} is VALID [2020-07-17 22:30:39,950 INFO L280 TraceCheckUtils]: 45: Hoare triple {6079#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6079#false} is VALID [2020-07-17 22:30:39,951 INFO L280 TraceCheckUtils]: 46: Hoare triple {6079#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6079#false} is VALID [2020-07-17 22:30:39,951 INFO L263 TraceCheckUtils]: 47: Hoare triple {6079#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6079#false} is VALID [2020-07-17 22:30:39,951 INFO L280 TraceCheckUtils]: 48: Hoare triple {6079#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6079#false} is VALID [2020-07-17 22:30:39,951 INFO L280 TraceCheckUtils]: 49: Hoare triple {6079#false} assume true; {6079#false} is VALID [2020-07-17 22:30:39,951 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {6079#false} {6079#false} #57#return; {6079#false} is VALID [2020-07-17 22:30:39,951 INFO L280 TraceCheckUtils]: 51: Hoare triple {6079#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6079#false} is VALID [2020-07-17 22:30:39,952 INFO L280 TraceCheckUtils]: 52: Hoare triple {6079#false} assume 0 == #t~ret8;havoc #t~ret8; {6079#false} is VALID [2020-07-17 22:30:39,952 INFO L280 TraceCheckUtils]: 53: Hoare triple {6079#false} assume !false; {6079#false} is VALID [2020-07-17 22:30:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:39,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:39,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 23 [2020-07-17 22:30:39,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084742521] [2020-07-17 22:30:39,957 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2020-07-17 22:30:39,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:39,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-17 22:30:40,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:40,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-17 22:30:40,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-17 22:30:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2020-07-17 22:30:40,056 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2020-07-17 22:30:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:40,610 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-07-17 22:30:40,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 22:30:40,610 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2020-07-17 22:30:40,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:30:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2020-07-17 22:30:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:30:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2020-07-17 22:30:40,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 72 transitions. [2020-07-17 22:30:40,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:40,703 INFO L225 Difference]: With dead ends: 70 [2020-07-17 22:30:40,703 INFO L226 Difference]: Without dead ends: 58 [2020-07-17 22:30:40,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2020-07-17 22:30:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-17 22:30:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-07-17 22:30:40,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:40,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2020-07-17 22:30:40,730 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2020-07-17 22:30:40,731 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2020-07-17 22:30:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:40,732 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-17 22:30:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-17 22:30:40,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:40,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:40,733 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2020-07-17 22:30:40,733 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2020-07-17 22:30:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:40,736 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-17 22:30:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-17 22:30:40,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:40,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:40,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:40,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-17 22:30:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-07-17 22:30:40,741 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2020-07-17 22:30:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:40,741 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-07-17 22:30:40,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-17 22:30:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-17 22:30:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-17 22:30:40,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:40,742 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:40,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:40,955 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1886121553, now seen corresponding path program 19 times [2020-07-17 22:30:40,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:40,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417148555] [2020-07-17 22:30:40,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:41,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {6599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6571#true} is VALID [2020-07-17 22:30:41,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-17 22:30:41,394 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-17 22:30:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:41,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {6571#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6571#true} is VALID [2020-07-17 22:30:41,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-17 22:30:41,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6571#true} {6572#false} #57#return; {6572#false} is VALID [2020-07-17 22:30:41,400 INFO L263 TraceCheckUtils]: 0: Hoare triple {6571#true} call ULTIMATE.init(); {6599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:30:41,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {6599#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6571#true} is VALID [2020-07-17 22:30:41,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-17 22:30:41,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-17 22:30:41,401 INFO L263 TraceCheckUtils]: 4: Hoare triple {6571#true} call #t~ret9 := main(); {6571#true} is VALID [2020-07-17 22:30:41,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {6571#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6576#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:41,402 INFO L280 TraceCheckUtils]: 6: Hoare triple {6576#(= 0 main_~j~0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6576#(= 0 main_~j~0)} is VALID [2020-07-17 22:30:41,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {6576#(= 0 main_~j~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6577#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:41,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {6577#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6577#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:41,404 INFO L280 TraceCheckUtils]: 9: Hoare triple {6577#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6578#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:41,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {6578#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6578#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:41,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {6578#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6579#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:41,406 INFO L280 TraceCheckUtils]: 12: Hoare triple {6579#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6579#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:41,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {6579#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6580#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:41,407 INFO L280 TraceCheckUtils]: 14: Hoare triple {6580#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6580#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:41,408 INFO L280 TraceCheckUtils]: 15: Hoare triple {6580#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6581#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:41,408 INFO L280 TraceCheckUtils]: 16: Hoare triple {6581#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6581#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:41,409 INFO L280 TraceCheckUtils]: 17: Hoare triple {6581#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6582#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:41,409 INFO L280 TraceCheckUtils]: 18: Hoare triple {6582#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6582#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:41,410 INFO L280 TraceCheckUtils]: 19: Hoare triple {6582#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6583#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:41,410 INFO L280 TraceCheckUtils]: 20: Hoare triple {6583#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6583#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:41,411 INFO L280 TraceCheckUtils]: 21: Hoare triple {6583#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6584#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:41,412 INFO L280 TraceCheckUtils]: 22: Hoare triple {6584#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6584#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:41,412 INFO L280 TraceCheckUtils]: 23: Hoare triple {6584#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6585#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:41,413 INFO L280 TraceCheckUtils]: 24: Hoare triple {6585#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6585#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:41,414 INFO L280 TraceCheckUtils]: 25: Hoare triple {6585#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6586#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:41,414 INFO L280 TraceCheckUtils]: 26: Hoare triple {6586#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6586#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:41,415 INFO L280 TraceCheckUtils]: 27: Hoare triple {6586#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6587#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:41,415 INFO L280 TraceCheckUtils]: 28: Hoare triple {6587#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6587#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:41,416 INFO L280 TraceCheckUtils]: 29: Hoare triple {6587#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6588#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:41,417 INFO L280 TraceCheckUtils]: 30: Hoare triple {6588#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6588#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:41,417 INFO L280 TraceCheckUtils]: 31: Hoare triple {6588#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6589#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:41,418 INFO L280 TraceCheckUtils]: 32: Hoare triple {6589#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6589#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:41,419 INFO L280 TraceCheckUtils]: 33: Hoare triple {6589#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6590#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:41,419 INFO L280 TraceCheckUtils]: 34: Hoare triple {6590#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6590#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:41,420 INFO L280 TraceCheckUtils]: 35: Hoare triple {6590#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6591#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:41,421 INFO L280 TraceCheckUtils]: 36: Hoare triple {6591#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6591#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:41,421 INFO L280 TraceCheckUtils]: 37: Hoare triple {6591#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6592#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:41,422 INFO L280 TraceCheckUtils]: 38: Hoare triple {6592#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6592#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:41,422 INFO L280 TraceCheckUtils]: 39: Hoare triple {6592#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6593#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:41,423 INFO L280 TraceCheckUtils]: 40: Hoare triple {6593#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6593#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:41,424 INFO L280 TraceCheckUtils]: 41: Hoare triple {6593#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= main_~j~0 18)} is VALID [2020-07-17 22:30:41,424 INFO L280 TraceCheckUtils]: 42: Hoare triple {6594#(<= main_~j~0 18)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6594#(<= main_~j~0 18)} is VALID [2020-07-17 22:30:41,425 INFO L280 TraceCheckUtils]: 43: Hoare triple {6594#(<= main_~j~0 18)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6595#(<= main_~j~0 19)} is VALID [2020-07-17 22:30:41,426 INFO L280 TraceCheckUtils]: 44: Hoare triple {6595#(<= main_~j~0 19)} assume !(~j~0 < 20); {6572#false} is VALID [2020-07-17 22:30:41,426 INFO L280 TraceCheckUtils]: 45: Hoare triple {6572#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6572#false} is VALID [2020-07-17 22:30:41,426 INFO L280 TraceCheckUtils]: 46: Hoare triple {6572#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6572#false} is VALID [2020-07-17 22:30:41,426 INFO L280 TraceCheckUtils]: 47: Hoare triple {6572#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6572#false} is VALID [2020-07-17 22:30:41,426 INFO L280 TraceCheckUtils]: 48: Hoare triple {6572#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6572#false} is VALID [2020-07-17 22:30:41,427 INFO L263 TraceCheckUtils]: 49: Hoare triple {6572#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6571#true} is VALID [2020-07-17 22:30:41,427 INFO L280 TraceCheckUtils]: 50: Hoare triple {6571#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6571#true} is VALID [2020-07-17 22:30:41,427 INFO L280 TraceCheckUtils]: 51: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-17 22:30:41,427 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6571#true} {6572#false} #57#return; {6572#false} is VALID [2020-07-17 22:30:41,427 INFO L280 TraceCheckUtils]: 53: Hoare triple {6572#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6572#false} is VALID [2020-07-17 22:30:41,428 INFO L280 TraceCheckUtils]: 54: Hoare triple {6572#false} assume 0 == #t~ret8;havoc #t~ret8; {6572#false} is VALID [2020-07-17 22:30:41,428 INFO L280 TraceCheckUtils]: 55: Hoare triple {6572#false} assume !false; {6572#false} is VALID [2020-07-17 22:30:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:41,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417148555] [2020-07-17 22:30:41,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355097871] [2020-07-17 22:30:41,432 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:41,491 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-17 22:30:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:41,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:30:41,681 INFO L263 TraceCheckUtils]: 0: Hoare triple {6571#true} call ULTIMATE.init(); {6571#true} is VALID [2020-07-17 22:30:41,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {6571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6571#true} is VALID [2020-07-17 22:30:41,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {6571#true} assume true; {6571#true} is VALID [2020-07-17 22:30:41,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6571#true} {6571#true} #53#return; {6571#true} is VALID [2020-07-17 22:30:41,682 INFO L263 TraceCheckUtils]: 4: Hoare triple {6571#true} call #t~ret9 := main(); {6571#true} is VALID [2020-07-17 22:30:41,683 INFO L280 TraceCheckUtils]: 5: Hoare triple {6571#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.allocOnStack(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6618#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:41,683 INFO L280 TraceCheckUtils]: 6: Hoare triple {6618#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6618#(<= main_~j~0 0)} is VALID [2020-07-17 22:30:41,684 INFO L280 TraceCheckUtils]: 7: Hoare triple {6618#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6577#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:41,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {6577#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6577#(<= main_~j~0 1)} is VALID [2020-07-17 22:30:41,685 INFO L280 TraceCheckUtils]: 9: Hoare triple {6577#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6578#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:41,686 INFO L280 TraceCheckUtils]: 10: Hoare triple {6578#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6578#(<= main_~j~0 2)} is VALID [2020-07-17 22:30:41,687 INFO L280 TraceCheckUtils]: 11: Hoare triple {6578#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6579#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:41,687 INFO L280 TraceCheckUtils]: 12: Hoare triple {6579#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6579#(<= main_~j~0 3)} is VALID [2020-07-17 22:30:41,688 INFO L280 TraceCheckUtils]: 13: Hoare triple {6579#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6580#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:41,688 INFO L280 TraceCheckUtils]: 14: Hoare triple {6580#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6580#(<= main_~j~0 4)} is VALID [2020-07-17 22:30:41,689 INFO L280 TraceCheckUtils]: 15: Hoare triple {6580#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6581#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:41,690 INFO L280 TraceCheckUtils]: 16: Hoare triple {6581#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6581#(<= main_~j~0 5)} is VALID [2020-07-17 22:30:41,691 INFO L280 TraceCheckUtils]: 17: Hoare triple {6581#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6582#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:41,691 INFO L280 TraceCheckUtils]: 18: Hoare triple {6582#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6582#(<= main_~j~0 6)} is VALID [2020-07-17 22:30:41,692 INFO L280 TraceCheckUtils]: 19: Hoare triple {6582#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6583#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:41,692 INFO L280 TraceCheckUtils]: 20: Hoare triple {6583#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6583#(<= main_~j~0 7)} is VALID [2020-07-17 22:30:41,693 INFO L280 TraceCheckUtils]: 21: Hoare triple {6583#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6584#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:41,694 INFO L280 TraceCheckUtils]: 22: Hoare triple {6584#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6584#(<= main_~j~0 8)} is VALID [2020-07-17 22:30:41,694 INFO L280 TraceCheckUtils]: 23: Hoare triple {6584#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6585#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:41,695 INFO L280 TraceCheckUtils]: 24: Hoare triple {6585#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6585#(<= main_~j~0 9)} is VALID [2020-07-17 22:30:41,696 INFO L280 TraceCheckUtils]: 25: Hoare triple {6585#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6586#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:41,696 INFO L280 TraceCheckUtils]: 26: Hoare triple {6586#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6586#(<= main_~j~0 10)} is VALID [2020-07-17 22:30:41,697 INFO L280 TraceCheckUtils]: 27: Hoare triple {6586#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6587#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:41,697 INFO L280 TraceCheckUtils]: 28: Hoare triple {6587#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6587#(<= main_~j~0 11)} is VALID [2020-07-17 22:30:41,698 INFO L280 TraceCheckUtils]: 29: Hoare triple {6587#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6588#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:41,699 INFO L280 TraceCheckUtils]: 30: Hoare triple {6588#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6588#(<= main_~j~0 12)} is VALID [2020-07-17 22:30:41,699 INFO L280 TraceCheckUtils]: 31: Hoare triple {6588#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6589#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:41,700 INFO L280 TraceCheckUtils]: 32: Hoare triple {6589#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6589#(<= main_~j~0 13)} is VALID [2020-07-17 22:30:41,701 INFO L280 TraceCheckUtils]: 33: Hoare triple {6589#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6590#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:41,701 INFO L280 TraceCheckUtils]: 34: Hoare triple {6590#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6590#(<= main_~j~0 14)} is VALID [2020-07-17 22:30:41,702 INFO L280 TraceCheckUtils]: 35: Hoare triple {6590#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6591#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:41,702 INFO L280 TraceCheckUtils]: 36: Hoare triple {6591#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6591#(<= main_~j~0 15)} is VALID [2020-07-17 22:30:41,703 INFO L280 TraceCheckUtils]: 37: Hoare triple {6591#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6592#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:41,704 INFO L280 TraceCheckUtils]: 38: Hoare triple {6592#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6592#(<= main_~j~0 16)} is VALID [2020-07-17 22:30:41,704 INFO L280 TraceCheckUtils]: 39: Hoare triple {6592#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6593#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:41,705 INFO L280 TraceCheckUtils]: 40: Hoare triple {6593#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6593#(<= main_~j~0 17)} is VALID [2020-07-17 22:30:41,705 INFO L280 TraceCheckUtils]: 41: Hoare triple {6593#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= main_~j~0 18)} is VALID [2020-07-17 22:30:41,706 INFO L280 TraceCheckUtils]: 42: Hoare triple {6594#(<= main_~j~0 18)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6594#(<= main_~j~0 18)} is VALID [2020-07-17 22:30:41,707 INFO L280 TraceCheckUtils]: 43: Hoare triple {6594#(<= main_~j~0 18)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6595#(<= main_~j~0 19)} is VALID [2020-07-17 22:30:41,707 INFO L280 TraceCheckUtils]: 44: Hoare triple {6595#(<= main_~j~0 19)} assume !(~j~0 < 20); {6572#false} is VALID [2020-07-17 22:30:41,708 INFO L280 TraceCheckUtils]: 45: Hoare triple {6572#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6572#false} is VALID [2020-07-17 22:30:41,708 INFO L280 TraceCheckUtils]: 46: Hoare triple {6572#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6572#false} is VALID [2020-07-17 22:30:41,708 INFO L280 TraceCheckUtils]: 47: Hoare triple {6572#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6572#false} is VALID [2020-07-17 22:30:41,708 INFO L280 TraceCheckUtils]: 48: Hoare triple {6572#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6572#false} is VALID [2020-07-17 22:30:41,708 INFO L263 TraceCheckUtils]: 49: Hoare triple {6572#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6572#false} is VALID [2020-07-17 22:30:41,708 INFO L280 TraceCheckUtils]: 50: Hoare triple {6572#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6572#false} is VALID [2020-07-17 22:30:41,708 INFO L280 TraceCheckUtils]: 51: Hoare triple {6572#false} assume true; {6572#false} is VALID [2020-07-17 22:30:41,709 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6572#false} {6572#false} #57#return; {6572#false} is VALID [2020-07-17 22:30:41,709 INFO L280 TraceCheckUtils]: 53: Hoare triple {6572#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6572#false} is VALID [2020-07-17 22:30:41,709 INFO L280 TraceCheckUtils]: 54: Hoare triple {6572#false} assume 0 == #t~ret8;havoc #t~ret8; {6572#false} is VALID [2020-07-17 22:30:41,709 INFO L280 TraceCheckUtils]: 55: Hoare triple {6572#false} assume !false; {6572#false} is VALID [2020-07-17 22:30:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:41,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:30:41,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 24 [2020-07-17 22:30:41,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605368878] [2020-07-17 22:30:41,713 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2020-07-17 22:30:41,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:41,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-17 22:30:41,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:41,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-17 22:30:41,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:41,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-17 22:30:41,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2020-07-17 22:30:41,811 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 24 states. [2020-07-17 22:30:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:42,086 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2020-07-17 22:30:42,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-17 22:30:42,087 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2020-07-17 22:30:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:30:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2020-07-17 22:30:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:30:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2020-07-17 22:30:42,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 73 transitions. [2020-07-17 22:30:42,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:42,198 INFO L225 Difference]: With dead ends: 71 [2020-07-17 22:30:42,199 INFO L226 Difference]: Without dead ends: 59 [2020-07-17 22:30:42,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2020-07-17 22:30:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-17 22:30:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-17 22:30:42,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:42,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-17 22:30:42,223 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-17 22:30:42,223 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-17 22:30:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:42,225 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-17 22:30:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-17 22:30:42,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:42,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:42,226 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-17 22:30:42,226 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-17 22:30:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:42,229 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-17 22:30:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-17 22:30:42,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:42,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:42,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:42,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-17 22:30:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-07-17 22:30:42,232 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2020-07-17 22:30:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:42,232 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-07-17 22:30:42,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-17 22:30:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-17 22:30:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-17 22:30:42,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:42,233 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:42,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:30:42,441 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:42,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2067273869, now seen corresponding path program 20 times [2020-07-17 22:30:42,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:42,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322097076] [2020-07-17 22:30:42,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:30:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:30:42,748 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:30:42,748 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:30:42,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:30:42,809 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-17 22:30:42,810 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:30:42,811 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:30:42,811 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:30:42,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:30:42 BoogieIcfgContainer [2020-07-17 22:30:42,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:30:42,816 INFO L168 Benchmark]: Toolchain (without parser) took 33348.52 ms. Allocated memory was 137.9 MB in the beginning and 412.1 MB in the end (delta: 274.2 MB). Free memory was 102.6 MB in the beginning and 273.9 MB in the end (delta: -171.2 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:42,816 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:30:42,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.72 ms. Allocated memory is still 137.9 MB. Free memory was 102.2 MB in the beginning and 91.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:42,817 INFO L168 Benchmark]: Boogie Preprocessor took 120.56 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 91.6 MB in the beginning and 178.2 MB in the end (delta: -86.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:42,818 INFO L168 Benchmark]: RCFGBuilder took 489.70 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 156.1 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:42,818 INFO L168 Benchmark]: TraceAbstraction took 32420.47 ms. Allocated memory was 200.8 MB in the beginning and 412.1 MB in the end (delta: 211.3 MB). Free memory was 156.1 MB in the beginning and 273.9 MB in the end (delta: -117.8 MB). Peak memory consumption was 93.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:30:42,820 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 310.72 ms. Allocated memory is still 137.9 MB. Free memory was 102.2 MB in the beginning and 91.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.56 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 91.6 MB in the beginning and 178.2 MB in the end (delta: -86.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 489.70 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 156.1 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32420.47 ms. Allocated memory was 200.8 MB in the beginning and 412.1 MB in the end (delta: 211.3 MB). Free memory was 156.1 MB in the beginning and 273.9 MB in the end (delta: -117.8 MB). Peak memory consumption was 93.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={2:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={2:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={2:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={2:0}, ad2={2:0}, i=10, j=20, pa={2:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={2:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={2:0}, ad2={2:0}, check(ad1, i)=0, i=10, j=20, pa={2:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={2:0}, ad2={2:0}, i=10, j=20, pa={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.2s, OverallIterations: 22, TraceHistogramMax: 20, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 365 SDtfs, 252 SDslu, 2312 SDs, 0 SdLazy, 1465 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1039 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 9.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 131957 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3097 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4940 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...