/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:06:30,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:06:30,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:06:30,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:06:30,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:06:30,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:06:30,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:06:30,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:06:30,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:06:30,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:06:30,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:06:30,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:06:30,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:06:30,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:06:30,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:06:30,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:06:30,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:06:30,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:06:30,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:06:30,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:06:30,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:06:30,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:06:30,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:06:30,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:06:30,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:06:30,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:06:30,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:06:30,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:06:30,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:06:30,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:06:30,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:06:30,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:06:30,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:06:30,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:06:30,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:06:30,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:06:30,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:06:30,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:06:30,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:06:30,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:06:30,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:06:30,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:06:30,737 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:06:30,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:06:30,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:06:30,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:06:30,739 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:06:30,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:06:30,739 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:06:30,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:06:30,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:06:30,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:06:30,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:06:30,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:06:30,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:06:30,740 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:06:30,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:06:30,741 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:06:30,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:06:30,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:06:30,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:06:30,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:06:30,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:06:30,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:06:30,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:06:30,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:06:30,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:06:30,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:06:30,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:06:30,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:06:30,743 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:06:30,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:06:31,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:06:31,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:06:31,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:06:31,034 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:06:31,034 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:06:31,035 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test11.c [2020-07-10 15:06:31,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1783ed31/4f9ed33660504ba0a5aa7db80b1c383a/FLAGa852ae977 [2020-07-10 15:06:31,592 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:06:31,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test11.c [2020-07-10 15:06:31,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1783ed31/4f9ed33660504ba0a5aa7db80b1c383a/FLAGa852ae977 [2020-07-10 15:06:32,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1783ed31/4f9ed33660504ba0a5aa7db80b1c383a [2020-07-10 15:06:32,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:06:32,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:06:32,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:32,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:06:32,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:06:32,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647b545a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32, skipping insertion in model container [2020-07-10 15:06:32,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:06:32,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:06:32,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:32,255 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:06:32,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:32,293 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:06:32,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32 WrapperNode [2020-07-10 15:06:32,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:32,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:06:32,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:06:32,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:06:32,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (1/1) ... [2020-07-10 15:06:32,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:06:32,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:06:32,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:06:32,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:06:32,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:06:32,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:06:32,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:06:32,519 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-10 15:06:32,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:06:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:06:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:06:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 15:06:32,519 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-10 15:06:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:06:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:06:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 15:06:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:06:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:06:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:06:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:06:32,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:06:32,931 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:06:32,932 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:06:32,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:32 BoogieIcfgContainer [2020-07-10 15:06:32,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:06:32,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:06:32,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:06:32,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:06:32,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:06:32" (1/3) ... [2020-07-10 15:06:32,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f7849f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:32, skipping insertion in model container [2020-07-10 15:06:32,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:32" (2/3) ... [2020-07-10 15:06:32,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f7849f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:32, skipping insertion in model container [2020-07-10 15:06:32,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:32" (3/3) ... [2020-07-10 15:06:32,945 INFO L109 eAbstractionObserver]: Analyzing ICFG test11.c [2020-07-10 15:06:32,957 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:06:32,966 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:06:32,979 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:06:33,002 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:06:33,003 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:06:33,003 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:06:33,003 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:06:33,003 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:06:33,003 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:06:33,003 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:06:33,004 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:06:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-10 15:06:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:06:33,026 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:33,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:33,027 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -722462527, now seen corresponding path program 1 times [2020-07-10 15:06:33,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:33,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968768917] [2020-07-10 15:06:33,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:33,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); {26#true} is VALID [2020-07-10 15:06:33,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 15:06:33,463 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #43#return; {26#true} is VALID [2020-07-10 15:06:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:33,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {26#true} is VALID [2020-07-10 15:06:33,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {26#true} is VALID [2020-07-10 15:06:33,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 15:06:33,484 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {26#true} {31#(not (= 0 main_~pc~0.base))} #47#return; {31#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 15:06:33,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {37#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:33,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); {26#true} is VALID [2020-07-10 15:06:33,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 15:06:33,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #43#return; {26#true} is VALID [2020-07-10 15:06:33,489 INFO L263 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret11 := main(); {26#true} is VALID [2020-07-10 15:06:33,492 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4);havoc #t~nondet4; {31#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 15:06:33,492 INFO L263 TraceCheckUtils]: 6: Hoare triple {31#(not (= 0 main_~pc~0.base))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {26#true} is VALID [2020-07-10 15:06:33,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {26#true} is VALID [2020-07-10 15:06:33,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {26#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {26#true} is VALID [2020-07-10 15:06:33,493 INFO L280 TraceCheckUtils]: 9: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 15:06:33,495 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {26#true} {31#(not (= 0 main_~pc~0.base))} #47#return; {31#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 15:06:33,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {31#(not (= 0 main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {36#(not |main_#t~short9|)} is VALID [2020-07-10 15:06:33,498 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#(not |main_#t~short9|)} assume #t~short9; {27#false} is VALID [2020-07-10 15:06:33,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {27#false} assume #t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~short8;havoc #t~mem6; {27#false} is VALID [2020-07-10 15:06:33,499 INFO L280 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-10 15:06:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:06:33,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968768917] [2020-07-10 15:06:33,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:33,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:06:33,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316033384] [2020-07-10 15:06:33,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 15:06:33,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:33,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:06:33,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:33,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:06:33,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:06:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:06:33,577 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-10 15:06:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:33,842 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 15:06:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:06:33,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 15:06:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:06:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 15:06:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:06:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 15:06:33,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-10 15:06:33,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:33,952 INFO L225 Difference]: With dead ends: 31 [2020-07-10 15:06:33,952 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 15:06:33,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:06:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 15:06:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 15:06:34,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:34,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,009 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,009 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:34,013 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 15:06:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 15:06:34,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:34,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:34,014 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,014 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:34,017 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 15:06:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 15:06:34,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:34,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:34,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:34,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:06:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-10 15:06:34,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2020-07-10 15:06:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:34,023 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-10 15:06:34,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:06:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 15:06:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:06:34,024 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:34,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:34,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:06:34,025 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:34,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1499811687, now seen corresponding path program 1 times [2020-07-10 15:06:34,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:34,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121240876] [2020-07-10 15:06:34,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:34,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); {145#true} is VALID [2020-07-10 15:06:34,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {145#true} assume true; {145#true} is VALID [2020-07-10 15:06:34,155 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {145#true} {145#true} #43#return; {145#true} is VALID [2020-07-10 15:06:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:34,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {145#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {145#true} is VALID [2020-07-10 15:06:34,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {145#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {145#true} is VALID [2020-07-10 15:06:34,161 INFO L280 TraceCheckUtils]: 2: Hoare triple {145#true} assume true; {145#true} is VALID [2020-07-10 15:06:34,162 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {145#true} {145#true} #47#return; {145#true} is VALID [2020-07-10 15:06:34,164 INFO L263 TraceCheckUtils]: 0: Hoare triple {145#true} call ULTIMATE.init(); {157#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:34,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {157#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); {145#true} is VALID [2020-07-10 15:06:34,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {145#true} assume true; {145#true} is VALID [2020-07-10 15:06:34,165 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {145#true} {145#true} #43#return; {145#true} is VALID [2020-07-10 15:06:34,165 INFO L263 TraceCheckUtils]: 4: Hoare triple {145#true} call #t~ret11 := main(); {145#true} is VALID [2020-07-10 15:06:34,165 INFO L280 TraceCheckUtils]: 5: Hoare triple {145#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4);havoc #t~nondet4; {145#true} is VALID [2020-07-10 15:06:34,165 INFO L263 TraceCheckUtils]: 6: Hoare triple {145#true} call #t~ret5.base, #t~ret5.offset := get_dummy(); {145#true} is VALID [2020-07-10 15:06:34,166 INFO L280 TraceCheckUtils]: 7: Hoare triple {145#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {145#true} is VALID [2020-07-10 15:06:34,166 INFO L280 TraceCheckUtils]: 8: Hoare triple {145#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {145#true} is VALID [2020-07-10 15:06:34,166 INFO L280 TraceCheckUtils]: 9: Hoare triple {145#true} assume true; {145#true} is VALID [2020-07-10 15:06:34,167 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {145#true} {145#true} #47#return; {145#true} is VALID [2020-07-10 15:06:34,168 INFO L280 TraceCheckUtils]: 11: Hoare triple {145#true} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {154#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 15:06:34,169 INFO L280 TraceCheckUtils]: 12: Hoare triple {154#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {154#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 15:06:34,170 INFO L280 TraceCheckUtils]: 13: Hoare triple {154#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume #t~short8;call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4);call #t~mem7 := read~int(~pb~0.base, ~pb~0.offset, 4);#t~short8 := #t~mem6 != #t~mem7; {155#(not |main_#t~short8|)} is VALID [2020-07-10 15:06:34,171 INFO L280 TraceCheckUtils]: 14: Hoare triple {155#(not |main_#t~short8|)} #t~short9 := #t~short8; {156#(not |main_#t~short9|)} is VALID [2020-07-10 15:06:34,172 INFO L280 TraceCheckUtils]: 15: Hoare triple {156#(not |main_#t~short9|)} assume #t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~short8;havoc #t~mem6; {146#false} is VALID [2020-07-10 15:06:34,172 INFO L280 TraceCheckUtils]: 16: Hoare triple {146#false} assume !false; {146#false} is VALID [2020-07-10 15:06:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:06:34,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121240876] [2020-07-10 15:06:34,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:34,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:06:34,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168033325] [2020-07-10 15:06:34,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:06:34,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:34,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:06:34,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:34,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:06:34,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:34,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:06:34,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:06:34,204 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2020-07-10 15:06:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:34,499 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-10 15:06:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:06:34,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:06:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:06:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-10 15:06:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:06:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-10 15:06:34,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2020-07-10 15:06:34,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:34,541 INFO L225 Difference]: With dead ends: 21 [2020-07-10 15:06:34,541 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 15:06:34,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:06:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 15:06:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 15:06:34,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:34,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,570 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,570 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:34,572 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 15:06:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 15:06:34,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:34,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:34,573 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,573 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:06:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:34,575 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 15:06:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 15:06:34,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:34,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:34,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:34,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:06:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-10 15:06:34,578 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2020-07-10 15:06:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:34,579 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-10 15:06:34,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:06:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 15:06:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:06:34,580 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:34,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:34,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:06:34,580 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:34,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash -750476091, now seen corresponding path program 1 times [2020-07-10 15:06:34,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:34,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830299167] [2020-07-10 15:06:34,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:34,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); {257#true} is VALID [2020-07-10 15:06:34,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-10 15:06:34,701 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #43#return; {257#true} is VALID [2020-07-10 15:06:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:34,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {257#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {257#true} is VALID [2020-07-10 15:06:34,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {257#true} is VALID [2020-07-10 15:06:34,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-10 15:06:34,717 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {257#true} {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #47#return; {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 15:06:34,719 INFO L263 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {268#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 15:06:34,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); {257#true} is VALID [2020-07-10 15:06:34,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-10 15:06:34,720 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #43#return; {257#true} is VALID [2020-07-10 15:06:34,721 INFO L263 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret11 := main(); {257#true} is VALID [2020-07-10 15:06:34,722 INFO L280 TraceCheckUtils]: 5: Hoare triple {257#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4);havoc #t~nondet4; {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 15:06:34,722 INFO L263 TraceCheckUtils]: 6: Hoare triple {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {257#true} is VALID [2020-07-10 15:06:34,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {257#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {257#true} is VALID [2020-07-10 15:06:34,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {257#true} is VALID [2020-07-10 15:06:34,723 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-10 15:06:34,725 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {257#true} {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #47#return; {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 15:06:34,727 INFO L280 TraceCheckUtils]: 11: Hoare triple {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 15:06:34,728 INFO L280 TraceCheckUtils]: 12: Hoare triple {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 15:06:34,730 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume #t~short8;call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4);call #t~mem7 := read~int(~pb~0.base, ~pb~0.offset, 4);#t~short8 := #t~mem6 != #t~mem7; {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 15:06:34,731 INFO L280 TraceCheckUtils]: 14: Hoare triple {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short9 := #t~short8; {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 15:06:34,733 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume !#t~short9;havoc #t~mem7;havoc #t~short9;havoc #t~short8;havoc #t~mem6;call write~int(60, ~pc~0.base, ~pc~0.offset, 4);call #t~mem10 := read~int(~#c~0.base, ~#c~0.offset, 4); {267#(= |main_#t~mem10| 60)} is VALID [2020-07-10 15:06:34,734 INFO L280 TraceCheckUtils]: 16: Hoare triple {267#(= |main_#t~mem10| 60)} assume 60 != #t~mem10;havoc #t~mem10; {258#false} is VALID [2020-07-10 15:06:34,734 INFO L280 TraceCheckUtils]: 17: Hoare triple {258#false} assume !false; {258#false} is VALID [2020-07-10 15:06:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:06:34,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830299167] [2020-07-10 15:06:34,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:34,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:06:34,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073347819] [2020-07-10 15:06:34,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 15:06:34,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:34,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:06:34,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:34,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:06:34,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:34,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:06:34,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:06:34,768 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2020-07-10 15:06:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:34,930 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 15:06:34,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:06:34,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 15:06:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:06:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-10 15:06:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:06:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-10 15:06:34,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2020-07-10 15:06:34,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:34,963 INFO L225 Difference]: With dead ends: 19 [2020-07-10 15:06:34,963 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:06:34,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:06:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:06:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:06:34,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:34,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:34,965 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:34,965 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:34,966 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:34,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:34,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:34,966 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:34,967 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:34,967 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:34,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:34,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:34,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:34,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:06:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:06:34,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-10 15:06:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:34,969 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:06:34,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:06:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:34,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:34,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:06:34,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:06:35,052 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:35,052 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|)) [2020-07-10 15:06:35,052 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:35,052 INFO L268 CegarLoopResult]: For program point get_dummyFINAL(lines 7 10) no Hoare annotation was computed. [2020-07-10 15:06:35,053 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-10 15:06:35,053 INFO L271 CegarLoopResult]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2020-07-10 15:06:35,053 INFO L268 CegarLoopResult]: For program point get_dummyEXIT(lines 7 10) no Hoare annotation was computed. [2020-07-10 15:06:35,053 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:35,053 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:06:35,053 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:06:35,054 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:35,054 INFO L264 CegarLoopResult]: At program point L25(lines 12 32) the Hoare annotation is: false [2020-07-10 15:06:35,054 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 12 32) no Hoare annotation was computed. [2020-07-10 15:06:35,054 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-10 15:06:35,054 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 15:06:35,054 INFO L268 CegarLoopResult]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-07-10 15:06:35,055 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-10 15:06:35,055 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 12 32) no Hoare annotation was computed. [2020-07-10 15:06:35,055 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2020-07-10 15:06:35,055 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 12 32) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-10 15:06:35,055 INFO L268 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-07-10 15:06:35,055 INFO L268 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2020-07-10 15:06:35,055 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2020-07-10 15:06:35,060 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:35,061 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:06:35,062 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:06:35,063 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:35,063 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:35,064 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:06:35,064 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 15:06:35,064 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:06:35,065 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:35,065 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2020-07-10 15:06:35,065 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 15:06:35,065 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-10 15:06:35,065 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:06:35,065 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:06:35,066 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-10 15:06:35,066 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-10 15:06:35,066 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:06:35,066 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:06:35,066 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:06:35,067 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:06:35,067 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:06:35,067 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:06:35,067 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-10 15:06:35,067 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:06:35,067 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:06:35,067 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:06:35,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:06:35 BoogieIcfgContainer [2020-07-10 15:06:35,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:06:35,080 INFO L168 Benchmark]: Toolchain (without parser) took 3058.22 ms. Allocated memory was 145.2 MB in the beginning and 245.4 MB in the end (delta: 100.1 MB). Free memory was 103.3 MB in the beginning and 186.0 MB in the end (delta: -82.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:35,081 INFO L168 Benchmark]: CDTParser took 0.23 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-10 15:06:35,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.40 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 92.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:35,082 INFO L168 Benchmark]: Boogie Preprocessor took 156.08 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 92.3 MB in the beginning and 181.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:35,083 INFO L168 Benchmark]: RCFGBuilder took 480.91 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 158.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:35,084 INFO L168 Benchmark]: TraceAbstraction took 2138.82 ms. Allocated memory was 203.4 MB in the beginning and 245.4 MB in the end (delta: 41.9 MB). Free memory was 158.4 MB in the beginning and 186.0 MB in the end (delta: -27.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:35,088 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 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 270.40 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 92.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 156.08 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 92.3 MB in the beginning and 181.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 480.91 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 158.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2138.82 ms. Allocated memory was 203.4 MB in the beginning and 245.4 MB in the end (delta: 41.9 MB). Free memory was 158.4 MB in the beginning and 186.0 MB in the end (delta: -27.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 42 SDtfs, 34 SDslu, 65 SDs, 0 SdLazy, 103 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 47 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 2837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...