/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/test25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:06:53,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:06:53,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:06:53,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:06:53,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:06:53,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:06:53,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:06:53,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:06:53,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:06:53,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:06:53,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:06:53,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:06:53,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:06:53,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:06:53,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:06:53,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:06:53,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:06:53,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:06:53,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:06:53,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:06:53,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:06:53,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:06:53,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:06:53,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:06:53,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:06:53,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:06:53,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:06:53,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:06:53,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:06:53,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:06:53,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:06:53,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:06:53,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:06:53,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:06:53,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:06:53,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:06:53,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:06:53,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:06:53,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:06:53,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:06:53,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:06:53,180 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-10 15:06:53,215 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:06:53,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:06:53,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:06:53,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:06:53,222 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:06:53,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:06:53,222 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:06:53,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:06:53,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:06:53,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:06:53,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:06:53,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:06:53,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:06:53,223 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:06:53,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:06:53,224 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:06:53,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:06:53,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:06:53,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:06:53,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:06:53,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:06:53,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:06:53,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:06:53,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:06:53,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:06:53,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:06:53,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:06:53,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:06:53,226 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:06:53,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:06:53,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:06:53,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:06:53,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:06:53,555 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:06:53,556 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:06:53,557 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-2.c [2020-07-10 15:06:53,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1a2eb66/dbcec4384d004be7b6d48b8917a576e9/FLAGfe979d26f [2020-07-10 15:06:54,071 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:06:54,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-2.c [2020-07-10 15:06:54,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1a2eb66/dbcec4384d004be7b6d48b8917a576e9/FLAGfe979d26f [2020-07-10 15:06:54,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1a2eb66/dbcec4384d004be7b6d48b8917a576e9 [2020-07-10 15:06:54,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:06:54,455 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:06:54,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:54,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:06:54,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:06:54,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c43237f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54, skipping insertion in model container [2020-07-10 15:06:54,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:06:54,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:06:54,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:54,680 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:06:54,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:54,723 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:06:54,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54 WrapperNode [2020-07-10 15:06:54,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:54,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:06:54,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:06:54,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:06:54,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (1/1) ... [2020-07-10 15:06:54,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:06:54,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:06:54,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:06:54,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:06:54,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (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-10 15:06:54,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:06:54,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:06:54,942 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-10 15:06:54,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:06:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:06:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:06:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-10 15:06:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:06:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:06:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:06:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:06:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:06:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:06:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:06:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:06:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:06:55,375 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:06:55,375 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:06:55,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:55 BoogieIcfgContainer [2020-07-10 15:06:55,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:06:55,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:06:55,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:06:55,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:06:55,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:06:54" (1/3) ... [2020-07-10 15:06:55,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9169cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:55, skipping insertion in model container [2020-07-10 15:06:55,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:54" (2/3) ... [2020-07-10 15:06:55,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9169cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:55, skipping insertion in model container [2020-07-10 15:06:55,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:55" (3/3) ... [2020-07-10 15:06:55,393 INFO L109 eAbstractionObserver]: Analyzing ICFG test25-2.c [2020-07-10 15:06:55,404 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:06:55,412 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:06:55,426 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:06:55,462 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:06:55,462 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:06:55,462 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:06:55,463 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:06:55,463 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:06:55,463 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:06:55,463 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:06:55,463 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:06:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-10 15:06:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:06:55,483 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:55,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:55,484 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2020-07-10 15:06:55,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:55,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384797142] [2020-07-10 15:06:55,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,719 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-10 15:06:55,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:55,720 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #58#return; {28#true} is VALID [2020-07-10 15:06:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:55,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {28#true} is VALID [2020-07-10 15:06:55,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:55,760 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {29#false} #62#return; {29#false} is VALID [2020-07-10 15:06:55,762 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-10 15:06:55,763 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-10 15:06:55,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:55,764 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #58#return; {28#true} is VALID [2020-07-10 15:06:55,766 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret13 := main(); {28#true} is VALID [2020-07-10 15:06:55,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {28#true} is VALID [2020-07-10 15:06:55,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2020-07-10 15:06:55,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {29#false} is VALID [2020-07-10 15:06:55,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {29#false} is VALID [2020-07-10 15:06:55,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2020-07-10 15:06:55,770 INFO L263 TraceCheckUtils]: 10: Hoare triple {29#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {28#true} is VALID [2020-07-10 15:06:55,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {28#true} is VALID [2020-07-10 15:06:55,771 INFO L280 TraceCheckUtils]: 12: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:55,771 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {28#true} {29#false} #62#return; {29#false} is VALID [2020-07-10 15:06:55,772 INFO L280 TraceCheckUtils]: 14: Hoare triple {29#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {29#false} is VALID [2020-07-10 15:06:55,772 INFO L280 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == #t~ret12;havoc #t~ret12; {29#false} is VALID [2020-07-10 15:06:55,773 INFO L280 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-10 15:06:55,777 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-10 15:06:55,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384797142] [2020-07-10 15:06:55,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:55,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:06:55,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047170484] [2020-07-10 15:06:55,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:06:55,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:55,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:06:55,863 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-10 15:06:55,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:06:55,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:55,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:06:55,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:06:55,876 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-10 15:06:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,040 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-10 15:06:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:06:56,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:06:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:06:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2020-07-10 15:06:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:06:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2020-07-10 15:06:56,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2020-07-10 15:06:56,149 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-10 15:06:56,160 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:06:56,161 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 15:06:56,165 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-10 15:06:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 15:06:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-10 15:06:56,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:56,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:56,225 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:56,225 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,229 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-10 15:06:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:06:56,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:56,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:56,230 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:56,231 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 15:06:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,234 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-10 15:06:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:06:56,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:56,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:56,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:56,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:06:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-10 15:06:56,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2020-07-10 15:06:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:56,240 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-10 15:06:56,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:06:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:06:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:06:56,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:56,242 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-10 15:06:56,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:06:56,242 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2020-07-10 15:06:56,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:56,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112485574] [2020-07-10 15:06:56,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,357 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-10 15:06:56,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-10 15:06:56,358 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #58#return; {163#true} is VALID [2020-07-10 15:06:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,374 INFO L280 TraceCheckUtils]: 0: Hoare triple {163#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {163#true} is VALID [2020-07-10 15:06:56,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-10 15:06:56,375 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {163#true} {164#false} #62#return; {164#false} is VALID [2020-07-10 15:06:56,376 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-10 15:06:56,377 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-10 15:06:56,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-10 15:06:56,377 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #58#return; {163#true} is VALID [2020-07-10 15:06:56,378 INFO L263 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret13 := main(); {163#true} is VALID [2020-07-10 15:06:56,380 INFO L280 TraceCheckUtils]: 5: Hoare triple {163#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {168#(= 0 main_~j~0)} is VALID [2020-07-10 15:06:56,381 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#(= 0 main_~j~0)} assume !(~j~0 < 10); {164#false} is VALID [2020-07-10 15:06:56,381 INFO L280 TraceCheckUtils]: 7: Hoare triple {164#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {164#false} is VALID [2020-07-10 15:06:56,382 INFO L280 TraceCheckUtils]: 8: Hoare triple {164#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {164#false} is VALID [2020-07-10 15:06:56,382 INFO L280 TraceCheckUtils]: 9: Hoare triple {164#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {164#false} is VALID [2020-07-10 15:06:56,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {164#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {164#false} is VALID [2020-07-10 15:06:56,383 INFO L263 TraceCheckUtils]: 11: Hoare triple {164#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {163#true} is VALID [2020-07-10 15:06:56,383 INFO L280 TraceCheckUtils]: 12: Hoare triple {163#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {163#true} is VALID [2020-07-10 15:06:56,383 INFO L280 TraceCheckUtils]: 13: Hoare triple {163#true} assume true; {163#true} is VALID [2020-07-10 15:06:56,383 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {163#true} {164#false} #62#return; {164#false} is VALID [2020-07-10 15:06:56,384 INFO L280 TraceCheckUtils]: 15: Hoare triple {164#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {164#false} is VALID [2020-07-10 15:06:56,384 INFO L280 TraceCheckUtils]: 16: Hoare triple {164#false} assume 0 == #t~ret12;havoc #t~ret12; {164#false} is VALID [2020-07-10 15:06:56,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {164#false} assume !false; {164#false} is VALID [2020-07-10 15:06:56,385 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-10 15:06:56,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112485574] [2020-07-10 15:06:56,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:56,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:06:56,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024645234] [2020-07-10 15:06:56,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-10 15:06:56,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:56,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:06:56,421 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-10 15:06:56,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:06:56,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:06:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:06:56,422 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2020-07-10 15:06:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,559 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-10 15:06:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:06:56,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-10 15:06:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:06:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-10 15:06:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:06:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-10 15:06:56,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2020-07-10 15:06:56,618 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-10 15:06:56,619 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:06:56,620 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:06:56,621 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-10 15:06:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:06:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-10 15:06:56,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:56,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-10 15:06:56,635 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-10 15:06:56,635 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-10 15:06:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,637 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:06:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:06:56,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:56,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:56,638 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-10 15:06:56,639 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-10 15:06:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:56,641 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:06:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:06:56,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:56,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:56,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:56,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:06:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-10 15:06:56,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2020-07-10 15:06:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:56,644 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-10 15:06:56,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:06:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 15:06:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:06:56,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:56,646 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-10 15:06:56,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:06:56,646 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:56,647 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2020-07-10 15:06:56,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:56,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770428206] [2020-07-10 15:06:56,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,773 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-10 15:06:56,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:56,773 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {298#true} {298#true} #58#return; {298#true} is VALID [2020-07-10 15:06:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {298#true} is VALID [2020-07-10 15:06:56,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:56,791 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {298#true} {299#false} #62#return; {299#false} is VALID [2020-07-10 15:06:56,792 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-10 15:06:56,792 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-10 15:06:56,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:56,793 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {298#true} #58#return; {298#true} is VALID [2020-07-10 15:06:56,793 INFO L263 TraceCheckUtils]: 4: Hoare triple {298#true} call #t~ret13 := main(); {298#true} is VALID [2020-07-10 15:06:56,795 INFO L280 TraceCheckUtils]: 5: Hoare triple {298#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {303#(= 0 main_~j~0)} is VALID [2020-07-10 15:06:56,795 INFO L280 TraceCheckUtils]: 6: Hoare triple {303#(= 0 main_~j~0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {303#(= 0 main_~j~0)} is VALID [2020-07-10 15:06:56,796 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(= 0 main_~j~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {304#(<= main_~j~0 1)} is VALID [2020-07-10 15:06:56,797 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~j~0 1)} assume !(~j~0 < 10); {299#false} is VALID [2020-07-10 15:06:56,797 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {299#false} is VALID [2020-07-10 15:06:56,798 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {299#false} is VALID [2020-07-10 15:06:56,798 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {299#false} is VALID [2020-07-10 15:06:56,800 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {299#false} is VALID [2020-07-10 15:06:56,801 INFO L263 TraceCheckUtils]: 13: Hoare triple {299#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {298#true} is VALID [2020-07-10 15:06:56,801 INFO L280 TraceCheckUtils]: 14: Hoare triple {298#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {298#true} is VALID [2020-07-10 15:06:56,801 INFO L280 TraceCheckUtils]: 15: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:56,802 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {298#true} {299#false} #62#return; {299#false} is VALID [2020-07-10 15:06:56,802 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {299#false} is VALID [2020-07-10 15:06:56,802 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume 0 == #t~ret12;havoc #t~ret12; {299#false} is VALID [2020-07-10 15:06:56,802 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-10 15:06:56,803 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-10 15:06:56,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770428206] [2020-07-10 15:06:56,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467003084] [2020-07-10 15:06:56,805 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-10 15:06:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,869 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:06:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:56,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:06:56,949 INFO L263 TraceCheckUtils]: 0: Hoare triple {298#true} call ULTIMATE.init(); {298#true} is VALID [2020-07-10 15:06:56,950 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-10 15:06:56,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-10 15:06:56,950 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {298#true} #58#return; {298#true} is VALID [2020-07-10 15:06:56,951 INFO L263 TraceCheckUtils]: 4: Hoare triple {298#true} call #t~ret13 := main(); {298#true} is VALID [2020-07-10 15:06:56,952 INFO L280 TraceCheckUtils]: 5: Hoare triple {298#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {327#(<= main_~j~0 0)} is VALID [2020-07-10 15:06:56,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {327#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {327#(<= main_~j~0 0)} is VALID [2020-07-10 15:06:56,954 INFO L280 TraceCheckUtils]: 7: Hoare triple {327#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {304#(<= main_~j~0 1)} is VALID [2020-07-10 15:06:56,954 INFO L280 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~j~0 1)} assume !(~j~0 < 10); {299#false} is VALID [2020-07-10 15:06:56,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {299#false} is VALID [2020-07-10 15:06:56,955 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {299#false} is VALID [2020-07-10 15:06:56,955 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {299#false} is VALID [2020-07-10 15:06:56,956 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {299#false} is VALID [2020-07-10 15:06:56,956 INFO L263 TraceCheckUtils]: 13: Hoare triple {299#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {299#false} is VALID [2020-07-10 15:06:56,956 INFO L280 TraceCheckUtils]: 14: Hoare triple {299#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {299#false} is VALID [2020-07-10 15:06:56,956 INFO L280 TraceCheckUtils]: 15: Hoare triple {299#false} assume true; {299#false} is VALID [2020-07-10 15:06:56,957 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {299#false} {299#false} #62#return; {299#false} is VALID [2020-07-10 15:06:56,957 INFO L280 TraceCheckUtils]: 17: Hoare triple {299#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {299#false} is VALID [2020-07-10 15:06:56,957 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume 0 == #t~ret12;havoc #t~ret12; {299#false} is VALID [2020-07-10 15:06:56,958 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-10 15:06:56,959 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-10 15:06:56,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:06:56,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-10 15:06:56,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410537758] [2020-07-10 15:06:56,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:06:56,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:56,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:06:57,002 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-10 15:06:57,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:06:57,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:06:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:06:57,004 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2020-07-10 15:06:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,148 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-10 15:06:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:06:57,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:06:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:06:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-10 15:06:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:06:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-10 15:06:57,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-10 15:06:57,220 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-10 15:06:57,221 INFO L225 Difference]: With dead ends: 36 [2020-07-10 15:06:57,221 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 15:06:57,222 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-10 15:06:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 15:06:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-10 15:06:57,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:57,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-10 15:06:57,235 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-10 15:06:57,235 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-10 15:06:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,237 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 15:06:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 15:06:57,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:57,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:57,238 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-10 15:06:57,239 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-10 15:06:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:57,241 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 15:06:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 15:06:57,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:57,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:57,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:57,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:06:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-10 15:06:57,243 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2020-07-10 15:06:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:57,244 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-10 15:06:57,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:06:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-10 15:06:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:06:57,245 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:57,245 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-10 15:06:57,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:06:57,459 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:57,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:57,460 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2020-07-10 15:06:57,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:57,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191140322] [2020-07-10 15:06:57,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:57,556 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-10 15:06:57,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:57,557 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {502#true} {502#true} #58#return; {502#true} is VALID [2020-07-10 15:06:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:57,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {502#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {502#true} is VALID [2020-07-10 15:06:57,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:57,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {502#true} {503#false} #62#return; {503#false} is VALID [2020-07-10 15:06:57,566 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-10 15:06:57,566 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-10 15:06:57,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:57,567 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #58#return; {502#true} is VALID [2020-07-10 15:06:57,567 INFO L263 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret13 := main(); {502#true} is VALID [2020-07-10 15:06:57,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {507#(= 0 main_~j~0)} is VALID [2020-07-10 15:06:57,569 INFO L280 TraceCheckUtils]: 6: Hoare triple {507#(= 0 main_~j~0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {507#(= 0 main_~j~0)} is VALID [2020-07-10 15:06:57,570 INFO L280 TraceCheckUtils]: 7: Hoare triple {507#(= 0 main_~j~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {508#(<= main_~j~0 1)} is VALID [2020-07-10 15:06:57,570 INFO L280 TraceCheckUtils]: 8: Hoare triple {508#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {508#(<= main_~j~0 1)} is VALID [2020-07-10 15:06:57,571 INFO L280 TraceCheckUtils]: 9: Hoare triple {508#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {509#(<= main_~j~0 2)} is VALID [2020-07-10 15:06:57,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#(<= main_~j~0 2)} assume !(~j~0 < 10); {503#false} is VALID [2020-07-10 15:06:57,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {503#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {503#false} is VALID [2020-07-10 15:06:57,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {503#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {503#false} is VALID [2020-07-10 15:06:57,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {503#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {503#false} is VALID [2020-07-10 15:06:57,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {503#false} is VALID [2020-07-10 15:06:57,573 INFO L263 TraceCheckUtils]: 15: Hoare triple {503#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {502#true} is VALID [2020-07-10 15:06:57,574 INFO L280 TraceCheckUtils]: 16: Hoare triple {502#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {502#true} is VALID [2020-07-10 15:06:57,574 INFO L280 TraceCheckUtils]: 17: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:57,574 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {502#true} {503#false} #62#return; {503#false} is VALID [2020-07-10 15:06:57,574 INFO L280 TraceCheckUtils]: 19: Hoare triple {503#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {503#false} is VALID [2020-07-10 15:06:57,575 INFO L280 TraceCheckUtils]: 20: Hoare triple {503#false} assume 0 == #t~ret12;havoc #t~ret12; {503#false} is VALID [2020-07-10 15:06:57,575 INFO L280 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2020-07-10 15:06:57,576 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-10 15:06:57,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191140322] [2020-07-10 15:06:57,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444360333] [2020-07-10 15:06:57,577 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-10 15:06:57,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:06:57,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:06:57,632 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-10 15:06:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:57,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:06:57,812 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:06:57,819 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:06:57,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2020-07-10 15:06:57,827 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:06:57,833 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:06:57,836 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:06:57,836 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2020-07-10 15:06:57,841 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:06:57,842 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset, |main_~#array~0.offset|]. (let ((.cse0 (select |#memory_int| main_~pa~0.base))) (and (= 0 (mod (+ main_~pa~0.offset (* |main_~#array~0.offset| 7) 4) 8)) (<= (select .cse0 main_~pa~0.offset) |main_#t~mem10|) (<= (+ main_~i~0 10) (select .cse0 (+ (* (div (+ main_~pa~0.offset (- |main_~#array~0.offset|) (- 4)) 8) 8) |main_~#array~0.offset| 4))))) [2020-07-10 15:06:57,842 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 10) |main_#t~mem10|) [2020-07-10 15:06:57,870 INFO L263 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2020-07-10 15:06:57,870 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-10 15:06:57,871 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2020-07-10 15:06:57,871 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #58#return; {502#true} is VALID [2020-07-10 15:06:57,871 INFO L263 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret13 := main(); {502#true} is VALID [2020-07-10 15:06:57,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {502#true} is VALID [2020-07-10 15:06:57,872 INFO L280 TraceCheckUtils]: 6: Hoare triple {502#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {502#true} is VALID [2020-07-10 15:06:57,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {502#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {502#true} is VALID [2020-07-10 15:06:57,872 INFO L280 TraceCheckUtils]: 8: Hoare triple {502#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {502#true} is VALID [2020-07-10 15:06:57,872 INFO L280 TraceCheckUtils]: 9: Hoare triple {502#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {502#true} is VALID [2020-07-10 15:06:57,873 INFO L280 TraceCheckUtils]: 10: Hoare triple {502#true} assume !(~j~0 < 10); {502#true} is VALID [2020-07-10 15:06:57,875 INFO L280 TraceCheckUtils]: 11: Hoare triple {502#true} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {550#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2020-07-10 15:06:59,900 INFO L280 TraceCheckUtils]: 12: Hoare triple {550#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {554#(exists ((|main_~#array~0.offset| Int)) (and (= 0 (mod (+ main_~pa~0.offset (* |main_~#array~0.offset| 7) 4) 8)) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) (+ (* (div (+ main_~pa~0.offset (- |main_~#array~0.offset|) (- 4)) 8) 8) |main_~#array~0.offset| 4)))))} is UNKNOWN [2020-07-10 15:06:59,903 INFO L280 TraceCheckUtils]: 13: Hoare triple {554#(exists ((|main_~#array~0.offset| Int)) (and (= 0 (mod (+ main_~pa~0.offset (* |main_~#array~0.offset| 7) 4) 8)) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) (+ (* (div (+ main_~pa~0.offset (- |main_~#array~0.offset|) (- 4)) 8) 8) |main_~#array~0.offset| 4)))))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {558#(<= (+ main_~i~0 10) |main_#t~mem10|)} is VALID [2020-07-10 15:06:59,909 INFO L280 TraceCheckUtils]: 14: Hoare triple {558#(<= (+ main_~i~0 10) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {503#false} is VALID [2020-07-10 15:06:59,910 INFO L263 TraceCheckUtils]: 15: Hoare triple {503#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {503#false} is VALID [2020-07-10 15:06:59,910 INFO L280 TraceCheckUtils]: 16: Hoare triple {503#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {503#false} is VALID [2020-07-10 15:06:59,910 INFO L280 TraceCheckUtils]: 17: Hoare triple {503#false} assume true; {503#false} is VALID [2020-07-10 15:06:59,910 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {503#false} {503#false} #62#return; {503#false} is VALID [2020-07-10 15:06:59,911 INFO L280 TraceCheckUtils]: 19: Hoare triple {503#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {503#false} is VALID [2020-07-10 15:06:59,911 INFO L280 TraceCheckUtils]: 20: Hoare triple {503#false} assume 0 == #t~ret12;havoc #t~ret12; {503#false} is VALID [2020-07-10 15:06:59,911 INFO L280 TraceCheckUtils]: 21: Hoare triple {503#false} assume !false; {503#false} is VALID [2020-07-10 15:06:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:06:59,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:06:59,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2020-07-10 15:06:59,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530202233] [2020-07-10 15:06:59,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-10 15:06:59,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:59,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:06:59,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:59,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:06:59,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:06:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:06:59,955 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2020-07-10 15:07:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:00,179 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-10 15:07:00,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:07:00,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-10 15:07:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:07:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-10 15:07:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:07:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-10 15:07:00,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2020-07-10 15:07:01,663 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-10 15:07:01,664 INFO L225 Difference]: With dead ends: 33 [2020-07-10 15:07:01,664 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:07:01,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:07:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:07:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 15:07:01,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:01,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 15:07:01,692 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:07:01,692 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:07:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:01,694 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 15:07:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 15:07:01,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:01,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:01,700 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:07:01,701 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:07:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:01,703 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-10 15:07:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 15:07:01,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:01,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:01,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:01,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:07:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-10 15:07:01,706 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2020-07-10 15:07:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:01,706 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-10 15:07:01,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:07:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 15:07:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:07:01,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:01,707 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:07:01,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:01,923 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -413303094, now seen corresponding path program 1 times [2020-07-10 15:07:01,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:01,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223521231] [2020-07-10 15:07:01,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {730#(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; {719#true} is VALID [2020-07-10 15:07:02,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {719#true} assume true; {719#true} is VALID [2020-07-10 15:07:02,044 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {719#true} {719#true} #58#return; {719#true} is VALID [2020-07-10 15:07:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,053 INFO L280 TraceCheckUtils]: 0: Hoare triple {719#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {719#true} is VALID [2020-07-10 15:07:02,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {719#true} assume true; {719#true} is VALID [2020-07-10 15:07:02,054 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {719#true} {720#false} #62#return; {720#false} is VALID [2020-07-10 15:07:02,055 INFO L263 TraceCheckUtils]: 0: Hoare triple {719#true} call ULTIMATE.init(); {730#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:07:02,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {730#(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; {719#true} is VALID [2020-07-10 15:07:02,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {719#true} assume true; {719#true} is VALID [2020-07-10 15:07:02,055 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {719#true} {719#true} #58#return; {719#true} is VALID [2020-07-10 15:07:02,056 INFO L263 TraceCheckUtils]: 4: Hoare triple {719#true} call #t~ret13 := main(); {719#true} is VALID [2020-07-10 15:07:02,057 INFO L280 TraceCheckUtils]: 5: Hoare triple {719#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {724#(= 0 main_~j~0)} is VALID [2020-07-10 15:07:02,057 INFO L280 TraceCheckUtils]: 6: Hoare triple {724#(= 0 main_~j~0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {724#(= 0 main_~j~0)} is VALID [2020-07-10 15:07:02,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {724#(= 0 main_~j~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {725#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:02,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {725#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {725#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:02,059 INFO L280 TraceCheckUtils]: 9: Hoare triple {725#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {726#(<= main_~j~0 2)} is VALID [2020-07-10 15:07:02,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {726#(<= main_~j~0 2)} assume !(~j~0 < 10); {720#false} is VALID [2020-07-10 15:07:02,060 INFO L280 TraceCheckUtils]: 11: Hoare triple {720#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {720#false} is VALID [2020-07-10 15:07:02,060 INFO L280 TraceCheckUtils]: 12: Hoare triple {720#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {720#false} is VALID [2020-07-10 15:07:02,061 INFO L280 TraceCheckUtils]: 13: Hoare triple {720#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {720#false} is VALID [2020-07-10 15:07:02,061 INFO L280 TraceCheckUtils]: 14: Hoare triple {720#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {720#false} is VALID [2020-07-10 15:07:02,061 INFO L280 TraceCheckUtils]: 15: Hoare triple {720#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {720#false} is VALID [2020-07-10 15:07:02,061 INFO L280 TraceCheckUtils]: 16: Hoare triple {720#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {720#false} is VALID [2020-07-10 15:07:02,061 INFO L263 TraceCheckUtils]: 17: Hoare triple {720#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {719#true} is VALID [2020-07-10 15:07:02,062 INFO L280 TraceCheckUtils]: 18: Hoare triple {719#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {719#true} is VALID [2020-07-10 15:07:02,062 INFO L280 TraceCheckUtils]: 19: Hoare triple {719#true} assume true; {719#true} is VALID [2020-07-10 15:07:02,062 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {719#true} {720#false} #62#return; {720#false} is VALID [2020-07-10 15:07:02,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {720#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {720#false} is VALID [2020-07-10 15:07:02,063 INFO L280 TraceCheckUtils]: 22: Hoare triple {720#false} assume 0 == #t~ret12;havoc #t~ret12; {720#false} is VALID [2020-07-10 15:07:02,063 INFO L280 TraceCheckUtils]: 23: Hoare triple {720#false} assume !false; {720#false} is VALID [2020-07-10 15:07:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:07:02,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223521231] [2020-07-10 15:07:02,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905283450] [2020-07-10 15:07:02,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10 15:07:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:07:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:02,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {719#true} call ULTIMATE.init(); {719#true} is VALID [2020-07-10 15:07:02,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {719#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {719#true} is VALID [2020-07-10 15:07:02,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {719#true} assume true; {719#true} is VALID [2020-07-10 15:07:02,179 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {719#true} {719#true} #58#return; {719#true} is VALID [2020-07-10 15:07:02,179 INFO L263 TraceCheckUtils]: 4: Hoare triple {719#true} call #t~ret13 := main(); {719#true} is VALID [2020-07-10 15:07:02,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {719#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {749#(<= main_~j~0 0)} is VALID [2020-07-10 15:07:02,182 INFO L280 TraceCheckUtils]: 6: Hoare triple {749#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {749#(<= main_~j~0 0)} is VALID [2020-07-10 15:07:02,183 INFO L280 TraceCheckUtils]: 7: Hoare triple {749#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {725#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:02,184 INFO L280 TraceCheckUtils]: 8: Hoare triple {725#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {725#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:02,185 INFO L280 TraceCheckUtils]: 9: Hoare triple {725#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {726#(<= main_~j~0 2)} is VALID [2020-07-10 15:07:02,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {726#(<= main_~j~0 2)} assume !(~j~0 < 10); {720#false} is VALID [2020-07-10 15:07:02,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {720#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {720#false} is VALID [2020-07-10 15:07:02,186 INFO L280 TraceCheckUtils]: 12: Hoare triple {720#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {720#false} is VALID [2020-07-10 15:07:02,187 INFO L280 TraceCheckUtils]: 13: Hoare triple {720#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {720#false} is VALID [2020-07-10 15:07:02,187 INFO L280 TraceCheckUtils]: 14: Hoare triple {720#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {720#false} is VALID [2020-07-10 15:07:02,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {720#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {720#false} is VALID [2020-07-10 15:07:02,187 INFO L280 TraceCheckUtils]: 16: Hoare triple {720#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {720#false} is VALID [2020-07-10 15:07:02,187 INFO L263 TraceCheckUtils]: 17: Hoare triple {720#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {720#false} is VALID [2020-07-10 15:07:02,188 INFO L280 TraceCheckUtils]: 18: Hoare triple {720#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {720#false} is VALID [2020-07-10 15:07:02,188 INFO L280 TraceCheckUtils]: 19: Hoare triple {720#false} assume true; {720#false} is VALID [2020-07-10 15:07:02,188 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {720#false} {720#false} #62#return; {720#false} is VALID [2020-07-10 15:07:02,188 INFO L280 TraceCheckUtils]: 21: Hoare triple {720#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {720#false} is VALID [2020-07-10 15:07:02,189 INFO L280 TraceCheckUtils]: 22: Hoare triple {720#false} assume 0 == #t~ret12;havoc #t~ret12; {720#false} is VALID [2020-07-10 15:07:02,189 INFO L280 TraceCheckUtils]: 23: Hoare triple {720#false} assume !false; {720#false} is VALID [2020-07-10 15:07:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:07:02,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:02,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:07:02,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740286326] [2020-07-10 15:07:02,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 15:07:02,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:02,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:07:02,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:02,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:07:02,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:02,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:07:02,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:07:02,238 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2020-07-10 15:07:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:02,461 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-10 15:07:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:07:02,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 15:07:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:07:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-10 15:07:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:07:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-10 15:07:02,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-10 15:07:02,514 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-10 15:07:02,515 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:07:02,515 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:07:02,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-10 15:07:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:07:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-10 15:07:02,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:02,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-10 15:07:02,534 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-10 15:07:02,534 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-10 15:07:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:02,536 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 15:07:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 15:07:02,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:02,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:02,537 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-10 15:07:02,537 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-10 15:07:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:02,539 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 15:07:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 15:07:02,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:02,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:02,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:02,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:07:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-10 15:07:02,542 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2020-07-10 15:07:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:02,542 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-10 15:07:02,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:07:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 15:07:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:07:02,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:02,543 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:07:02,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:02,751 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:02,752 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 2 times [2020-07-10 15:07:02,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:02,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889965354] [2020-07-10 15:07:02,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {971#(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; {959#true} is VALID [2020-07-10 15:07:02,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 15:07:02,847 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #58#return; {959#true} is VALID [2020-07-10 15:07:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {959#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {959#true} is VALID [2020-07-10 15:07:02,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 15:07:02,853 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {960#false} #62#return; {960#false} is VALID [2020-07-10 15:07:02,854 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {971#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:07:02,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {971#(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; {959#true} is VALID [2020-07-10 15:07:02,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 15:07:02,855 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #58#return; {959#true} is VALID [2020-07-10 15:07:02,855 INFO L263 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret13 := main(); {959#true} is VALID [2020-07-10 15:07:02,856 INFO L280 TraceCheckUtils]: 5: Hoare triple {959#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {964#(= 0 main_~j~0)} is VALID [2020-07-10 15:07:02,857 INFO L280 TraceCheckUtils]: 6: Hoare triple {964#(= 0 main_~j~0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {964#(= 0 main_~j~0)} is VALID [2020-07-10 15:07:02,858 INFO L280 TraceCheckUtils]: 7: Hoare triple {964#(= 0 main_~j~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {965#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:02,858 INFO L280 TraceCheckUtils]: 8: Hoare triple {965#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {965#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:02,859 INFO L280 TraceCheckUtils]: 9: Hoare triple {965#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {966#(<= main_~j~0 2)} is VALID [2020-07-10 15:07:02,860 INFO L280 TraceCheckUtils]: 10: Hoare triple {966#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {966#(<= main_~j~0 2)} is VALID [2020-07-10 15:07:02,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {966#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {967#(<= main_~j~0 3)} is VALID [2020-07-10 15:07:02,862 INFO L280 TraceCheckUtils]: 12: Hoare triple {967#(<= main_~j~0 3)} assume !(~j~0 < 10); {960#false} is VALID [2020-07-10 15:07:02,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {960#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {960#false} is VALID [2020-07-10 15:07:02,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {960#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {960#false} is VALID [2020-07-10 15:07:02,863 INFO L280 TraceCheckUtils]: 15: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2020-07-10 15:07:02,863 INFO L280 TraceCheckUtils]: 16: Hoare triple {960#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {960#false} is VALID [2020-07-10 15:07:02,863 INFO L280 TraceCheckUtils]: 17: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2020-07-10 15:07:02,864 INFO L280 TraceCheckUtils]: 18: Hoare triple {960#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {960#false} is VALID [2020-07-10 15:07:02,864 INFO L263 TraceCheckUtils]: 19: Hoare triple {960#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {959#true} is VALID [2020-07-10 15:07:02,864 INFO L280 TraceCheckUtils]: 20: Hoare triple {959#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {959#true} is VALID [2020-07-10 15:07:02,864 INFO L280 TraceCheckUtils]: 21: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 15:07:02,865 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {959#true} {960#false} #62#return; {960#false} is VALID [2020-07-10 15:07:02,865 INFO L280 TraceCheckUtils]: 23: Hoare triple {960#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {960#false} is VALID [2020-07-10 15:07:02,865 INFO L280 TraceCheckUtils]: 24: Hoare triple {960#false} assume 0 == #t~ret12;havoc #t~ret12; {960#false} is VALID [2020-07-10 15:07:02,865 INFO L280 TraceCheckUtils]: 25: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-10 15:07:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:07:02,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889965354] [2020-07-10 15:07:02,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331563795] [2020-07-10 15:07:02,867 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 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-10 15:07:02,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:07:02,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:02,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:07:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:02,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:03,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2020-07-10 15:07:03,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {959#true} is VALID [2020-07-10 15:07:03,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 15:07:03,046 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #58#return; {959#true} is VALID [2020-07-10 15:07:03,046 INFO L263 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret13 := main(); {959#true} is VALID [2020-07-10 15:07:03,048 INFO L280 TraceCheckUtils]: 5: Hoare triple {959#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {990#(<= main_~j~0 0)} is VALID [2020-07-10 15:07:03,049 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {990#(<= main_~j~0 0)} is VALID [2020-07-10 15:07:03,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {965#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:03,051 INFO L280 TraceCheckUtils]: 8: Hoare triple {965#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {965#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:03,052 INFO L280 TraceCheckUtils]: 9: Hoare triple {965#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {966#(<= main_~j~0 2)} is VALID [2020-07-10 15:07:03,053 INFO L280 TraceCheckUtils]: 10: Hoare triple {966#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {966#(<= main_~j~0 2)} is VALID [2020-07-10 15:07:03,054 INFO L280 TraceCheckUtils]: 11: Hoare triple {966#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {967#(<= main_~j~0 3)} is VALID [2020-07-10 15:07:03,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {967#(<= main_~j~0 3)} assume !(~j~0 < 10); {960#false} is VALID [2020-07-10 15:07:03,055 INFO L280 TraceCheckUtils]: 13: Hoare triple {960#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {960#false} is VALID [2020-07-10 15:07:03,055 INFO L280 TraceCheckUtils]: 14: Hoare triple {960#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {960#false} is VALID [2020-07-10 15:07:03,055 INFO L280 TraceCheckUtils]: 15: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2020-07-10 15:07:03,056 INFO L280 TraceCheckUtils]: 16: Hoare triple {960#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {960#false} is VALID [2020-07-10 15:07:03,056 INFO L280 TraceCheckUtils]: 17: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2020-07-10 15:07:03,056 INFO L280 TraceCheckUtils]: 18: Hoare triple {960#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {960#false} is VALID [2020-07-10 15:07:03,056 INFO L263 TraceCheckUtils]: 19: Hoare triple {960#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {960#false} is VALID [2020-07-10 15:07:03,057 INFO L280 TraceCheckUtils]: 20: Hoare triple {960#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {960#false} is VALID [2020-07-10 15:07:03,057 INFO L280 TraceCheckUtils]: 21: Hoare triple {960#false} assume true; {960#false} is VALID [2020-07-10 15:07:03,057 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {960#false} {960#false} #62#return; {960#false} is VALID [2020-07-10 15:07:03,057 INFO L280 TraceCheckUtils]: 23: Hoare triple {960#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {960#false} is VALID [2020-07-10 15:07:03,057 INFO L280 TraceCheckUtils]: 24: Hoare triple {960#false} assume 0 == #t~ret12;havoc #t~ret12; {960#false} is VALID [2020-07-10 15:07:03,058 INFO L280 TraceCheckUtils]: 25: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-10 15:07:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:07:03,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:03,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-10 15:07:03,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065435657] [2020-07-10 15:07:03,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-10 15:07:03,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:03,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:07:03,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:03,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:07:03,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:07:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:07:03,115 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2020-07-10 15:07:03,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:03,349 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-10 15:07:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:07:03,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-10 15:07:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:07:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-10 15:07:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:07:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-10 15:07:03,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2020-07-10 15:07:03,414 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-10 15:07:03,416 INFO L225 Difference]: With dead ends: 44 [2020-07-10 15:07:03,416 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:07:03,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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-10 15:07:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:07:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-10 15:07:03,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:03,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-10 15:07:03,438 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-10 15:07:03,438 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-10 15:07:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:03,441 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-10 15:07:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-10 15:07:03,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:03,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:03,445 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-10 15:07:03,445 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-10 15:07:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:03,450 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-10 15:07:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-10 15:07:03,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:03,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:03,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:03,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:07:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-10 15:07:03,454 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2020-07-10 15:07:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:03,455 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-10 15:07:03,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:07:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:07:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:07:03,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:03,456 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:07:03,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:07:03,660 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:03,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:03,660 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 3 times [2020-07-10 15:07:03,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:03,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867783642] [2020-07-10 15:07:03,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:03,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#(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-10 15:07:03,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:07:03,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1216#true} {1216#true} #58#return; {1216#true} is VALID [2020-07-10 15:07:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:03,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {1216#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1216#true} is VALID [2020-07-10 15:07:03,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:07:03,817 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1216#true} {1217#false} #62#return; {1217#false} is VALID [2020-07-10 15:07:03,818 INFO L263 TraceCheckUtils]: 0: Hoare triple {1216#true} call ULTIMATE.init(); {1229#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:07:03,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#(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-10 15:07:03,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:07:03,819 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1216#true} {1216#true} #58#return; {1216#true} is VALID [2020-07-10 15:07:03,819 INFO L263 TraceCheckUtils]: 4: Hoare triple {1216#true} call #t~ret13 := main(); {1216#true} is VALID [2020-07-10 15:07:03,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {1216#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1221#(= 0 main_~j~0)} is VALID [2020-07-10 15:07:03,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {1221#(= 0 main_~j~0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1221#(= 0 main_~j~0)} is VALID [2020-07-10 15:07:03,820 INFO L280 TraceCheckUtils]: 7: Hoare triple {1221#(= 0 main_~j~0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1222#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:03,821 INFO L280 TraceCheckUtils]: 8: Hoare triple {1222#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1222#(<= main_~j~0 1)} is VALID [2020-07-10 15:07:03,822 INFO L280 TraceCheckUtils]: 9: Hoare triple {1222#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1223#(<= main_~j~0 2)} is VALID [2020-07-10 15:07:03,822 INFO L280 TraceCheckUtils]: 10: Hoare triple {1223#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1223#(<= main_~j~0 2)} is VALID [2020-07-10 15:07:03,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {1223#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1224#(<= main_~j~0 3)} is VALID [2020-07-10 15:07:03,823 INFO L280 TraceCheckUtils]: 12: Hoare triple {1224#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1224#(<= main_~j~0 3)} is VALID [2020-07-10 15:07:03,824 INFO L280 TraceCheckUtils]: 13: Hoare triple {1224#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1225#(<= main_~j~0 4)} is VALID [2020-07-10 15:07:03,824 INFO L280 TraceCheckUtils]: 14: Hoare triple {1225#(<= main_~j~0 4)} assume !(~j~0 < 10); {1217#false} is VALID [2020-07-10 15:07:03,824 INFO L280 TraceCheckUtils]: 15: Hoare triple {1217#false} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1217#false} is VALID [2020-07-10 15:07:03,824 INFO L280 TraceCheckUtils]: 16: Hoare triple {1217#false} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1217#false} is VALID [2020-07-10 15:07:03,825 INFO L280 TraceCheckUtils]: 17: Hoare triple {1217#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1217#false} is VALID [2020-07-10 15:07:03,826 INFO L280 TraceCheckUtils]: 18: Hoare triple {1217#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1217#false} is VALID [2020-07-10 15:07:03,827 INFO L280 TraceCheckUtils]: 19: Hoare triple {1217#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1217#false} is VALID [2020-07-10 15:07:03,827 INFO L280 TraceCheckUtils]: 20: Hoare triple {1217#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1217#false} is VALID [2020-07-10 15:07:03,827 INFO L263 TraceCheckUtils]: 21: Hoare triple {1217#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1216#true} is VALID [2020-07-10 15:07:03,827 INFO L280 TraceCheckUtils]: 22: Hoare triple {1216#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1216#true} is VALID [2020-07-10 15:07:03,828 INFO L280 TraceCheckUtils]: 23: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:07:03,828 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1216#true} {1217#false} #62#return; {1217#false} is VALID [2020-07-10 15:07:03,829 INFO L280 TraceCheckUtils]: 25: Hoare triple {1217#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1217#false} is VALID [2020-07-10 15:07:03,829 INFO L280 TraceCheckUtils]: 26: Hoare triple {1217#false} assume 0 == #t~ret12;havoc #t~ret12; {1217#false} is VALID [2020-07-10 15:07:03,829 INFO L280 TraceCheckUtils]: 27: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2020-07-10 15:07:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:07:03,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867783642] [2020-07-10 15:07:03,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602182266] [2020-07-10 15:07:03,831 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 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-10 15:07:03,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:07:03,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:07:03,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-10 15:07:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:03,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:07:03,968 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-10 15:07:03,969 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:07:03,984 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:07:03,989 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-10 15:07:03,989 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:07:04,001 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:07:04,018 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:07:04,019 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:17 [2020-07-10 15:07:04,024 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:07:04,024 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_11|, main_~i~0, |main_~#array~0.offset|, |v_#memory_$Pointer$.base_11|, |main_~#array~0.base|]. (and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_11| |main_~#cont~0.base| (store (select |v_#memory_$Pointer$.offset_11| |main_~#cont~0.base|) |main_~#cont~0.offset| (+ (* main_~i~0 8) |main_~#array~0.offset|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_11| |main_~#cont~0.base| (store (select |v_#memory_$Pointer$.base_11| |main_~#cont~0.base|) |main_~#cont~0.offset| |main_~#array~0.base|))) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset)) [2020-07-10 15:07:04,024 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset)) [2020-07-10 15:07:04,296 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:07:04,315 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:07:04,356 INFO L263 TraceCheckUtils]: 0: Hoare triple {1216#true} call ULTIMATE.init(); {1216#true} is VALID [2020-07-10 15:07:04,357 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-10 15:07:04,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#true} assume true; {1216#true} is VALID [2020-07-10 15:07:04,357 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1216#true} {1216#true} #58#return; {1216#true} is VALID [2020-07-10 15:07:04,357 INFO L263 TraceCheckUtils]: 4: Hoare triple {1216#true} call #t~ret13 := main(); {1216#true} is VALID [2020-07-10 15:07:04,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {1216#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.allocOnStack(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1216#true} is VALID [2020-07-10 15:07:04,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {1216#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1216#true} is VALID [2020-07-10 15:07:04,358 INFO L280 TraceCheckUtils]: 7: Hoare triple {1216#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1216#true} is VALID [2020-07-10 15:07:04,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {1216#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1216#true} is VALID [2020-07-10 15:07:04,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {1216#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1216#true} is VALID [2020-07-10 15:07:04,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {1216#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1216#true} is VALID [2020-07-10 15:07:04,359 INFO L280 TraceCheckUtils]: 11: Hoare triple {1216#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1216#true} is VALID [2020-07-10 15:07:04,359 INFO L280 TraceCheckUtils]: 12: Hoare triple {1216#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1216#true} is VALID [2020-07-10 15:07:04,359 INFO L280 TraceCheckUtils]: 13: Hoare triple {1216#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1216#true} is VALID [2020-07-10 15:07:04,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {1216#true} assume !(~j~0 < 10); {1216#true} is VALID [2020-07-10 15:07:04,361 INFO L280 TraceCheckUtils]: 15: Hoare triple {1216#true} assume ~i~0 >= 0 && ~i~0 < 10;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1278#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset))} is VALID [2020-07-10 15:07:04,362 INFO L280 TraceCheckUtils]: 16: Hoare triple {1278#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset))} assume #t~mem8 > 0;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1278#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset))} is VALID [2020-07-10 15:07:04,364 INFO L280 TraceCheckUtils]: 17: Hoare triple {1278#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1285#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (<= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset))} is VALID [2020-07-10 15:07:04,365 INFO L280 TraceCheckUtils]: 18: Hoare triple {1285#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (<= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1289#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset))} is VALID [2020-07-10 15:07:04,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {1289#(and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1293#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) |main_#t~mem10|) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))))} is VALID [2020-07-10 15:07:04,367 INFO L280 TraceCheckUtils]: 20: Hoare triple {1293#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) |main_#t~mem10|) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))))} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1297#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) main_~i~0) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))))} is VALID [2020-07-10 15:07:04,368 INFO L263 TraceCheckUtils]: 21: Hoare triple {1297#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) main_~i~0) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))))} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1216#true} is VALID [2020-07-10 15:07:04,369 INFO L280 TraceCheckUtils]: 22: Hoare triple {1216#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 4 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem1;havoc #t~mem0.base, #t~mem0.offset; {1304#(or (and (<= 0 |check_#res|) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|))) (<= 1 |check_#res|))} is VALID [2020-07-10 15:07:04,369 INFO L280 TraceCheckUtils]: 23: Hoare triple {1304#(or (and (<= 0 |check_#res|) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|))) (<= 1 |check_#res|))} assume true; {1304#(or (and (<= 0 |check_#res|) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|))) (<= 1 |check_#res|))} is VALID [2020-07-10 15:07:04,371 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1304#(or (and (<= 0 |check_#res|) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|))) (<= 1 |check_#res|))} {1297#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) main_~i~0) (<= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))))} #62#return; {1311#(<= 1 |main_#t~ret12|)} is VALID [2020-07-10 15:07:04,371 INFO L280 TraceCheckUtils]: 25: Hoare triple {1311#(<= 1 |main_#t~ret12|)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1311#(<= 1 |main_#t~ret12|)} is VALID [2020-07-10 15:07:04,372 INFO L280 TraceCheckUtils]: 26: Hoare triple {1311#(<= 1 |main_#t~ret12|)} assume 0 == #t~ret12;havoc #t~ret12; {1217#false} is VALID [2020-07-10 15:07:04,372 INFO L280 TraceCheckUtils]: 27: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2020-07-10 15:07:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-10 15:07:04,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:07:04,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2020-07-10 15:07:04,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783335847] [2020-07-10 15:07:04,375 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2020-07-10 15:07:04,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:04,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 15:07:04,428 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-10 15:07:04,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 15:07:04,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:04,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 15:07:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:07:04,429 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2020-07-10 15:07:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:05,385 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-10 15:07:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:07:05,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2020-07-10 15:07:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:07:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2020-07-10 15:07:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:07:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2020-07-10 15:07:05,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 45 transitions. [2020-07-10 15:07:05,467 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-10 15:07:05,467 INFO L225 Difference]: With dead ends: 44 [2020-07-10 15:07:05,468 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:07:05,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:07:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:07:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:07:05,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:05,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:05,470 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:05,470 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:05,471 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:07:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:07:05,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:05,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:05,471 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:05,471 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:05,472 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:07:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:07:05,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:05,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:05,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:05,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:07:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:07:05,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-07-10 15:07:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:05,473 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:07:05,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 15:07:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:07:05,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:05,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 15:07:05,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:07:05,802 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:07:05,803 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:07:05,803 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:07:05,803 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:07:05,803 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:07:05,803 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:07:05,803 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:07:05,804 INFO L264 CegarLoopResult]: At program point L37-4(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse2 (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (let ((.cse1 (select (select |#memory_int| .cse0) .cse2))) (and (= main_~pa~0.base .cse0) (<= .cse1 main_~i~0) (<= main_~i~0 .cse1) (= .cse2 main_~pa~0.offset)))) [2020-07-10 15:07:05,804 INFO L268 CegarLoopResult]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2020-07-10 15:07:05,804 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2020-07-10 15:07:05,804 INFO L271 CegarLoopResult]: At program point L27-3(lines 27 30) the Hoare annotation is: true [2020-07-10 15:07:05,804 INFO L268 CegarLoopResult]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2020-07-10 15:07:05,804 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2020-07-10 15:07:05,804 INFO L268 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2020-07-10 15:07:05,804 INFO L268 CegarLoopResult]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2020-07-10 15:07:05,804 INFO L268 CegarLoopResult]: For program point L32(lines 32 44) no Hoare annotation was computed. [2020-07-10 15:07:05,805 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2020-07-10 15:07:05,805 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 20 50) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:07:05,805 INFO L264 CegarLoopResult]: At program point L41(lines 21 50) the Hoare annotation is: false [2020-07-10 15:07:05,805 INFO L268 CegarLoopResult]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2020-07-10 15:07:05,805 INFO L268 CegarLoopResult]: For program point L35(lines 35 43) no Hoare annotation was computed. [2020-07-10 15:07:05,805 INFO L264 CegarLoopResult]: At program point L37-3(lines 37 39) the Hoare annotation is: (and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4) main_~pa~0.offset)) [2020-07-10 15:07:05,805 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2020-07-10 15:07:05,806 INFO L268 CegarLoopResult]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2020-07-10 15:07:05,806 INFO L268 CegarLoopResult]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2020-07-10 15:07:05,811 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:07:05,812 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-10 15:07:05,812 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:07:05,812 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:07:05,813 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-10 15:07:05,813 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-10 15:07:05,813 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-10 15:07:05,813 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-10 15:07:05,813 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-10 15:07:05,814 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:07:05,815 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 15:07:05,815 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:07:05,815 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 15:07:05,815 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 15:07:05,816 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:07:05,816 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 15:07:05,816 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 15:07:05,816 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:07:05,816 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:07:05,816 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:07:05,816 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:07:05,823 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:07:05,824 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:07:05,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:07:05,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:07:05,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:07:05,829 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:07:05,829 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:07:05,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:07:05,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:07:05,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:07:05,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:07:05 BoogieIcfgContainer [2020-07-10 15:07:05,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:07:05,835 INFO L168 Benchmark]: Toolchain (without parser) took 11381.20 ms. Allocated memory was 141.6 MB in the beginning and 282.6 MB in the end (delta: 141.0 MB). Free memory was 104.6 MB in the beginning and 193.9 MB in the end (delta: -89.2 MB). Peak memory consumption was 51.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:05,836 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:07:05,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.11 ms. Allocated memory is still 141.6 MB. Free memory was 104.6 MB in the beginning and 93.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:05,838 INFO L168 Benchmark]: Boogie Preprocessor took 157.75 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 93.4 MB in the beginning and 180.8 MB in the end (delta: -87.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:05,838 INFO L168 Benchmark]: RCFGBuilder took 498.79 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 155.1 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:05,839 INFO L168 Benchmark]: TraceAbstraction took 10450.35 ms. Allocated memory was 203.9 MB in the beginning and 282.6 MB in the end (delta: 78.6 MB). Free memory was 154.2 MB in the beginning and 193.9 MB in the end (delta: -39.7 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:05,842 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.23 ms. Allocated memory is still 141.6 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.11 ms. Allocated memory is still 141.6 MB. Free memory was 104.6 MB in the beginning and 93.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 157.75 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 93.4 MB in the beginning and 180.8 MB in the end (delta: -87.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 498.79 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 155.1 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10450.35 ms. Allocated memory was 203.9 MB in the beginning and 282.6 MB in the end (delta: 78.6 MB). Free memory was 154.2 MB in the beginning and 193.9 MB in the end (delta: -39.7 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant [2020-07-10 15:07:05,849 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:07:05,849 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:07:05,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:07:05,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:07:05,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:07:05,850 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:07:05,851 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:07:05,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:07:05,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:07:05,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (pa == #memory_$Pointer$[cont][cont] && i <= unknown-#memory_int-unknown[pa][pa]) && #memory_$Pointer$[cont][cont] + 4 == pa - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.2s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 122 SDtfs, 32 SDslu, 255 SDs, 0 SdLazy, 349 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 24 NumberOfFragments, 93 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 66 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 275 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 263 ConstructedInterpolants, 1 QuantifiedInterpolants, 15731 SizeOfPredicates, 28 NumberOfNonLiveVariables, 589 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 31/80 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 correct! Received shutdown request...