/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-fpi/sina5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:36:16,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:36:16,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:36:16,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:36:16,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:36:16,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:36:16,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:36:16,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:36:16,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:36:16,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:36:16,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:36:16,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:36:16,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:36:16,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:36:16,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:36:16,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:36:16,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:36:16,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:36:16,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:36:16,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:36:16,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:36:16,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:36:16,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:36:16,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:36:16,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:36:16,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:36:16,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:36:16,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:36:16,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:36:16,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:36:16,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:36:16,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:36:16,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:36:16,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:36:16,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:36:16,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:36:16,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:36:16,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:36:16,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:36:16,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:36:16,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:36:16,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:36:16,897 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:36:16,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:36:16,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:36:16,899 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:36:16,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:36:16,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:36:16,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:36:16,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:36:16,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:36:16,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:36:16,900 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:36:16,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:36:16,901 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:36:16,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:36:16,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:36:16,901 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:36:16,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:36:16,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:36:16,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:16,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:36:16,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:36:16,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:36:16,903 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-08 23:36:17,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:36:17,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:36:17,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:36:17,212 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:36:17,212 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:36:17,213 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina5f.c [2020-07-08 23:36:17,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f3459d1/5c851202332b4cdf97419d4400666970/FLAGca6441f09 [2020-07-08 23:36:17,817 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:36:17,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina5f.c [2020-07-08 23:36:17,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f3459d1/5c851202332b4cdf97419d4400666970/FLAGca6441f09 [2020-07-08 23:36:18,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f3459d1/5c851202332b4cdf97419d4400666970 [2020-07-08 23:36:18,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:36:18,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:36:18,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:18,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:36:18,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:36:18,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdff4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18, skipping insertion in model container [2020-07-08 23:36:18,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:36:18,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:36:18,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:18,424 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:36:18,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:18,571 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:36:18,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18 WrapperNode [2020-07-08 23:36:18,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:18,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:36:18,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:36:18,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:36:18,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (1/1) ... [2020-07-08 23:36:18,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:36:18,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:36:18,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:36:18,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:36:18,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (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-08 23:36:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:36:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:36:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:36:18,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:36:18,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:36:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:36:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:36:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:36:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:36:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:36:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:36:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:36:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:36:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:36:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:36:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:36:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:36:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:36:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:36:19,305 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:36:19,306 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-08 23:36:19,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:19 BoogieIcfgContainer [2020-07-08 23:36:19,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:36:19,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:36:19,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:36:19,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:36:19,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:36:18" (1/3) ... [2020-07-08 23:36:19,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b93cd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:19, skipping insertion in model container [2020-07-08 23:36:19,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:18" (2/3) ... [2020-07-08 23:36:19,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b93cd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:19, skipping insertion in model container [2020-07-08 23:36:19,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:19" (3/3) ... [2020-07-08 23:36:19,321 INFO L109 eAbstractionObserver]: Analyzing ICFG sina5f.c [2020-07-08 23:36:19,332 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:36:19,340 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:36:19,352 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:36:19,377 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:36:19,377 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:36:19,378 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:36:19,378 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:36:19,378 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:36:19,378 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:36:19,379 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:36:19,379 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:36:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-08 23:36:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 23:36:19,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:19,413 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, 1] [2020-07-08 23:36:19,413 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:19,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1932017966, now seen corresponding path program 1 times [2020-07-08 23:36:19,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:19,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195311940] [2020-07-08 23:36:19,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:19,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {92#true} is VALID [2020-07-08 23:36:19,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-08 23:36:19,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-08 23:36:19,692 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} ~N~0 := 0; {92#true} is VALID [2020-07-08 23:36:19,692 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-08 23:36:19,693 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {92#true} {92#true} #169#return; {92#true} is VALID [2020-07-08 23:36:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:19,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#true} ~cond := #in~cond; {92#true} is VALID [2020-07-08 23:36:19,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} assume !(0 == ~cond); {92#true} is VALID [2020-07-08 23:36:19,705 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-08 23:36:19,705 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {92#true} {92#true} #165#return; {92#true} is VALID [2020-07-08 23:36:19,708 INFO L263 TraceCheckUtils]: 0: Hoare triple {92#true} call ULTIMATE.init(); {104#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:36:19,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {92#true} is VALID [2020-07-08 23:36:19,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-08 23:36:19,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-08 23:36:19,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} ~N~0 := 0; {92#true} is VALID [2020-07-08 23:36:19,710 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-08 23:36:19,710 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {92#true} {92#true} #169#return; {92#true} is VALID [2020-07-08 23:36:19,710 INFO L263 TraceCheckUtils]: 7: Hoare triple {92#true} call #t~ret16 := main(); {92#true} is VALID [2020-07-08 23:36:19,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {92#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {92#true} is VALID [2020-07-08 23:36:19,711 INFO L280 TraceCheckUtils]: 9: Hoare triple {92#true} ~N~0 := #t~nondet0; {92#true} is VALID [2020-07-08 23:36:19,712 INFO L280 TraceCheckUtils]: 10: Hoare triple {92#true} havoc #t~nondet0; {92#true} is VALID [2020-07-08 23:36:19,712 INFO L280 TraceCheckUtils]: 11: Hoare triple {92#true} assume !(~N~0 <= 0); {92#true} is VALID [2020-07-08 23:36:19,713 INFO L263 TraceCheckUtils]: 12: Hoare triple {92#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {92#true} is VALID [2020-07-08 23:36:19,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {92#true} ~cond := #in~cond; {92#true} is VALID [2020-07-08 23:36:19,713 INFO L280 TraceCheckUtils]: 14: Hoare triple {92#true} assume !(0 == ~cond); {92#true} is VALID [2020-07-08 23:36:19,714 INFO L280 TraceCheckUtils]: 15: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-08 23:36:19,714 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {92#true} {92#true} #165#return; {92#true} is VALID [2020-07-08 23:36:19,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {92#true} havoc ~i~0; {92#true} is VALID [2020-07-08 23:36:19,715 INFO L280 TraceCheckUtils]: 18: Hoare triple {92#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {92#true} is VALID [2020-07-08 23:36:19,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {92#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {92#true} is VALID [2020-07-08 23:36:19,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {92#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {92#true} is VALID [2020-07-08 23:36:19,716 INFO L280 TraceCheckUtils]: 21: Hoare triple {92#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L28 {92#true} is VALID [2020-07-08 23:36:19,716 INFO L280 TraceCheckUtils]: 22: Hoare triple {92#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {92#true} is VALID [2020-07-08 23:36:19,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {92#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {92#true} is VALID [2020-07-08 23:36:19,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {92#true} ~i~0 := 0; {92#true} is VALID [2020-07-08 23:36:19,719 INFO L280 TraceCheckUtils]: 25: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-08 23:36:19,719 INFO L280 TraceCheckUtils]: 26: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-08 23:36:19,720 INFO L280 TraceCheckUtils]: 27: Hoare triple {93#false} assume !(~i~0 < ~N~0); {93#false} is VALID [2020-07-08 23:36:19,720 INFO L280 TraceCheckUtils]: 28: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-08 23:36:19,720 INFO L280 TraceCheckUtils]: 29: Hoare triple {93#false} assume !(~i~0 < ~N~0); {93#false} is VALID [2020-07-08 23:36:19,721 INFO L280 TraceCheckUtils]: 30: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-08 23:36:19,721 INFO L280 TraceCheckUtils]: 31: Hoare triple {93#false} assume !true; {93#false} is VALID [2020-07-08 23:36:19,721 INFO L280 TraceCheckUtils]: 32: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-08 23:36:19,722 INFO L280 TraceCheckUtils]: 33: Hoare triple {93#false} assume !true; {93#false} is VALID [2020-07-08 23:36:19,722 INFO L280 TraceCheckUtils]: 34: Hoare triple {93#false} ~i~0 := 0; {93#false} is VALID [2020-07-08 23:36:19,722 INFO L280 TraceCheckUtils]: 35: Hoare triple {93#false} assume !!(~i~0 < ~N~0); {93#false} is VALID [2020-07-08 23:36:19,723 INFO L280 TraceCheckUtils]: 36: Hoare triple {93#false} SUMMARY for call #t~mem15 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L58 {93#false} is VALID [2020-07-08 23:36:19,723 INFO L263 TraceCheckUtils]: 37: Hoare triple {93#false} call __VERIFIER_assert((if #t~mem15 == 2 * ~N~0 then 1 else 0)); {93#false} is VALID [2020-07-08 23:36:19,723 INFO L280 TraceCheckUtils]: 38: Hoare triple {93#false} ~cond := #in~cond; {93#false} is VALID [2020-07-08 23:36:19,724 INFO L280 TraceCheckUtils]: 39: Hoare triple {93#false} assume 0 == ~cond; {93#false} is VALID [2020-07-08 23:36:19,724 INFO L280 TraceCheckUtils]: 40: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-08 23:36:19,731 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-08 23:36:19,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195311940] [2020-07-08 23:36:19,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:19,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:36:19,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755571166] [2020-07-08 23:36:19,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-07-08 23:36:19,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:19,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:36:19,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:19,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:36:19,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:36:19,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:36:19,840 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2020-07-08 23:36:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:20,419 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2020-07-08 23:36:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:36:20,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-07-08 23:36:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-08 23:36:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-08 23:36:20,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2020-07-08 23:36:20,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:20,702 INFO L225 Difference]: With dead ends: 161 [2020-07-08 23:36:20,702 INFO L226 Difference]: Without dead ends: 80 [2020-07-08 23:36:20,707 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-08 23:36:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-08 23:36:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-08 23:36:20,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:20,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2020-07-08 23:36:20,821 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-08 23:36:20,822 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-08 23:36:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:20,829 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-08 23:36:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-08 23:36:20,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:20,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:20,831 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-08 23:36:20,831 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-08 23:36:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:20,839 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-08 23:36:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-08 23:36:20,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:20,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:20,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:20,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-08 23:36:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2020-07-08 23:36:20,848 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 41 [2020-07-08 23:36:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:20,849 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2020-07-08 23:36:20,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:36:20,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 85 transitions. [2020-07-08 23:36:20,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-08 23:36:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 23:36:20,973 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:20,973 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, 1] [2020-07-08 23:36:20,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:36:20,974 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:20,975 INFO L82 PathProgramCache]: Analyzing trace with hash -690131343, now seen corresponding path program 1 times [2020-07-08 23:36:20,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:20,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074286661] [2020-07-08 23:36:20,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:21,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {763#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {749#true} is VALID [2020-07-08 23:36:21,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {749#true} #valid := #valid[0 := 0]; {749#true} is VALID [2020-07-08 23:36:21,151 INFO L280 TraceCheckUtils]: 2: Hoare triple {749#true} assume 0 < #StackHeapBarrier; {749#true} is VALID [2020-07-08 23:36:21,151 INFO L280 TraceCheckUtils]: 3: Hoare triple {749#true} ~N~0 := 0; {749#true} is VALID [2020-07-08 23:36:21,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-08 23:36:21,152 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {749#true} {749#true} #169#return; {749#true} is VALID [2020-07-08 23:36:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:21,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {749#true} ~cond := #in~cond; {749#true} is VALID [2020-07-08 23:36:21,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {749#true} assume !(0 == ~cond); {749#true} is VALID [2020-07-08 23:36:21,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-08 23:36:21,163 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {749#true} {757#(<= 1 ~N~0)} #165#return; {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,164 INFO L263 TraceCheckUtils]: 0: Hoare triple {749#true} call ULTIMATE.init(); {763#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:36:21,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {763#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {749#true} is VALID [2020-07-08 23:36:21,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {749#true} #valid := #valid[0 := 0]; {749#true} is VALID [2020-07-08 23:36:21,165 INFO L280 TraceCheckUtils]: 3: Hoare triple {749#true} assume 0 < #StackHeapBarrier; {749#true} is VALID [2020-07-08 23:36:21,166 INFO L280 TraceCheckUtils]: 4: Hoare triple {749#true} ~N~0 := 0; {749#true} is VALID [2020-07-08 23:36:21,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-08 23:36:21,166 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {749#true} {749#true} #169#return; {749#true} is VALID [2020-07-08 23:36:21,177 INFO L263 TraceCheckUtils]: 7: Hoare triple {749#true} call #t~ret16 := main(); {749#true} is VALID [2020-07-08 23:36:21,178 INFO L280 TraceCheckUtils]: 8: Hoare triple {749#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {749#true} is VALID [2020-07-08 23:36:21,179 INFO L280 TraceCheckUtils]: 9: Hoare triple {749#true} ~N~0 := #t~nondet0; {749#true} is VALID [2020-07-08 23:36:21,179 INFO L280 TraceCheckUtils]: 10: Hoare triple {749#true} havoc #t~nondet0; {749#true} is VALID [2020-07-08 23:36:21,181 INFO L280 TraceCheckUtils]: 11: Hoare triple {749#true} assume !(~N~0 <= 0); {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,181 INFO L263 TraceCheckUtils]: 12: Hoare triple {757#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {749#true} is VALID [2020-07-08 23:36:21,181 INFO L280 TraceCheckUtils]: 13: Hoare triple {749#true} ~cond := #in~cond; {749#true} is VALID [2020-07-08 23:36:21,182 INFO L280 TraceCheckUtils]: 14: Hoare triple {749#true} assume !(0 == ~cond); {749#true} is VALID [2020-07-08 23:36:21,182 INFO L280 TraceCheckUtils]: 15: Hoare triple {749#true} assume true; {749#true} is VALID [2020-07-08 23:36:21,183 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {749#true} {757#(<= 1 ~N~0)} #165#return; {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,184 INFO L280 TraceCheckUtils]: 17: Hoare triple {757#(<= 1 ~N~0)} havoc ~i~0; {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,184 INFO L280 TraceCheckUtils]: 18: Hoare triple {757#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,185 INFO L280 TraceCheckUtils]: 19: Hoare triple {757#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,186 INFO L280 TraceCheckUtils]: 20: Hoare triple {757#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,186 INFO L280 TraceCheckUtils]: 21: Hoare triple {757#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L28 {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,187 INFO L280 TraceCheckUtils]: 22: Hoare triple {757#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,188 INFO L280 TraceCheckUtils]: 23: Hoare triple {757#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {757#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:21,189 INFO L280 TraceCheckUtils]: 24: Hoare triple {757#(<= 1 ~N~0)} ~i~0 := 0; {762#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:21,190 INFO L280 TraceCheckUtils]: 25: Hoare triple {762#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-08 23:36:21,190 INFO L280 TraceCheckUtils]: 26: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-08 23:36:21,191 INFO L280 TraceCheckUtils]: 27: Hoare triple {750#false} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-08 23:36:21,191 INFO L280 TraceCheckUtils]: 28: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-08 23:36:21,191 INFO L280 TraceCheckUtils]: 29: Hoare triple {750#false} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-08 23:36:21,192 INFO L280 TraceCheckUtils]: 30: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-08 23:36:21,192 INFO L280 TraceCheckUtils]: 31: Hoare triple {750#false} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-08 23:36:21,192 INFO L280 TraceCheckUtils]: 32: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-08 23:36:21,193 INFO L280 TraceCheckUtils]: 33: Hoare triple {750#false} assume !(~i~0 < ~N~0); {750#false} is VALID [2020-07-08 23:36:21,193 INFO L280 TraceCheckUtils]: 34: Hoare triple {750#false} ~i~0 := 0; {750#false} is VALID [2020-07-08 23:36:21,193 INFO L280 TraceCheckUtils]: 35: Hoare triple {750#false} assume !!(~i~0 < ~N~0); {750#false} is VALID [2020-07-08 23:36:21,193 INFO L280 TraceCheckUtils]: 36: Hoare triple {750#false} SUMMARY for call #t~mem15 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L58 {750#false} is VALID [2020-07-08 23:36:21,194 INFO L263 TraceCheckUtils]: 37: Hoare triple {750#false} call __VERIFIER_assert((if #t~mem15 == 2 * ~N~0 then 1 else 0)); {750#false} is VALID [2020-07-08 23:36:21,194 INFO L280 TraceCheckUtils]: 38: Hoare triple {750#false} ~cond := #in~cond; {750#false} is VALID [2020-07-08 23:36:21,194 INFO L280 TraceCheckUtils]: 39: Hoare triple {750#false} assume 0 == ~cond; {750#false} is VALID [2020-07-08 23:36:21,195 INFO L280 TraceCheckUtils]: 40: Hoare triple {750#false} assume !false; {750#false} is VALID [2020-07-08 23:36:21,198 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-08 23:36:21,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074286661] [2020-07-08 23:36:21,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:21,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:36:21,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427141248] [2020-07-08 23:36:21,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-08 23:36:21,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:21,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:36:21,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:21,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:36:21,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:21,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:36:21,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:36:21,249 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2020-07-08 23:36:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:21,950 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2020-07-08 23:36:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:36:21,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-08 23:36:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2020-07-08 23:36:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2020-07-08 23:36:21,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 183 transitions. [2020-07-08 23:36:22,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:22,181 INFO L225 Difference]: With dead ends: 168 [2020-07-08 23:36:22,182 INFO L226 Difference]: Without dead ends: 118 [2020-07-08 23:36:22,183 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-08 23:36:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-08 23:36:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2020-07-08 23:36:22,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:22,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 85 states. [2020-07-08 23:36:22,348 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 85 states. [2020-07-08 23:36:22,348 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 85 states. [2020-07-08 23:36:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:22,355 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2020-07-08 23:36:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2020-07-08 23:36:22,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:22,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:22,357 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 118 states. [2020-07-08 23:36:22,357 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 118 states. [2020-07-08 23:36:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:22,364 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2020-07-08 23:36:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2020-07-08 23:36:22,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:22,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:22,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:22,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-08 23:36:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2020-07-08 23:36:22,370 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 41 [2020-07-08 23:36:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:22,370 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2020-07-08 23:36:22,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:36:22,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 90 transitions. [2020-07-08 23:36:22,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2020-07-08 23:36:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-08 23:36:22,483 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:22,483 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, 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-08 23:36:22,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:36:22,484 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1472096967, now seen corresponding path program 1 times [2020-07-08 23:36:22,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:22,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79388370] [2020-07-08 23:36:22,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:36:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:36:22,658 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:36:22,658 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:36:22,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:36:22,761 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:36:22,761 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:22,762 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:22,762 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:36:22,762 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:36:22,762 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:36:22,762 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:22,762 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:22,762 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:22,762 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:22,763 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:22,763 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:36:22,763 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:22,763 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:22,763 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:36:22,765 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:36:22,765 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:36:22,765 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:36:22,765 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:36:22,766 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:22,766 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:22,766 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:36:22,766 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:36:22,766 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:36:22,766 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:22,767 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:22,767 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:36:22,767 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:36:22,767 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:36:22,767 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:36:22,767 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:22,768 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:22,768 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-08 23:36:22,768 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:36:22,768 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:36:22,768 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:36:22,768 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-08 23:36:22,769 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:36:22,769 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:36:22,769 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-08 23:36:22,769 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:36:22,769 WARN L170 areAnnotationChecker]: L56-4 has no Hoare annotation [2020-07-08 23:36:22,769 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 23:36:22,770 WARN L170 areAnnotationChecker]: L56-5 has no Hoare annotation [2020-07-08 23:36:22,770 WARN L170 areAnnotationChecker]: L56-5 has no Hoare annotation [2020-07-08 23:36:22,770 WARN L170 areAnnotationChecker]: L56-5 has no Hoare annotation [2020-07-08 23:36:22,770 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-08 23:36:22,770 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-08 23:36:22,770 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-08 23:36:22,771 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 23:36:22,771 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:36:22,771 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-08 23:36:22,771 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-08 23:36:22,771 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-08 23:36:22,771 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:36:22,771 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-08 23:36:22,772 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-08 23:36:22,772 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-08 23:36:22,772 WARN L170 areAnnotationChecker]: L31-5 has no Hoare annotation [2020-07-08 23:36:22,772 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 23:36:22,772 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-08 23:36:22,772 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-08 23:36:22,772 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-08 23:36:22,772 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-08 23:36:22,773 WARN L170 areAnnotationChecker]: L36-5 has no Hoare annotation [2020-07-08 23:36:22,773 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 23:36:22,773 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-08 23:36:22,773 WARN L170 areAnnotationChecker]: L41-5 has no Hoare annotation [2020-07-08 23:36:22,773 WARN L170 areAnnotationChecker]: L41-5 has no Hoare annotation [2020-07-08 23:36:22,773 WARN L170 areAnnotationChecker]: L41-5 has no Hoare annotation [2020-07-08 23:36:22,773 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 23:36:22,774 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-08 23:36:22,774 WARN L170 areAnnotationChecker]: L41-6 has no Hoare annotation [2020-07-08 23:36:22,774 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 23:36:22,774 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-08 23:36:22,774 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-08 23:36:22,775 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-08 23:36:22,775 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-08 23:36:22,775 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-08 23:36:22,775 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-08 23:36:22,775 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2020-07-08 23:36:22,776 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-08 23:36:22,776 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-08 23:36:22,776 WARN L170 areAnnotationChecker]: L51-5 has no Hoare annotation [2020-07-08 23:36:22,776 WARN L170 areAnnotationChecker]: L51-5 has no Hoare annotation [2020-07-08 23:36:22,776 WARN L170 areAnnotationChecker]: L51-5 has no Hoare annotation [2020-07-08 23:36:22,777 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-08 23:36:22,777 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-08 23:36:22,777 WARN L170 areAnnotationChecker]: L51-6 has no Hoare annotation [2020-07-08 23:36:22,777 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-08 23:36:22,777 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-08 23:36:22,777 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-08 23:36:22,778 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-08 23:36:22,778 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-08 23:36:22,778 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-08 23:36:22,778 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2020-07-08 23:36:22,779 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2020-07-08 23:36:22,779 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-08 23:36:22,779 WARN L170 areAnnotationChecker]: L53-3 has no Hoare annotation [2020-07-08 23:36:22,779 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-08 23:36:22,782 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-08 23:36:22,782 WARN L170 areAnnotationChecker]: L53-4 has no Hoare annotation [2020-07-08 23:36:22,783 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-08 23:36:22,783 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-08 23:36:22,783 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-08 23:36:22,783 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-08 23:36:22,786 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-08 23:36:22,787 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-08 23:36:22,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:36:22 BoogieIcfgContainer [2020-07-08 23:36:22,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:36:22,796 INFO L168 Benchmark]: Toolchain (without parser) took 4630.62 ms. Allocated memory was 143.7 MB in the beginning and 250.6 MB in the end (delta: 107.0 MB). Free memory was 102.5 MB in the beginning and 127.4 MB in the end (delta: -25.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:22,797 INFO L168 Benchmark]: CDTParser took 0.99 ms. Allocated memory is still 143.7 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 23:36:22,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.88 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 180.0 MB in the end (delta: -77.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:22,799 INFO L168 Benchmark]: Boogie Preprocessor took 66.49 ms. Allocated memory is still 201.3 MB. Free memory was 180.0 MB in the beginning and 177.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:22,800 INFO L168 Benchmark]: RCFGBuilder took 671.45 ms. Allocated memory is still 201.3 MB. Free memory was 177.5 MB in the beginning and 139.6 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:22,801 INFO L168 Benchmark]: TraceAbstraction took 3477.58 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 139.6 MB in the beginning and 127.4 MB in the end (delta: 12.2 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:22,805 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.99 ms. Allocated memory is still 143.7 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 405.88 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 180.0 MB in the end (delta: -77.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.49 ms. Allocated memory is still 201.3 MB. Free memory was 180.0 MB in the beginning and 177.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 671.45 ms. Allocated memory is still 201.3 MB. Free memory was 177.5 MB in the beginning and 139.6 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3477.58 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 139.6 MB in the beginning and 127.4 MB in the end (delta: 12.2 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=1, N=1] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; VAL [\old(N)=0, N=1] [L26] long long sum[1]; VAL [\old(N)=0, N=1, sum={6:0}] [L27] long long *a = malloc(sizeof(long long)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(long long)*N)={-1:0}, N=1, sum={6:0}] [L28] long long *b = malloc(sizeof(long long)*N); VAL [\old(N)=0, a={-1:0}, b={4:0}, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={4:0}, N=1, sum={6:0}] [L30] sum[0] = 0 VAL [\old(N)=0, a={-1:0}, b={4:0}, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={4:0}, N=1, sum={6:0}] [L31] i=0 VAL [\old(N)=0, a={-1:0}, b={4:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={4:0}, N=1, sum={6:0}] [L31] COND TRUE i