/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-8fc6572 [2020-07-10 15:26:42,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:42,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:42,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:42,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:42,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:42,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:42,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:42,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:42,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:42,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:42,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:42,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:42,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:42,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:42,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:42,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:42,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:42,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:42,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:42,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:42,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:42,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:42,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:42,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:42,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:42,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:42,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:42,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:42,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:42,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:42,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:42,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:42,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:42,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:42,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:42,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:42,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:42,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:42,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:42,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:42,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:42,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:42,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:42,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:42,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:42,610 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:42,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:42,611 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:42,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:42,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:42,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:42,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:42,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:42,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:42,613 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:42,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:42,614 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:42,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:42,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:42,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:42,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:42,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:42,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:42,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:42,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:42,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:42,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:42,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:42,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:42,617 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:42,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:42,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:42,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:42,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:42,994 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:42,994 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:42,995 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-10 15:26:43,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dee36d0/928993f5a88d44c78694f481285386bb/FLAGda3ad559b [2020-07-10 15:26:43,717 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:43,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res2of.c [2020-07-10 15:26:43,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dee36d0/928993f5a88d44c78694f481285386bb/FLAGda3ad559b [2020-07-10 15:26:44,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dee36d0/928993f5a88d44c78694f481285386bb [2020-07-10 15:26:44,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:44,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:44,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:44,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:44,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:44,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9d0c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44, skipping insertion in model container [2020-07-10 15:26:44,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:44,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:44,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:44,435 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:44,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:44,530 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:44,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44 WrapperNode [2020-07-10 15:26:44,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:44,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:44,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:44,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:44,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (1/1) ... [2020-07-10 15:26:44,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:44,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:44,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:44,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:44,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:44,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:44,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:44,934 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:44,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:44,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:45,599 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:45,599 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-10 15:26:45,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:45 BoogieIcfgContainer [2020-07-10 15:26:45,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:45,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:45,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:45,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:45,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:44" (1/3) ... [2020-07-10 15:26:45,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da5cf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:45, skipping insertion in model container [2020-07-10 15:26:45,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:44" (2/3) ... [2020-07-10 15:26:45,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da5cf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:45, skipping insertion in model container [2020-07-10 15:26:45,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:45" (3/3) ... [2020-07-10 15:26:45,620 INFO L109 eAbstractionObserver]: Analyzing ICFG res2of.c [2020-07-10 15:26:45,636 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:45,647 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:45,665 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:45,697 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:45,698 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:45,698 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:45,698 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:45,699 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:45,699 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:45,699 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:45,699 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-10 15:26:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:26:45,744 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:45,745 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-10 15:26:45,746 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1797528887, now seen corresponding path program 1 times [2020-07-10 15:26:45,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:45,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7171161] [2020-07-10 15:26:45,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:46,095 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-10 15:26:46,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-10 15:26:46,096 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-10 15:26:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:46,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-10 15:26:46,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-10 15:26:46,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-10 15:26:46,136 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-10 15:26:46,142 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-10 15:26:46,142 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-10 15:26:46,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-10 15:26:46,143 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-10 15:26:46,144 INFO L263 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret17 := main(); {46#true} is VALID [2020-07-10 15:26:46,145 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-10 15:26:46,147 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} assume !(~N~0 <= 0); {46#true} is VALID [2020-07-10 15:26:46,148 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-10 15:26:46,149 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-10 15:26:46,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-10 15:26:46,152 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-10 15:26:46,154 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-10 15:26:46,154 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-10 15:26:46,155 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-10 15:26:46,155 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:26:46,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-10 15:26:46,159 INFO L280 TraceCheckUtils]: 16: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:26:46,160 INFO L280 TraceCheckUtils]: 17: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-10 15:26:46,160 INFO L280 TraceCheckUtils]: 18: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:26:46,160 INFO L280 TraceCheckUtils]: 19: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-10 15:26:46,161 INFO L280 TraceCheckUtils]: 20: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:26:46,161 INFO L280 TraceCheckUtils]: 21: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-10 15:26:46,162 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:26:46,162 INFO L280 TraceCheckUtils]: 23: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-10 15:26:46,162 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-10 15:26:46,163 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-10 15:26:46,164 INFO L280 TraceCheckUtils]: 26: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2020-07-10 15:26:46,164 INFO L280 TraceCheckUtils]: 27: Hoare triple {47#false} assume 0 == ~cond; {47#false} is VALID [2020-07-10 15:26:46,165 INFO L280 TraceCheckUtils]: 28: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-10 15:26:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:46,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7171161] [2020-07-10 15:26:46,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:46,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:46,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806574918] [2020-07-10 15:26:46,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:26:46,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:46,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:46,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:46,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:46,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:46,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:46,294 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-10 15:26:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:46,658 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2020-07-10 15:26:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:46,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:26:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-10 15:26:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-10 15:26:46,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-10 15:26:46,921 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-10 15:26:46,937 INFO L225 Difference]: With dead ends: 76 [2020-07-10 15:26:46,937 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:26:46,942 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-10 15:26:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:26:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-10 15:26:47,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:47,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-10 15:26:47,016 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 15:26:47,016 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 15:26:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:47,024 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-10 15:26:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:26:47,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:47,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:47,025 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 15:26:47,025 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 15:26:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:47,031 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-10 15:26:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:26:47,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:47,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:47,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:47,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:26:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-10 15:26:47,040 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2020-07-10 15:26:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:47,040 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-10 15:26:47,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:26:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:26:47,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:47,042 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-10 15:26:47,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:47,043 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 120259143, now seen corresponding path program 1 times [2020-07-10 15:26:47,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:47,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951603298] [2020-07-10 15:26:47,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:47,230 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-10 15:26:47,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-10 15:26:47,231 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #123#return; {278#true} is VALID [2020-07-10 15:26:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:47,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#true} ~cond := #in~cond; {278#true} is VALID [2020-07-10 15:26:47,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume !(0 == ~cond); {278#true} is VALID [2020-07-10 15:26:47,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-10 15:26:47,268 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {278#true} {283#(<= 1 ~N~0)} #119#return; {283#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:47,271 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-10 15:26:47,272 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-10 15:26:47,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-10 15:26:47,272 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #123#return; {278#true} is VALID [2020-07-10 15:26:47,273 INFO L263 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret17 := main(); {278#true} is VALID [2020-07-10 15:26:47,273 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-10 15:26:47,274 INFO L280 TraceCheckUtils]: 6: Hoare triple {278#true} assume !(~N~0 <= 0); {283#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:47,275 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-10 15:26:47,275 INFO L280 TraceCheckUtils]: 8: Hoare triple {278#true} ~cond := #in~cond; {278#true} is VALID [2020-07-10 15:26:47,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {278#true} assume !(0 == ~cond); {278#true} is VALID [2020-07-10 15:26:47,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-10 15:26:47,283 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {278#true} {283#(<= 1 ~N~0)} #119#return; {283#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:47,286 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-10 15:26:47,287 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-10 15:26:47,287 INFO L280 TraceCheckUtils]: 14: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-10 15:26:47,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-10 15:26:47,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-10 15:26:47,289 INFO L280 TraceCheckUtils]: 17: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-10 15:26:47,289 INFO L280 TraceCheckUtils]: 18: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-10 15:26:47,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-10 15:26:47,290 INFO L280 TraceCheckUtils]: 20: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-10 15:26:47,290 INFO L280 TraceCheckUtils]: 21: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-10 15:26:47,291 INFO L280 TraceCheckUtils]: 22: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-10 15:26:47,291 INFO L280 TraceCheckUtils]: 23: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-10 15:26:47,294 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-10 15:26:47,294 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-10 15:26:47,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2020-07-10 15:26:47,295 INFO L280 TraceCheckUtils]: 27: Hoare triple {279#false} assume 0 == ~cond; {279#false} is VALID [2020-07-10 15:26:47,295 INFO L280 TraceCheckUtils]: 28: Hoare triple {279#false} assume !false; {279#false} is VALID [2020-07-10 15:26:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:47,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951603298] [2020-07-10 15:26:47,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:47,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:47,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750910037] [2020-07-10 15:26:47,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-10 15:26:47,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:47,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:47,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:47,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:47,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:47,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:47,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:47,350 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2020-07-10 15:26:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:47,873 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2020-07-10 15:26:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:47,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-10 15:26:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2020-07-10 15:26:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2020-07-10 15:26:47,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2020-07-10 15:26:48,022 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-10 15:26:48,026 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:26:48,026 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:26:48,028 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-10 15:26:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:26:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-07-10 15:26:48,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:48,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2020-07-10 15:26:48,092 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2020-07-10 15:26:48,093 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2020-07-10 15:26:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:48,098 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-10 15:26:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-10 15:26:48,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:48,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:48,100 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2020-07-10 15:26:48,100 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2020-07-10 15:26:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:48,105 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-10 15:26:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-10 15:26:48,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:48,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:48,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:48,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:26:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-07-10 15:26:48,111 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2020-07-10 15:26:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:48,111 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-07-10 15:26:48,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-10 15:26:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 15:26:48,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:48,133 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-10 15:26:48,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:48,134 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:48,135 INFO L82 PathProgramCache]: Analyzing trace with hash -774790125, now seen corresponding path program 1 times [2020-07-10 15:26:48,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:48,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057127892] [2020-07-10 15:26:48,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:48,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:48,420 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:48,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:48,501 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:48,502 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:48,502 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:48,502 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:48,502 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:48,502 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:48,502 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:48,503 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:48,503 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:48,503 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:48,503 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:48,503 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:48,503 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:48,503 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:48,504 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:48,504 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:48,504 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:48,504 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:48,506 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:48,507 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:48,507 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:48,507 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:48,507 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:48,507 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:48,507 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:48,508 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:48,508 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:48,508 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:48,508 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-10 15:26:48,508 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-10 15:26:48,508 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-10 15:26:48,508 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-10 15:26:48,509 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-10 15:26:48,509 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-10 15:26:48,509 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-10 15:26:48,509 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-10 15:26:48,511 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:26:48,512 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-10 15:26:48,513 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-10 15:26:48,514 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-10 15:26:48,514 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-10 15:26:48,514 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 15:26:48,514 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 15:26:48,514 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-10 15:26:48,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:48 BoogieIcfgContainer [2020-07-10 15:26:48,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:48,525 INFO L168 Benchmark]: Toolchain (without parser) took 4499.45 ms. Allocated memory was 136.3 MB in the beginning and 248.5 MB in the end (delta: 112.2 MB). Free memory was 101.0 MB in the beginning and 204.3 MB in the end (delta: -103.3 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:48,527 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:48,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.81 ms. Allocated memory is still 136.3 MB. Free memory was 100.6 MB in the beginning and 89.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:48,531 INFO L168 Benchmark]: Boogie Preprocessor took 320.59 ms. Allocated memory was 136.3 MB in the beginning and 203.4 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 180.4 MB in the end (delta: -91.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:48,533 INFO L168 Benchmark]: RCFGBuilder took 753.18 ms. Allocated memory is still 203.4 MB. Free memory was 179.7 MB in the beginning and 147.6 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:48,535 INFO L168 Benchmark]: TraceAbstraction took 2911.92 ms. Allocated memory was 203.4 MB in the beginning and 248.5 MB in the end (delta: 45.1 MB). Free memory was 146.9 MB in the beginning and 204.3 MB in the end (delta: -57.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:26:48,548 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.33 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 502.81 ms. Allocated memory is still 136.3 MB. Free memory was 100.6 MB in the beginning and 89.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 320.59 ms. Allocated memory was 136.3 MB in the beginning and 203.4 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 180.4 MB in the end (delta: -91.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 753.18 ms. Allocated memory is still 203.4 MB. Free memory was 179.7 MB in the beginning and 147.6 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2911.92 ms. Allocated memory was 203.4 MB in the beginning and 248.5 MB in the end (delta: 45.1 MB). Free memory was 146.9 MB in the beginning and 204.3 MB in the end (delta: -57.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)={-1:0}, malloc(sizeof(int)*N)={-2:0}, malloc(sizeof(int)*N)={5:0}, N=1, sum={7:0}] [L32] COND TRUE i