/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/res2of.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:44:58,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:44:58,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:44:58,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:44:58,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:44:58,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:44:58,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:44:58,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:44:58,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:44:58,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:44:58,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:44:58,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:44:58,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:44:58,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:44:58,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:44:58,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:44:58,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:44:58,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:44:58,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:44:58,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:44:58,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:44:58,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:44:58,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:44:58,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:44:58,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:44:58,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:44:58,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:44:58,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:44:58,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:44:58,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:44:58,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:44:58,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:44:58,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:44:58,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:44:58,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:44:58,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:44:58,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:44:58,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:44:58,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:44:58,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:44:58,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:44:58,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:44:58,399 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:44:58,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:44:58,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:44:58,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:44:58,401 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:44:58,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:44:58,402 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:44:58,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:44:58,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:44:58,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:44:58,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:44:58,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:44:58,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:44:58,403 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:44:58,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:44:58,403 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:44:58,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:44:58,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:44:58,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:44:58,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:44:58,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:44:58,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:58,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:44:58,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:44:58,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:44:58,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:44:58,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:44:58,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:44:58,406 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:44:58,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:44:58,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:44:58,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:44:58,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:44:58,724 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:44:58,725 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:44:58,726 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res2of.c [2020-07-08 12:44:58,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58c4d810/e41d8e1b6ef6481d8c48cbc000f1be5e/FLAGf341f5046 [2020-07-08 12:44:59,236 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:44:59,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res2of.c [2020-07-08 12:44:59,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58c4d810/e41d8e1b6ef6481d8c48cbc000f1be5e/FLAGf341f5046 [2020-07-08 12:44:59,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58c4d810/e41d8e1b6ef6481d8c48cbc000f1be5e [2020-07-08 12:44:59,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:44:59,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:44:59,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:59,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:44:59,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:44:59,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:59" (1/1) ... [2020-07-08 12:44:59,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6902f5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:59, skipping insertion in model container [2020-07-08 12:44:59,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:59" (1/1) ... [2020-07-08 12:44:59,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:44:59,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:44:59,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:59,898 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:44:59,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:00,034 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:00,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00 WrapperNode [2020-07-08 12:45:00,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:00,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:00,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:00,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:00,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (1/1) ... [2020-07-08 12:45:00,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (1/1) ... [2020-07-08 12:45:00,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (1/1) ... [2020-07-08 12:45:00,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (1/1) ... [2020-07-08 12:45:00,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (1/1) ... [2020-07-08 12:45:00,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (1/1) ... [2020-07-08 12:45:00,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (1/1) ... [2020-07-08 12:45:00,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:00,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:00,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:00,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:00,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (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 12:45:00,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:00,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:00,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:45:00,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:00,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:45:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:45:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:45:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:45:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:45:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:45:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:45:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:45:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:45:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:00,713 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:00,713 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-08 12:45:00,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:00 BoogieIcfgContainer [2020-07-08 12:45:00,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:00,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:00,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:00,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:00,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:44:59" (1/3) ... [2020-07-08 12:45:00,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408cde38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:00, skipping insertion in model container [2020-07-08 12:45:00,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:00" (2/3) ... [2020-07-08 12:45:00,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408cde38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:00, skipping insertion in model container [2020-07-08 12:45:00,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:00" (3/3) ... [2020-07-08 12:45:00,727 INFO L109 eAbstractionObserver]: Analyzing ICFG res2of.c [2020-07-08 12:45:00,737 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:00,746 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:00,760 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:00,785 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:00,785 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:00,785 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:00,785 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:00,786 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:00,786 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:00,786 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:00,786 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-08 12:45:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:45:00,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:00,815 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] [2020-07-08 12:45:00,815 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1797528887, now seen corresponding path program 1 times [2020-07-08 12:45:00,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:00,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256794640] [2020-07-08 12:45:00,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:01,059 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {46#true} is VALID [2020-07-08 12:45:01,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-08 12:45:01,060 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-08 12:45:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:01,070 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-08 12:45:01,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-08 12:45:01,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-08 12:45:01,072 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-08 12:45:01,074 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {55#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:01,075 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {46#true} is VALID [2020-07-08 12:45:01,076 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-08 12:45:01,076 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-08 12:45:01,076 INFO L263 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret17 := main(); {46#true} is VALID [2020-07-08 12:45:01,077 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {46#true} is VALID [2020-07-08 12:45:01,077 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} assume !(~N~0 <= 0); {46#true} is VALID [2020-07-08 12:45:01,078 INFO L263 TraceCheckUtils]: 7: Hoare triple {46#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {46#true} is VALID [2020-07-08 12:45:01,078 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-08 12:45:01,079 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-08 12:45:01,080 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-08 12:45:01,080 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-08 12:45:01,081 INFO L280 TraceCheckUtils]: 12: Hoare triple {47#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {47#false} is VALID [2020-07-08 12:45:01,081 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-08 12:45:01,081 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:45:01,082 INFO L280 TraceCheckUtils]: 15: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-08 12:45:01,082 INFO L280 TraceCheckUtils]: 16: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:45:01,083 INFO L280 TraceCheckUtils]: 17: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-08 12:45:01,083 INFO L280 TraceCheckUtils]: 18: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:45:01,083 INFO L280 TraceCheckUtils]: 19: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-08 12:45:01,084 INFO L280 TraceCheckUtils]: 20: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:45:01,084 INFO L280 TraceCheckUtils]: 21: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-08 12:45:01,085 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:45:01,085 INFO L280 TraceCheckUtils]: 23: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-08 12:45:01,085 INFO L280 TraceCheckUtils]: 24: Hoare triple {47#false} call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {47#false} is VALID [2020-07-08 12:45:01,086 INFO L263 TraceCheckUtils]: 25: Hoare triple {47#false} call __VERIFIER_assert((if #t~mem16 <= 2 * ~N~0 then 1 else 0)); {47#false} is VALID [2020-07-08 12:45:01,086 INFO L280 TraceCheckUtils]: 26: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2020-07-08 12:45:01,087 INFO L280 TraceCheckUtils]: 27: Hoare triple {47#false} assume 0 == ~cond; {47#false} is VALID [2020-07-08 12:45:01,087 INFO L280 TraceCheckUtils]: 28: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-08 12:45:01,092 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 12:45:01,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256794640] [2020-07-08 12:45:01,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:01,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:01,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413201] [2020-07-08 12:45:01,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:45:01,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:01,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:01,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:01,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:01,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:01,175 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-08 12:45:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:01,465 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2020-07-08 12:45:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:01,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:45:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-08 12:45:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-08 12:45:01,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-08 12:45:01,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:01,660 INFO L225 Difference]: With dead ends: 76 [2020-07-08 12:45:01,660 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 12:45:01,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 12:45:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 12:45:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-08 12:45:01,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:01,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:01,715 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:01,715 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:01,720 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-08 12:45:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:45:01,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:01,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:01,721 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:01,721 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:01,726 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-08 12:45:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:45:01,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:01,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:01,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:01,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:45:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-08 12:45:01,732 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2020-07-08 12:45:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:01,733 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-08 12:45:01,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:45:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:45:01,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:01,735 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] [2020-07-08 12:45:01,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:01,735 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash 120259143, now seen corresponding path program 1 times [2020-07-08 12:45:01,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:01,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791270166] [2020-07-08 12:45:01,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:01,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {289#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {278#true} is VALID [2020-07-08 12:45:01,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-08 12:45:01,914 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #123#return; {278#true} is VALID [2020-07-08 12:45:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:01,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#true} ~cond := #in~cond; {278#true} is VALID [2020-07-08 12:45:01,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume !(0 == ~cond); {278#true} is VALID [2020-07-08 12:45:01,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-08 12:45:01,930 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {278#true} {283#(<= 1 ~N~0)} #119#return; {283#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:01,932 INFO L263 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:01,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {289#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {278#true} is VALID [2020-07-08 12:45:01,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-08 12:45:01,933 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #123#return; {278#true} is VALID [2020-07-08 12:45:01,934 INFO L263 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret17 := main(); {278#true} is VALID [2020-07-08 12:45:01,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {278#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {278#true} is VALID [2020-07-08 12:45:01,935 INFO L280 TraceCheckUtils]: 6: Hoare triple {278#true} assume !(~N~0 <= 0); {283#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:01,935 INFO L263 TraceCheckUtils]: 7: Hoare triple {283#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {278#true} is VALID [2020-07-08 12:45:01,935 INFO L280 TraceCheckUtils]: 8: Hoare triple {278#true} ~cond := #in~cond; {278#true} is VALID [2020-07-08 12:45:01,936 INFO L280 TraceCheckUtils]: 9: Hoare triple {278#true} assume !(0 == ~cond); {278#true} is VALID [2020-07-08 12:45:01,936 INFO L280 TraceCheckUtils]: 10: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-08 12:45:01,941 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {278#true} {283#(<= 1 ~N~0)} #119#return; {283#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:01,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {283#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {288#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 12:45:01,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {288#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:01,944 INFO L280 TraceCheckUtils]: 14: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:01,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:01,945 INFO L280 TraceCheckUtils]: 16: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:01,945 INFO L280 TraceCheckUtils]: 17: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:01,945 INFO L280 TraceCheckUtils]: 18: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:01,946 INFO L280 TraceCheckUtils]: 19: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:01,946 INFO L280 TraceCheckUtils]: 20: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:01,946 INFO L280 TraceCheckUtils]: 21: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:01,947 INFO L280 TraceCheckUtils]: 22: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:01,947 INFO L280 TraceCheckUtils]: 23: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:01,947 INFO L280 TraceCheckUtils]: 24: Hoare triple {279#false} call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {279#false} is VALID [2020-07-08 12:45:01,947 INFO L263 TraceCheckUtils]: 25: Hoare triple {279#false} call __VERIFIER_assert((if #t~mem16 <= 2 * ~N~0 then 1 else 0)); {279#false} is VALID [2020-07-08 12:45:01,948 INFO L280 TraceCheckUtils]: 26: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2020-07-08 12:45:01,948 INFO L280 TraceCheckUtils]: 27: Hoare triple {279#false} assume 0 == ~cond; {279#false} is VALID [2020-07-08 12:45:01,948 INFO L280 TraceCheckUtils]: 28: Hoare triple {279#false} assume !false; {279#false} is VALID [2020-07-08 12:45:01,950 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 12:45:01,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791270166] [2020-07-08 12:45:01,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:01,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:45:01,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61655311] [2020-07-08 12:45:01,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-08 12:45:01,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:01,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:01,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:01,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:01,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:01,989 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2020-07-08 12:45:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:02,360 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2020-07-08 12:45:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:45:02,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-08 12:45:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2020-07-08 12:45:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2020-07-08 12:45:02,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2020-07-08 12:45:02,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:02,492 INFO L225 Difference]: With dead ends: 69 [2020-07-08 12:45:02,493 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 12:45:02,494 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 12:45:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 12:45:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-07-08 12:45:02,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:02,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2020-07-08 12:45:02,545 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2020-07-08 12:45:02,545 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2020-07-08 12:45:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:02,550 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-08 12:45:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-08 12:45:02,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:02,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:02,551 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2020-07-08 12:45:02,552 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2020-07-08 12:45:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:02,559 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-08 12:45:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-08 12:45:02,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:02,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:02,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:02,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 12:45:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-07-08 12:45:02,567 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2020-07-08 12:45:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:02,567 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-07-08 12:45:02,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-08 12:45:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 12:45:02,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:02,573 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 12:45:02,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:45:02,576 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -774790125, now seen corresponding path program 1 times [2020-07-08 12:45:02,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:02,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584222497] [2020-07-08 12:45:02,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:02,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:45:02,789 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:45:02,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:45:02,855 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:45:02,855 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:02,855 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:02,855 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:45:02,855 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:45:02,855 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:45:02,856 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:02,856 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:02,856 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:02,856 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:02,856 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:02,856 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:02,856 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:02,856 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:02,857 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:02,857 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:45:02,858 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:02,858 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:45:02,858 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:45:02,858 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:02,858 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:02,858 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:02,859 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:02,859 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:45:02,859 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:45:02,859 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:45:02,859 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:45:02,859 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:02,859 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-08 12:45:02,859 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-08 12:45:02,860 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-08 12:45:02,860 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-08 12:45:02,860 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-08 12:45:02,860 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-08 12:45:02,860 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 12:45:02,860 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 12:45:02,860 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 12:45:02,861 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 12:45:02,862 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 12:45:02,863 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-08 12:45:02,863 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-08 12:45:02,863 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-08 12:45:02,863 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-08 12:45:02,863 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-08 12:45:02,863 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-08 12:45:02,863 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-08 12:45:02,864 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-08 12:45:02,864 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-08 12:45:02,864 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-08 12:45:02,864 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-08 12:45:02,864 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-08 12:45:02,864 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 12:45:02,864 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 12:45:02,864 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 12:45:02,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:45:02 BoogieIcfgContainer [2020-07-08 12:45:02,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:45:02,870 INFO L168 Benchmark]: Toolchain (without parser) took 3207.21 ms. Allocated memory was 145.2 MB in the beginning and 247.5 MB in the end (delta: 102.2 MB). Free memory was 103.2 MB in the beginning and 199.4 MB in the end (delta: -96.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:02,871 INFO L168 Benchmark]: CDTParser took 1.15 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:45:02,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.03 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 103.0 MB in the beginning and 180.3 MB in the end (delta: -77.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:02,873 INFO L168 Benchmark]: Boogie Preprocessor took 48.19 ms. Allocated memory is still 201.3 MB. Free memory was 180.3 MB in the beginning and 177.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:02,874 INFO L168 Benchmark]: RCFGBuilder took 634.25 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 144.6 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:02,875 INFO L168 Benchmark]: TraceAbstraction took 2148.22 ms. Allocated memory was 201.3 MB in the beginning and 247.5 MB in the end (delta: 46.1 MB). Free memory was 143.9 MB in the beginning and 199.4 MB in the end (delta: -55.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:45:02,878 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 1.15 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 369.03 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 103.0 MB in the beginning and 180.3 MB in the end (delta: -77.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.19 ms. Allocated memory is still 201.3 MB. Free memory was 180.3 MB in the beginning and 177.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 634.25 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 144.6 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2148.22 ms. Allocated memory was 201.3 MB in the beginning and 247.5 MB in the end (delta: 46.1 MB). Free memory was 143.9 MB in the beginning and 199.4 MB in the end (delta: -55.4 MB). There was no memory consumed. 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() [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; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L28] int *b = malloc(sizeof(int)*N); [L29] int *c = malloc(sizeof(int)*N); [L31] sum[0] = 0 [L32] i=0 VAL [\old(N)=0, a={-1:0}, b={5:0}, c={-2:0}, i=0, malloc(sizeof(int)*N)={-2:0}, malloc(sizeof(int)*N)={-1:0}, malloc(sizeof(int)*N)={5:0}, N=1, sum={7:0}] [L32] COND TRUE i