/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-tiling/skippedu.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:25:55,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:25:55,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:25:55,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:25:55,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:25:55,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:25:55,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:25:55,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:25:55,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:25:55,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:25:55,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:25:55,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:25:55,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:25:55,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:25:55,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:25:55,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:25:55,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:25:55,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:25:55,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:25:55,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:25:55,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:25:55,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:25:55,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:25:55,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:25:55,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:25:55,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:25:55,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:25:55,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:25:55,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:25:55,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:25:55,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:25:55,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:25:55,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:25:55,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:25:55,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:25:55,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:25:55,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:25:55,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:25:55,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:25:55,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:25:55,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:25:55,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:25:55,869 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:25:55,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:25:55,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:25:55,872 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:25:55,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:25:55,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:25:55,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:25:55,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:25:55,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:25:55,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:25:55,873 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:25:55,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:25:55,874 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:25:55,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:25:55,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:25:55,874 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:25:55,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:25:55,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:25:55,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:25:55,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:25:55,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:25:55,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:25:55,876 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:25:56,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:25:56,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:25:56,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:25:56,192 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:25:56,193 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:25:56,194 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/skippedu.c [2020-07-11 02:25:56,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7ff0094/8e222fe0009247249f942a64573b34aa/FLAG6d98c4f77 [2020-07-11 02:25:56,857 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:25:56,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skippedu.c [2020-07-11 02:25:56,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7ff0094/8e222fe0009247249f942a64573b34aa/FLAG6d98c4f77 [2020-07-11 02:25:57,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7ff0094/8e222fe0009247249f942a64573b34aa [2020-07-11 02:25:57,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:25:57,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:25:57,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:25:57,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:25:57,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:25:57,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23452e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57, skipping insertion in model container [2020-07-11 02:25:57,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:25:57,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:25:57,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:25:57,455 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:25:57,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:25:57,506 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:25:57,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57 WrapperNode [2020-07-11 02:25:57,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:25:57,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:25:57,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:25:57,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:25:57,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (1/1) ... [2020-07-11 02:25:57,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:25:57,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:25:57,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:25:57,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:25:57,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (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-11 02:25:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:25:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:25:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:25:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:25:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:25:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:25:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:25:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:25:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:25:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:25:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 02:25:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:25:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 02:25:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:25:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:25:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:25:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:25:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:25:58,343 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:25:58,343 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-11 02:25:58,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:25:58 BoogieIcfgContainer [2020-07-11 02:25:58,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:25:58,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:25:58,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:25:58,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:25:58,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:25:57" (1/3) ... [2020-07-11 02:25:58,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb96f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:25:58, skipping insertion in model container [2020-07-11 02:25:58,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:25:57" (2/3) ... [2020-07-11 02:25:58,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb96f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:25:58, skipping insertion in model container [2020-07-11 02:25:58,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:25:58" (3/3) ... [2020-07-11 02:25:58,374 INFO L109 eAbstractionObserver]: Analyzing ICFG skippedu.c [2020-07-11 02:25:58,386 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:25:58,396 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:25:58,413 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:25:58,443 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:25:58,444 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:25:58,445 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:25:58,445 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:25:58,445 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:25:58,445 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:25:58,446 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:25:58,446 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:25:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2020-07-11 02:25:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 02:25:58,490 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:25:58,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:25:58,491 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:25:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:25:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1270765896, now seen corresponding path program 1 times [2020-07-11 02:25:58,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:25:58,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [301133009] [2020-07-11 02:25:58,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:25:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:58,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} #NULL.base, #NULL.offset := 0, 0; {69#true} is VALID [2020-07-11 02:25:58,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {69#true} #valid := #valid[0 := 0]; {69#true} is VALID [2020-07-11 02:25:58,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {69#true} assume 0 < #StackHeapBarrier; {69#true} is VALID [2020-07-11 02:25:58,762 INFO L280 TraceCheckUtils]: 3: Hoare triple {69#true} ~SIZE~0 := 0; {69#true} is VALID [2020-07-11 02:25:58,763 INFO L280 TraceCheckUtils]: 4: Hoare triple {69#true} ~MAX~0 := 100000; {69#true} is VALID [2020-07-11 02:25:58,763 INFO L280 TraceCheckUtils]: 5: Hoare triple {69#true} assume true; {69#true} is VALID [2020-07-11 02:25:58,764 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {69#true} {69#true} #127#return; {69#true} is VALID [2020-07-11 02:25:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:25:58,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {69#true} ~cond := #in~cond; {69#true} is VALID [2020-07-11 02:25:58,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {69#true} assume !(0 == ~cond); {69#true} is VALID [2020-07-11 02:25:58,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {69#true} assume true; {69#true} is VALID [2020-07-11 02:25:58,785 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {69#true} {70#false} #123#return; {70#false} is VALID [2020-07-11 02:25:58,787 INFO L263 TraceCheckUtils]: 0: Hoare triple {69#true} call ULTIMATE.init(); {82#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} is VALID [2020-07-11 02:25:58,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} #NULL.base, #NULL.offset := 0, 0; {69#true} is VALID [2020-07-11 02:25:58,788 INFO L280 TraceCheckUtils]: 2: Hoare triple {69#true} #valid := #valid[0 := 0]; {69#true} is VALID [2020-07-11 02:25:58,789 INFO L280 TraceCheckUtils]: 3: Hoare triple {69#true} assume 0 < #StackHeapBarrier; {69#true} is VALID [2020-07-11 02:25:58,789 INFO L280 TraceCheckUtils]: 4: Hoare triple {69#true} ~SIZE~0 := 0; {69#true} is VALID [2020-07-11 02:25:58,789 INFO L280 TraceCheckUtils]: 5: Hoare triple {69#true} ~MAX~0 := 100000; {69#true} is VALID [2020-07-11 02:25:58,790 INFO L280 TraceCheckUtils]: 6: Hoare triple {69#true} assume true; {69#true} is VALID [2020-07-11 02:25:58,790 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {69#true} {69#true} #127#return; {69#true} is VALID [2020-07-11 02:25:58,791 INFO L263 TraceCheckUtils]: 8: Hoare triple {69#true} call #t~ret9 := main(); {69#true} is VALID [2020-07-11 02:25:58,791 INFO L280 TraceCheckUtils]: 9: Hoare triple {69#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {69#true} is VALID [2020-07-11 02:25:58,791 INFO L280 TraceCheckUtils]: 10: Hoare triple {69#true} ~SIZE~0 := #t~nondet0; {69#true} is VALID [2020-07-11 02:25:58,792 INFO L280 TraceCheckUtils]: 11: Hoare triple {69#true} havoc #t~nondet0; {69#true} is VALID [2020-07-11 02:25:58,792 INFO L280 TraceCheckUtils]: 12: Hoare triple {69#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0; {69#true} is VALID [2020-07-11 02:25:58,793 INFO L280 TraceCheckUtils]: 13: Hoare triple {69#true} havoc ~i~0; {69#true} is VALID [2020-07-11 02:25:58,793 INFO L280 TraceCheckUtils]: 14: Hoare triple {69#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); srcloc: L20 {69#true} is VALID [2020-07-11 02:25:58,794 INFO L280 TraceCheckUtils]: 15: Hoare triple {69#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {69#true} is VALID [2020-07-11 02:25:58,794 INFO L280 TraceCheckUtils]: 16: Hoare triple {69#true} ~i~0 := 0; {69#true} is VALID [2020-07-11 02:25:58,795 INFO L280 TraceCheckUtils]: 17: Hoare triple {69#true} assume !true; {70#false} is VALID [2020-07-11 02:25:58,796 INFO L280 TraceCheckUtils]: 18: Hoare triple {70#false} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); {70#false} is VALID [2020-07-11 02:25:58,796 INFO L263 TraceCheckUtils]: 19: Hoare triple {70#false} call assume_abort_if_not((if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0)); {69#true} is VALID [2020-07-11 02:25:58,797 INFO L280 TraceCheckUtils]: 20: Hoare triple {69#true} ~cond := #in~cond; {69#true} is VALID [2020-07-11 02:25:58,797 INFO L280 TraceCheckUtils]: 21: Hoare triple {69#true} assume !(0 == ~cond); {69#true} is VALID [2020-07-11 02:25:58,798 INFO L280 TraceCheckUtils]: 22: Hoare triple {69#true} assume true; {69#true} is VALID [2020-07-11 02:25:58,798 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {69#true} {70#false} #123#return; {70#false} is VALID [2020-07-11 02:25:58,799 INFO L280 TraceCheckUtils]: 24: Hoare triple {70#false} ~i~0 := 1; {70#false} is VALID [2020-07-11 02:25:58,799 INFO L280 TraceCheckUtils]: 25: Hoare triple {70#false} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {70#false} is VALID [2020-07-11 02:25:58,799 INFO L280 TraceCheckUtils]: 26: Hoare triple {70#false} ~i~0 := 0; {70#false} is VALID [2020-07-11 02:25:58,800 INFO L280 TraceCheckUtils]: 27: Hoare triple {70#false} assume !!(~i~0 < ~SIZE~0); {70#false} is VALID [2020-07-11 02:25:58,800 INFO L280 TraceCheckUtils]: 28: Hoare triple {70#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {70#false} is VALID [2020-07-11 02:25:58,801 INFO L263 TraceCheckUtils]: 29: Hoare triple {70#false} call __VERIFIER_assert((if #t~mem8 <= ~i~0 then 1 else 0)); {70#false} is VALID [2020-07-11 02:25:58,801 INFO L280 TraceCheckUtils]: 30: Hoare triple {70#false} ~cond := #in~cond; {70#false} is VALID [2020-07-11 02:25:58,802 INFO L280 TraceCheckUtils]: 31: Hoare triple {70#false} assume 0 == ~cond; {70#false} is VALID [2020-07-11 02:25:58,802 INFO L280 TraceCheckUtils]: 32: Hoare triple {70#false} assume !false; {70#false} is VALID [2020-07-11 02:25:58,809 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-11 02:25:58,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [301133009] [2020-07-11 02:25:58,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:25:58,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:25:58,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974922773] [2020-07-11 02:25:58,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-11 02:25:58,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:25:58,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:25:58,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:58,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:25:58,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:25:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:25:58,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:25:58,920 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2020-07-11 02:25:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:59,535 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2020-07-11 02:25:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:25:59,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-11 02:25:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:25:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:25:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2020-07-11 02:25:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:25:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2020-07-11 02:25:59,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2020-07-11 02:25:59,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:59,751 INFO L225 Difference]: With dead ends: 108 [2020-07-11 02:25:59,751 INFO L226 Difference]: Without dead ends: 59 [2020-07-11 02:25:59,756 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-11 02:25:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-11 02:25:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-11 02:25:59,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:25:59,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-11 02:25:59,873 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-11 02:25:59,873 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-11 02:25:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:59,880 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-11 02:25:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-11 02:25:59,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:25:59,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:25:59,882 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-11 02:25:59,882 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-11 02:25:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:25:59,889 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-07-11 02:25:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-11 02:25:59,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:25:59,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:25:59,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:25:59,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:25:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-11 02:25:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-07-11 02:25:59,898 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 33 [2020-07-11 02:25:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:25:59,899 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-07-11 02:25:59,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:25:59,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2020-07-11 02:25:59,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:25:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-11 02:25:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 02:25:59,983 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:25:59,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:25:59,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:25:59,984 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:25:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:25:59,984 INFO L82 PathProgramCache]: Analyzing trace with hash 50142755, now seen corresponding path program 1 times [2020-07-11 02:25:59,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:25:59,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464404807] [2020-07-11 02:25:59,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:00,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {552#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} #NULL.base, #NULL.offset := 0, 0; {537#true} is VALID [2020-07-11 02:26:00,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {537#true} #valid := #valid[0 := 0]; {537#true} is VALID [2020-07-11 02:26:00,147 INFO L280 TraceCheckUtils]: 2: Hoare triple {537#true} assume 0 < #StackHeapBarrier; {537#true} is VALID [2020-07-11 02:26:00,148 INFO L280 TraceCheckUtils]: 3: Hoare triple {537#true} ~SIZE~0 := 0; {537#true} is VALID [2020-07-11 02:26:00,148 INFO L280 TraceCheckUtils]: 4: Hoare triple {537#true} ~MAX~0 := 100000; {537#true} is VALID [2020-07-11 02:26:00,148 INFO L280 TraceCheckUtils]: 5: Hoare triple {537#true} assume true; {537#true} is VALID [2020-07-11 02:26:00,149 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {537#true} {537#true} #127#return; {537#true} is VALID [2020-07-11 02:26:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:00,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {537#true} ~cond := #in~cond; {537#true} is VALID [2020-07-11 02:26:00,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {537#true} assume !(0 == ~cond); {537#true} is VALID [2020-07-11 02:26:00,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2020-07-11 02:26:00,178 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {537#true} {538#false} #123#return; {538#false} is VALID [2020-07-11 02:26:00,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {552#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} is VALID [2020-07-11 02:26:00,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {552#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} #NULL.base, #NULL.offset := 0, 0; {537#true} is VALID [2020-07-11 02:26:00,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {537#true} #valid := #valid[0 := 0]; {537#true} is VALID [2020-07-11 02:26:00,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {537#true} assume 0 < #StackHeapBarrier; {537#true} is VALID [2020-07-11 02:26:00,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {537#true} ~SIZE~0 := 0; {537#true} is VALID [2020-07-11 02:26:00,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {537#true} ~MAX~0 := 100000; {537#true} is VALID [2020-07-11 02:26:00,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {537#true} assume true; {537#true} is VALID [2020-07-11 02:26:00,183 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {537#true} {537#true} #127#return; {537#true} is VALID [2020-07-11 02:26:00,183 INFO L263 TraceCheckUtils]: 8: Hoare triple {537#true} call #t~ret9 := main(); {537#true} is VALID [2020-07-11 02:26:00,184 INFO L280 TraceCheckUtils]: 9: Hoare triple {537#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {537#true} is VALID [2020-07-11 02:26:00,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {537#true} ~SIZE~0 := #t~nondet0; {537#true} is VALID [2020-07-11 02:26:00,188 INFO L280 TraceCheckUtils]: 11: Hoare triple {537#true} havoc #t~nondet0; {537#true} is VALID [2020-07-11 02:26:00,189 INFO L280 TraceCheckUtils]: 12: Hoare triple {537#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0; {546#(<= 2 ~SIZE~0)} is VALID [2020-07-11 02:26:00,191 INFO L280 TraceCheckUtils]: 13: Hoare triple {546#(<= 2 ~SIZE~0)} havoc ~i~0; {546#(<= 2 ~SIZE~0)} is VALID [2020-07-11 02:26:00,192 INFO L280 TraceCheckUtils]: 14: Hoare triple {546#(<= 2 ~SIZE~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); srcloc: L20 {546#(<= 2 ~SIZE~0)} is VALID [2020-07-11 02:26:00,193 INFO L280 TraceCheckUtils]: 15: Hoare triple {546#(<= 2 ~SIZE~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {546#(<= 2 ~SIZE~0)} is VALID [2020-07-11 02:26:00,194 INFO L280 TraceCheckUtils]: 16: Hoare triple {546#(<= 2 ~SIZE~0)} ~i~0 := 0; {547#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} is VALID [2020-07-11 02:26:00,195 INFO L280 TraceCheckUtils]: 17: Hoare triple {547#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} assume !(~i~0 < ~SIZE~0); {538#false} is VALID [2020-07-11 02:26:00,196 INFO L280 TraceCheckUtils]: 18: Hoare triple {538#false} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); {538#false} is VALID [2020-07-11 02:26:00,196 INFO L263 TraceCheckUtils]: 19: Hoare triple {538#false} call assume_abort_if_not((if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0)); {537#true} is VALID [2020-07-11 02:26:00,196 INFO L280 TraceCheckUtils]: 20: Hoare triple {537#true} ~cond := #in~cond; {537#true} is VALID [2020-07-11 02:26:00,197 INFO L280 TraceCheckUtils]: 21: Hoare triple {537#true} assume !(0 == ~cond); {537#true} is VALID [2020-07-11 02:26:00,197 INFO L280 TraceCheckUtils]: 22: Hoare triple {537#true} assume true; {537#true} is VALID [2020-07-11 02:26:00,203 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {537#true} {538#false} #123#return; {538#false} is VALID [2020-07-11 02:26:00,203 INFO L280 TraceCheckUtils]: 24: Hoare triple {538#false} ~i~0 := 1; {538#false} is VALID [2020-07-11 02:26:00,204 INFO L280 TraceCheckUtils]: 25: Hoare triple {538#false} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {538#false} is VALID [2020-07-11 02:26:00,204 INFO L280 TraceCheckUtils]: 26: Hoare triple {538#false} ~i~0 := 0; {538#false} is VALID [2020-07-11 02:26:00,204 INFO L280 TraceCheckUtils]: 27: Hoare triple {538#false} assume !!(~i~0 < ~SIZE~0); {538#false} is VALID [2020-07-11 02:26:00,205 INFO L280 TraceCheckUtils]: 28: Hoare triple {538#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {538#false} is VALID [2020-07-11 02:26:00,205 INFO L263 TraceCheckUtils]: 29: Hoare triple {538#false} call __VERIFIER_assert((if #t~mem8 <= ~i~0 then 1 else 0)); {538#false} is VALID [2020-07-11 02:26:00,206 INFO L280 TraceCheckUtils]: 30: Hoare triple {538#false} ~cond := #in~cond; {538#false} is VALID [2020-07-11 02:26:00,207 INFO L280 TraceCheckUtils]: 31: Hoare triple {538#false} assume 0 == ~cond; {538#false} is VALID [2020-07-11 02:26:00,207 INFO L280 TraceCheckUtils]: 32: Hoare triple {538#false} assume !false; {538#false} is VALID [2020-07-11 02:26:00,210 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-11 02:26:00,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [464404807] [2020-07-11 02:26:00,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:00,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:26:00,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131071126] [2020-07-11 02:26:00,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-11 02:26:00,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:00,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:26:00,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:00,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:26:00,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:26:00,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:26:00,275 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2020-07-11 02:26:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:00,919 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2020-07-11 02:26:00,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:26:00,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-11 02:26:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:26:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2020-07-11 02:26:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:26:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2020-07-11 02:26:00,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 115 transitions. [2020-07-11 02:26:01,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:01,082 INFO L225 Difference]: With dead ends: 106 [2020-07-11 02:26:01,082 INFO L226 Difference]: Without dead ends: 71 [2020-07-11 02:26:01,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11 02:26:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-11 02:26:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2020-07-11 02:26:01,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:01,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 60 states. [2020-07-11 02:26:01,216 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 60 states. [2020-07-11 02:26:01,216 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 60 states. [2020-07-11 02:26:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:01,222 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-07-11 02:26:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2020-07-11 02:26:01,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:01,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:01,224 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 71 states. [2020-07-11 02:26:01,224 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 71 states. [2020-07-11 02:26:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:01,229 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-07-11 02:26:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2020-07-11 02:26:01,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:01,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:01,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:01,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-11 02:26:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2020-07-11 02:26:01,234 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 33 [2020-07-11 02:26:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:01,235 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2020-07-11 02:26:01,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:26:01,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2020-07-11 02:26:01,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-11 02:26:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 02:26:01,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:01,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:26:01,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:26:01,319 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1001580845, now seen corresponding path program 1 times [2020-07-11 02:26:01,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:01,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [34135447] [2020-07-11 02:26:01,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:01,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {1049#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} #NULL.base, #NULL.offset := 0, 0; {1032#true} is VALID [2020-07-11 02:26:01,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {1032#true} #valid := #valid[0 := 0]; {1032#true} is VALID [2020-07-11 02:26:01,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {1032#true} assume 0 < #StackHeapBarrier; {1032#true} is VALID [2020-07-11 02:26:01,460 INFO L280 TraceCheckUtils]: 3: Hoare triple {1032#true} ~SIZE~0 := 0; {1032#true} is VALID [2020-07-11 02:26:01,461 INFO L280 TraceCheckUtils]: 4: Hoare triple {1032#true} ~MAX~0 := 100000; {1032#true} is VALID [2020-07-11 02:26:01,461 INFO L280 TraceCheckUtils]: 5: Hoare triple {1032#true} assume true; {1032#true} is VALID [2020-07-11 02:26:01,461 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1032#true} {1032#true} #127#return; {1032#true} is VALID [2020-07-11 02:26:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:01,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {1032#true} ~cond := #in~cond; {1032#true} is VALID [2020-07-11 02:26:01,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {1032#true} assume !(0 == ~cond); {1032#true} is VALID [2020-07-11 02:26:01,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {1032#true} assume true; {1032#true} is VALID [2020-07-11 02:26:01,471 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1033#false} #123#return; {1033#false} is VALID [2020-07-11 02:26:01,472 INFO L263 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1049#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} is VALID [2020-07-11 02:26:01,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {1049#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} #NULL.base, #NULL.offset := 0, 0; {1032#true} is VALID [2020-07-11 02:26:01,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {1032#true} #valid := #valid[0 := 0]; {1032#true} is VALID [2020-07-11 02:26:01,473 INFO L280 TraceCheckUtils]: 3: Hoare triple {1032#true} assume 0 < #StackHeapBarrier; {1032#true} is VALID [2020-07-11 02:26:01,474 INFO L280 TraceCheckUtils]: 4: Hoare triple {1032#true} ~SIZE~0 := 0; {1032#true} is VALID [2020-07-11 02:26:01,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {1032#true} ~MAX~0 := 100000; {1032#true} is VALID [2020-07-11 02:26:01,474 INFO L280 TraceCheckUtils]: 6: Hoare triple {1032#true} assume true; {1032#true} is VALID [2020-07-11 02:26:01,475 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1032#true} {1032#true} #127#return; {1032#true} is VALID [2020-07-11 02:26:01,475 INFO L263 TraceCheckUtils]: 8: Hoare triple {1032#true} call #t~ret9 := main(); {1032#true} is VALID [2020-07-11 02:26:01,475 INFO L280 TraceCheckUtils]: 9: Hoare triple {1032#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1032#true} is VALID [2020-07-11 02:26:01,476 INFO L280 TraceCheckUtils]: 10: Hoare triple {1032#true} ~SIZE~0 := #t~nondet0; {1032#true} is VALID [2020-07-11 02:26:01,476 INFO L280 TraceCheckUtils]: 11: Hoare triple {1032#true} havoc #t~nondet0; {1032#true} is VALID [2020-07-11 02:26:01,477 INFO L280 TraceCheckUtils]: 12: Hoare triple {1032#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0; {1041#(<= 2 ~SIZE~0)} is VALID [2020-07-11 02:26:01,478 INFO L280 TraceCheckUtils]: 13: Hoare triple {1041#(<= 2 ~SIZE~0)} havoc ~i~0; {1041#(<= 2 ~SIZE~0)} is VALID [2020-07-11 02:26:01,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {1041#(<= 2 ~SIZE~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); srcloc: L20 {1041#(<= 2 ~SIZE~0)} is VALID [2020-07-11 02:26:01,500 INFO L280 TraceCheckUtils]: 15: Hoare triple {1041#(<= 2 ~SIZE~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1041#(<= 2 ~SIZE~0)} is VALID [2020-07-11 02:26:01,503 INFO L280 TraceCheckUtils]: 16: Hoare triple {1041#(<= 2 ~SIZE~0)} ~i~0 := 0; {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} is VALID [2020-07-11 02:26:01,504 INFO L280 TraceCheckUtils]: 17: Hoare triple {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} assume !!(~i~0 < ~SIZE~0); {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} is VALID [2020-07-11 02:26:01,505 INFO L280 TraceCheckUtils]: 18: Hoare triple {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} is VALID [2020-07-11 02:26:01,506 INFO L280 TraceCheckUtils]: 19: Hoare triple {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} SUMMARY for call write~int(#t~nondet3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L24-1 {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} is VALID [2020-07-11 02:26:01,507 INFO L280 TraceCheckUtils]: 20: Hoare triple {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} havoc #t~nondet3; {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} is VALID [2020-07-11 02:26:01,508 INFO L280 TraceCheckUtils]: 21: Hoare triple {1042#(and (<= 2 ~SIZE~0) (= 0 main_~i~0))} #t~post2 := ~i~0; {1043#(and (<= 2 ~SIZE~0) (= |main_#t~post2| 0))} is VALID [2020-07-11 02:26:01,521 INFO L280 TraceCheckUtils]: 22: Hoare triple {1043#(and (<= 2 ~SIZE~0) (= |main_#t~post2| 0))} ~i~0 := 1 + #t~post2; {1044#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2020-07-11 02:26:01,522 INFO L280 TraceCheckUtils]: 23: Hoare triple {1044#(<= (+ main_~i~0 1) ~SIZE~0)} havoc #t~post2; {1044#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2020-07-11 02:26:01,524 INFO L280 TraceCheckUtils]: 24: Hoare triple {1044#(<= (+ main_~i~0 1) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {1033#false} is VALID [2020-07-11 02:26:01,524 INFO L280 TraceCheckUtils]: 25: Hoare triple {1033#false} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); {1033#false} is VALID [2020-07-11 02:26:01,525 INFO L263 TraceCheckUtils]: 26: Hoare triple {1033#false} call assume_abort_if_not((if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0)); {1032#true} is VALID [2020-07-11 02:26:01,525 INFO L280 TraceCheckUtils]: 27: Hoare triple {1032#true} ~cond := #in~cond; {1032#true} is VALID [2020-07-11 02:26:01,526 INFO L280 TraceCheckUtils]: 28: Hoare triple {1032#true} assume !(0 == ~cond); {1032#true} is VALID [2020-07-11 02:26:01,527 INFO L280 TraceCheckUtils]: 29: Hoare triple {1032#true} assume true; {1032#true} is VALID [2020-07-11 02:26:01,527 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1032#true} {1033#false} #123#return; {1033#false} is VALID [2020-07-11 02:26:01,527 INFO L280 TraceCheckUtils]: 31: Hoare triple {1033#false} ~i~0 := 1; {1033#false} is VALID [2020-07-11 02:26:01,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {1033#false} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {1033#false} is VALID [2020-07-11 02:26:01,528 INFO L280 TraceCheckUtils]: 33: Hoare triple {1033#false} ~i~0 := 0; {1033#false} is VALID [2020-07-11 02:26:01,528 INFO L280 TraceCheckUtils]: 34: Hoare triple {1033#false} assume !!(~i~0 < ~SIZE~0); {1033#false} is VALID [2020-07-11 02:26:01,532 INFO L280 TraceCheckUtils]: 35: Hoare triple {1033#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {1033#false} is VALID [2020-07-11 02:26:01,532 INFO L263 TraceCheckUtils]: 36: Hoare triple {1033#false} call __VERIFIER_assert((if #t~mem8 <= ~i~0 then 1 else 0)); {1033#false} is VALID [2020-07-11 02:26:01,532 INFO L280 TraceCheckUtils]: 37: Hoare triple {1033#false} ~cond := #in~cond; {1033#false} is VALID [2020-07-11 02:26:01,533 INFO L280 TraceCheckUtils]: 38: Hoare triple {1033#false} assume 0 == ~cond; {1033#false} is VALID [2020-07-11 02:26:01,533 INFO L280 TraceCheckUtils]: 39: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2020-07-11 02:26:01,538 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-11 02:26:01,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [34135447] [2020-07-11 02:26:01,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:26:01,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 02:26:01,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856759169] [2020-07-11 02:26:01,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-07-11 02:26:01,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:01,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:26:01,589 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-11 02:26:01,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:26:01,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:26:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:26:01,590 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 7 states. [2020-07-11 02:26:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:02,455 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2020-07-11 02:26:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:26:02,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-07-11 02:26:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:26:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2020-07-11 02:26:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:26:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2020-07-11 02:26:02,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 120 transitions. [2020-07-11 02:26:02,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:02,616 INFO L225 Difference]: With dead ends: 110 [2020-07-11 02:26:02,617 INFO L226 Difference]: Without dead ends: 75 [2020-07-11 02:26:02,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:26:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-11 02:26:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2020-07-11 02:26:02,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:02,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 67 states. [2020-07-11 02:26:02,714 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 67 states. [2020-07-11 02:26:02,714 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 67 states. [2020-07-11 02:26:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:02,719 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2020-07-11 02:26:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2020-07-11 02:26:02,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:02,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:02,720 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 75 states. [2020-07-11 02:26:02,720 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 75 states. [2020-07-11 02:26:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:02,729 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2020-07-11 02:26:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2020-07-11 02:26:02,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:02,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:02,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:02,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-11 02:26:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-07-11 02:26:02,737 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 40 [2020-07-11 02:26:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:02,739 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-07-11 02:26:02,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:26:02,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2020-07-11 02:26:02,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-11 02:26:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-11 02:26:02,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:02,820 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:26:02,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:26:02,821 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:02,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:02,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1248131107, now seen corresponding path program 2 times [2020-07-11 02:26:02,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:02,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2046938129] [2020-07-11 02:26:02,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:03,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {1581#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} #NULL.base, #NULL.offset := 0, 0; {1565#true} is VALID [2020-07-11 02:26:03,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {1565#true} #valid := #valid[0 := 0]; {1565#true} is VALID [2020-07-11 02:26:03,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {1565#true} assume 0 < #StackHeapBarrier; {1565#true} is VALID [2020-07-11 02:26:03,271 INFO L280 TraceCheckUtils]: 3: Hoare triple {1565#true} ~SIZE~0 := 0; {1565#true} is VALID [2020-07-11 02:26:03,274 INFO L280 TraceCheckUtils]: 4: Hoare triple {1565#true} ~MAX~0 := 100000; {1565#true} is VALID [2020-07-11 02:26:03,274 INFO L280 TraceCheckUtils]: 5: Hoare triple {1565#true} assume true; {1565#true} is VALID [2020-07-11 02:26:03,274 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1565#true} {1565#true} #127#return; {1565#true} is VALID [2020-07-11 02:26:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:03,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {1565#true} ~cond := #in~cond; {1565#true} is VALID [2020-07-11 02:26:03,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {1565#true} assume !(0 == ~cond); {1565#true} is VALID [2020-07-11 02:26:03,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {1565#true} assume true; {1565#true} is VALID [2020-07-11 02:26:03,296 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1565#true} {1575#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} #123#return; {1575#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} is VALID [2020-07-11 02:26:03,297 INFO L263 TraceCheckUtils]: 0: Hoare triple {1565#true} call ULTIMATE.init(); {1581#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} is VALID [2020-07-11 02:26:03,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {1581#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~SIZE~0 |old(~SIZE~0)|))} #NULL.base, #NULL.offset := 0, 0; {1565#true} is VALID [2020-07-11 02:26:03,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {1565#true} #valid := #valid[0 := 0]; {1565#true} is VALID [2020-07-11 02:26:03,298 INFO L280 TraceCheckUtils]: 3: Hoare triple {1565#true} assume 0 < #StackHeapBarrier; {1565#true} is VALID [2020-07-11 02:26:03,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {1565#true} ~SIZE~0 := 0; {1565#true} is VALID [2020-07-11 02:26:03,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {1565#true} ~MAX~0 := 100000; {1565#true} is VALID [2020-07-11 02:26:03,298 INFO L280 TraceCheckUtils]: 6: Hoare triple {1565#true} assume true; {1565#true} is VALID [2020-07-11 02:26:03,299 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1565#true} {1565#true} #127#return; {1565#true} is VALID [2020-07-11 02:26:03,299 INFO L263 TraceCheckUtils]: 8: Hoare triple {1565#true} call #t~ret9 := main(); {1565#true} is VALID [2020-07-11 02:26:03,299 INFO L280 TraceCheckUtils]: 9: Hoare triple {1565#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1565#true} is VALID [2020-07-11 02:26:03,299 INFO L280 TraceCheckUtils]: 10: Hoare triple {1565#true} ~SIZE~0 := #t~nondet0; {1565#true} is VALID [2020-07-11 02:26:03,300 INFO L280 TraceCheckUtils]: 11: Hoare triple {1565#true} havoc #t~nondet0; {1565#true} is VALID [2020-07-11 02:26:03,303 INFO L280 TraceCheckUtils]: 12: Hoare triple {1565#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,304 INFO L280 TraceCheckUtils]: 13: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} havoc ~i~0; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,306 INFO L280 TraceCheckUtils]: 14: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); srcloc: L20 {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,306 INFO L280 TraceCheckUtils]: 15: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,307 INFO L280 TraceCheckUtils]: 16: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} ~i~0 := 0; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,308 INFO L280 TraceCheckUtils]: 17: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} assume !!(~i~0 < ~SIZE~0); {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,309 INFO L280 TraceCheckUtils]: 18: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,311 INFO L280 TraceCheckUtils]: 19: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} SUMMARY for call write~int(#t~nondet3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L24-1 {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,312 INFO L280 TraceCheckUtils]: 20: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} havoc #t~nondet3; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,313 INFO L280 TraceCheckUtils]: 21: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} #t~post2 := ~i~0; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,314 INFO L280 TraceCheckUtils]: 22: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} ~i~0 := 1 + #t~post2; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,315 INFO L280 TraceCheckUtils]: 23: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} havoc #t~post2; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,316 INFO L280 TraceCheckUtils]: 24: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} assume !!(~i~0 < ~SIZE~0); {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,316 INFO L280 TraceCheckUtils]: 25: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,317 INFO L280 TraceCheckUtils]: 26: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} SUMMARY for call write~int(#t~nondet3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L24-1 {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,318 INFO L280 TraceCheckUtils]: 27: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} havoc #t~nondet3; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,318 INFO L280 TraceCheckUtils]: 28: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} #t~post2 := ~i~0; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,319 INFO L280 TraceCheckUtils]: 29: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} ~i~0 := 1 + #t~post2; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,320 INFO L280 TraceCheckUtils]: 30: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} havoc #t~post2; {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,321 INFO L280 TraceCheckUtils]: 31: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} assume !(~i~0 < ~SIZE~0); {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} is VALID [2020-07-11 02:26:03,322 INFO L280 TraceCheckUtils]: 32: Hoare triple {1574#(or (<= 2 ~SIZE~0) (not (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); {1575#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} is VALID [2020-07-11 02:26:03,323 INFO L263 TraceCheckUtils]: 33: Hoare triple {1575#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} call assume_abort_if_not((if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0)); {1565#true} is VALID [2020-07-11 02:26:03,323 INFO L280 TraceCheckUtils]: 34: Hoare triple {1565#true} ~cond := #in~cond; {1565#true} is VALID [2020-07-11 02:26:03,323 INFO L280 TraceCheckUtils]: 35: Hoare triple {1565#true} assume !(0 == ~cond); {1565#true} is VALID [2020-07-11 02:26:03,324 INFO L280 TraceCheckUtils]: 36: Hoare triple {1565#true} assume true; {1565#true} is VALID [2020-07-11 02:26:03,325 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1565#true} {1575#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} #123#return; {1575#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} is VALID [2020-07-11 02:26:03,327 INFO L280 TraceCheckUtils]: 38: Hoare triple {1575#(and (<= 2 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} ~i~0 := 1; {1580#(and (<= 2 ~SIZE~0) (= 1 main_~i~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} is VALID [2020-07-11 02:26:03,328 INFO L280 TraceCheckUtils]: 39: Hoare triple {1580#(and (<= 2 ~SIZE~0) (= 1 main_~i~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {1566#false} is VALID [2020-07-11 02:26:03,328 INFO L280 TraceCheckUtils]: 40: Hoare triple {1566#false} ~i~0 := 0; {1566#false} is VALID [2020-07-11 02:26:03,329 INFO L280 TraceCheckUtils]: 41: Hoare triple {1566#false} assume !!(~i~0 < ~SIZE~0); {1566#false} is VALID [2020-07-11 02:26:03,329 INFO L280 TraceCheckUtils]: 42: Hoare triple {1566#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L44 {1566#false} is VALID [2020-07-11 02:26:03,329 INFO L263 TraceCheckUtils]: 43: Hoare triple {1566#false} call __VERIFIER_assert((if #t~mem8 <= ~i~0 then 1 else 0)); {1566#false} is VALID [2020-07-11 02:26:03,329 INFO L280 TraceCheckUtils]: 44: Hoare triple {1566#false} ~cond := #in~cond; {1566#false} is VALID [2020-07-11 02:26:03,330 INFO L280 TraceCheckUtils]: 45: Hoare triple {1566#false} assume 0 == ~cond; {1566#false} is VALID [2020-07-11 02:26:03,330 INFO L280 TraceCheckUtils]: 46: Hoare triple {1566#false} assume !false; {1566#false} is VALID [2020-07-11 02:26:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-11 02:26:03,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2046938129] [2020-07-11 02:26:03,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:03,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:26:03,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009518520] [2020-07-11 02:26:03,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-07-11 02:26:03,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:03,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:26:03,390 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-11 02:26:03,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:26:03,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:03,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:26:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:26:03,392 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2020-07-11 02:26:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:04,091 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2020-07-11 02:26:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:26:04,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-07-11 02:26:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:26:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2020-07-11 02:26:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:26:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2020-07-11 02:26:04,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 93 transitions. [2020-07-11 02:26:04,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:04,233 INFO L225 Difference]: With dead ends: 94 [2020-07-11 02:26:04,233 INFO L226 Difference]: Without dead ends: 80 [2020-07-11 02:26:04,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:26:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-11 02:26:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-07-11 02:26:04,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:04,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 68 states. [2020-07-11 02:26:04,405 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 68 states. [2020-07-11 02:26:04,405 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 68 states. [2020-07-11 02:26:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:04,409 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2020-07-11 02:26:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2020-07-11 02:26:04,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:04,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:04,410 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 80 states. [2020-07-11 02:26:04,410 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 80 states. [2020-07-11 02:26:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:04,413 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2020-07-11 02:26:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2020-07-11 02:26:04,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:04,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:04,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:04,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-11 02:26:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-07-11 02:26:04,418 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 47 [2020-07-11 02:26:04,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:04,418 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-07-11 02:26:04,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:26:04,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2020-07-11 02:26:04,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-11 02:26:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 02:26:04,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:04,545 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:26:04,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:26:04,546 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash -153041457, now seen corresponding path program 1 times [2020-07-11 02:26:04,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:04,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658343552] [2020-07-11 02:26:04,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:26:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:26:04,651 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:26:04,652 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:26:04,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:26:04,707 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:26:04,707 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:26:04,708 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:26:04,708 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:26:04,708 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:26:04,708 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:26:04,708 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:04,708 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:04,708 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:04,708 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:26:04,709 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:26:04,709 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-11 02:26:04,709 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-11 02:26:04,709 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-11 02:26:04,709 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:26:04,709 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:26:04,709 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:26:04,709 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:26:04,710 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-11 02:26:04,710 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-11 02:26:04,710 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-11 02:26:04,710 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-11 02:26:04,710 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-11 02:26:04,710 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-11 02:26:04,710 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 02:26:04,710 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:26:04,711 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: L30-6 has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:26:04,712 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-11 02:26:04,713 WARN L170 areAnnotationChecker]: L42-5 has no Hoare annotation [2020-07-11 02:26:04,713 WARN L170 areAnnotationChecker]: L42-5 has no Hoare annotation [2020-07-11 02:26:04,713 WARN L170 areAnnotationChecker]: L42-5 has no Hoare annotation [2020-07-11 02:26:04,713 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-11 02:26:04,713 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-11 02:26:04,713 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:26:04,713 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-11 02:26:04,713 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-11 02:26:04,714 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-11 02:26:04,714 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-11 02:26:04,714 WARN L170 areAnnotationChecker]: L22-6 has no Hoare annotation [2020-07-11 02:26:04,714 WARN L170 areAnnotationChecker]: L22-6 has no Hoare annotation [2020-07-11 02:26:04,714 WARN L170 areAnnotationChecker]: L22-6 has no Hoare annotation [2020-07-11 02:26:04,714 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-11 02:26:04,714 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-11 02:26:04,714 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:26:04,715 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-11 02:26:04,716 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-11 02:26:04,717 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:26:04,717 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2020-07-11 02:26:04,717 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:26:04,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:26:04 BoogieIcfgContainer [2020-07-11 02:26:04,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:26:04,725 INFO L168 Benchmark]: Toolchain (without parser) took 7550.90 ms. Allocated memory was 143.1 MB in the beginning and 286.8 MB in the end (delta: 143.7 MB). Free memory was 100.1 MB in the beginning and 128.3 MB in the end (delta: -28.2 MB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:04,726 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:26:04,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.94 ms. Allocated memory is still 143.1 MB. Free memory was 99.9 MB in the beginning and 88.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:04,727 INFO L168 Benchmark]: Boogie Preprocessor took 229.00 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 88.9 MB in the beginning and 180.4 MB in the end (delta: -91.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:04,728 INFO L168 Benchmark]: RCFGBuilder took 613.31 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 149.3 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:04,729 INFO L168 Benchmark]: TraceAbstraction took 6368.57 ms. Allocated memory was 202.9 MB in the beginning and 286.8 MB in the end (delta: 83.9 MB). Free memory was 148.6 MB in the beginning and 128.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:04,733 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.26 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.94 ms. Allocated memory is still 143.1 MB. Free memory was 99.9 MB in the beginning and 88.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 229.00 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 88.9 MB in the beginning and 180.4 MB in the end (delta: -91.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 613.31 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 149.3 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6368.57 ms. Allocated memory was 202.9 MB in the beginning and 286.8 MB in the end (delta: 83.9 MB). Free memory was 148.6 MB in the beginning and 128.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int SIZE; VAL [\old(MAX)=100003, \old(SIZE)=100002, MAX=100003, SIZE=0] [L12] const int MAX = 100000; VAL [\old(MAX)=100003, \old(SIZE)=100002, MAX=100000, SIZE=0] [L16] SIZE = __VERIFIER_nondet_int() VAL [\old(SIZE)=0, __VERIFIER_nondet_int()=2, MAX=100000, SIZE=2] [L17] COND TRUE SIZE > 1 && SIZE < MAX VAL [\old(SIZE)=0, MAX=100000, SIZE=2] [L19] int i; VAL [\old(SIZE)=0, MAX=100000, SIZE=2] [L20] int *a = malloc(sizeof(int)*SIZE); VAL [\old(SIZE)=0, a={-1:0}, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L22] i = 0 VAL [\old(SIZE)=0, a={-1:0}, i=0, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L22] COND TRUE i < SIZE VAL [\old(SIZE)=0, a={-1:0}, i=0, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L24] a[i] = __VERIFIER_nondet_int() VAL [\old(SIZE)=0, __VERIFIER_nondet_int()=1, a={-1:0}, i=0, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L22] i++ VAL [\old(SIZE)=0, a={-1:0}, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L22] COND TRUE i < SIZE VAL [\old(SIZE)=0, a={-1:0}, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L24] a[i] = __VERIFIER_nondet_int() VAL [\old(SIZE)=0, __VERIFIER_nondet_int()=-4, a={-1:0}, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L22] i++ VAL [\old(SIZE)=0, a={-1:0}, i=2, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L22] COND FALSE !(i < SIZE) VAL [\old(SIZE)=0, a={-1:0}, i=2, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L27] COND FALSE !(SIZE % 2 != 0) VAL [\old(SIZE)=0, a={-1:0}, i=2, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L29] CALL assume_abort_if_not(SIZE % 2 == 0) VAL [\old(cond)=1, \old(SIZE)=0, MAX=100000, SIZE=2] [L4] COND FALSE !(!cond) VAL [\old(cond)=1, \old(SIZE)=0, cond=1, MAX=100000, SIZE=2] [L29] RET assume_abort_if_not(SIZE % 2 == 0) VAL [\old(SIZE)=0, a={-1:0}, i=2, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L30] i = 1 VAL [\old(SIZE)=0, a={-1:0}, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L30] COND TRUE i <= SIZE/2 VAL [\old(SIZE)=0, a={-1:0}, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L32] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={-1:0}, a[2*i-2]=1, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L32] COND FALSE !(a[2*i-2] > i) VAL [\old(SIZE)=0, a={-1:0}, a[2*i-2]=1, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L36] EXPR a[2*i-1] VAL [\old(SIZE)=0, a={-1:0}, a[2*i-1]=-4, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L36] COND FALSE !(a[2*i-1] > i) VAL [\old(SIZE)=0, a={-1:0}, a[2*i-1]=-4, i=1, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L30] i++ VAL [\old(SIZE)=0, a={-1:0}, i=2, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L30] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={-1:0}, i=2, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L42] i = 0 VAL [\old(SIZE)=0, a={-1:0}, i=0, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L42] COND TRUE i < SIZE VAL [\old(SIZE)=0, a={-1:0}, i=0, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L44] EXPR a[i] VAL [\old(SIZE)=0, a={-1:0}, a[i]=1, i=0, malloc(sizeof(int)*SIZE)={-1:0}, MAX=100000, SIZE=2] [L44] CALL __VERIFIER_assert( a[i] <= i ) VAL [\old(cond)=0, \old(SIZE)=0, MAX=100000, SIZE=2] [L6] COND TRUE !(cond) VAL [\old(cond)=0, \old(SIZE)=0, cond=0, MAX=100000, SIZE=2] [L6] __VERIFIER_error() VAL [\old(cond)=0, \old(SIZE)=0, cond=0, MAX=100000, SIZE=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.2s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 207 SDtfs, 306 SDslu, 108 SDs, 0 SdLazy, 430 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 4 MinimizatonAttempts, 31 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 22034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 9/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...