/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/test14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:06:36,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:06:36,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:06:36,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:06:36,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:06:36,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:06:36,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:06:36,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:06:36,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:06:36,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:06:36,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:06:36,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:06:36,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:06:36,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:06:36,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:06:36,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:06:36,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:06:36,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:06:36,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:06:36,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:06:36,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:06:36,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:06:36,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:06:36,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:06:36,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:06:36,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:06:36,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:06:36,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:06:36,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:06:36,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:06:36,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:06:36,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:06:36,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:06:36,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:06:37,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:06:37,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:06:37,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:06:37,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:06:37,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:06:37,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:06:37,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:06:37,007 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:37,047 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:06:37,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:06:37,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:06:37,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:06:37,051 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:06:37,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:06:37,055 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:06:37,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:06:37,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:06:37,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:06:37,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:06:37,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:06:37,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:06:37,056 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:06:37,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:06:37,057 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:06:37,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:06:37,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:06:37,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:06:37,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:06:37,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:06:37,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:06:37,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:06:37,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:06:37,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:06:37,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:06:37,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:06:37,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:06:37,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:06:37,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:06:37,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:06:37,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:06:37,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:06:37,404 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:06:37,405 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:06:37,406 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test14.c [2020-07-10 15:06:37,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b23e6c9/a709acc6a1294bc4811ee413d10b131a/FLAGe87fba45f [2020-07-10 15:06:37,981 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:06:37,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test14.c [2020-07-10 15:06:37,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b23e6c9/a709acc6a1294bc4811ee413d10b131a/FLAGe87fba45f [2020-07-10 15:06:38,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b23e6c9/a709acc6a1294bc4811ee413d10b131a [2020-07-10 15:06:38,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:06:38,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:06:38,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:38,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:06:38,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:06:38,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:38" (1/1) ... [2020-07-10 15:06:38,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c210f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:38, skipping insertion in model container [2020-07-10 15:06:38,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:38" (1/1) ... [2020-07-10 15:06:38,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:06:38,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:06:38,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:38,687 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:06:38,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:38,735 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:06:38,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:38 WrapperNode [2020-07-10 15:06:38,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:38,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:06:38,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:06:38,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:06:38,753 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:38" (1/1) ... [2020-07-10 15:06:38,755 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:38" (1/1) ... [2020-07-10 15:06:38,855 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:38" (1/1) ... [2020-07-10 15:06:38,855 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:38" (1/1) ... [2020-07-10 15:06:38,877 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:38" (1/1) ... [2020-07-10 15:06:38,882 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:38" (1/1) ... [2020-07-10 15:06:38,889 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:38" (1/1) ... [2020-07-10 15:06:38,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:06:38,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:06:38,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:06:38,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:06:38,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:38" (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:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:06:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:06:38,960 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-10 15:06:38,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:06:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:06:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:06:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 15:06:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-10 15:06:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:06:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:06:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 15:06:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:06:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:06:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:06:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:06:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:06:39,272 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:06:39,273 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:06:39,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:39 BoogieIcfgContainer [2020-07-10 15:06:39,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:06:39,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:06:39,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:06:39,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:06:39,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:06:38" (1/3) ... [2020-07-10 15:06:39,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248c0dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:39, skipping insertion in model container [2020-07-10 15:06:39,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:38" (2/3) ... [2020-07-10 15:06:39,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248c0dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:39, skipping insertion in model container [2020-07-10 15:06:39,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:39" (3/3) ... [2020-07-10 15:06:39,292 INFO L109 eAbstractionObserver]: Analyzing ICFG test14.c [2020-07-10 15:06:39,309 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:06:39,320 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:06:39,339 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:06:39,364 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:06:39,364 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:06:39,365 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:06:39,365 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:06:39,365 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:06:39,365 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:06:39,366 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:06:39,366 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:06:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-10 15:06:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:06:39,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:39,394 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:39,394 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:39,402 INFO L82 PathProgramCache]: Analyzing trace with hash 521841741, now seen corresponding path program 1 times [2020-07-10 15:06:39,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:39,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834525359] [2020-07-10 15:06:39,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:39,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#(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); {25#true} is VALID [2020-07-10 15:06:39,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 15:06:39,790 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #38#return; {25#true} is VALID [2020-07-10 15:06:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:39,812 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {25#true} is VALID [2020-07-10 15:06:39,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;havoc #t~nondet0; {25#true} is VALID [2020-07-10 15:06:39,813 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 15:06:39,815 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {25#true} {30#(not (= 0 main_~pc~0.base))} #42#return; {30#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 15:06:39,818 INFO L263 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {36#(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:39,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(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); {25#true} is VALID [2020-07-10 15:06:39,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 15:06:39,819 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #38#return; {25#true} is VALID [2020-07-10 15:06:39,820 INFO L263 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret9 := main(); {25#true} is VALID [2020-07-10 15:06:39,823 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~a~1;havoc ~b~1;call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4);call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~a~1 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~b~1 := #t~nondet3;havoc #t~nondet3;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; {30#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 15:06:39,824 INFO L263 TraceCheckUtils]: 6: Hoare triple {30#(not (= 0 main_~pc~0.base))} call #t~ret4.base, #t~ret4.offset := get_dummy(); {25#true} is VALID [2020-07-10 15:06:39,824 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {25#true} is VALID [2020-07-10 15:06:39,824 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;havoc #t~nondet0; {25#true} is VALID [2020-07-10 15:06:39,825 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 15:06:39,827 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {25#true} {30#(not (= 0 main_~pc~0.base))} #42#return; {30#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 15:06:39,828 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#(not (= 0 main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret4.base, #t~ret4.offset;#t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {35#(not |main_#t~short8|)} is VALID [2020-07-10 15:06:39,829 INFO L280 TraceCheckUtils]: 12: Hoare triple {35#(not |main_#t~short8|)} assume #t~short8; {26#false} is VALID [2020-07-10 15:06:39,830 INFO L280 TraceCheckUtils]: 13: Hoare triple {26#false} assume #t~short8;havoc #t~mem6;havoc #t~short7;havoc #t~mem5;havoc #t~short8; {26#false} is VALID [2020-07-10 15:06:39,830 INFO L280 TraceCheckUtils]: 14: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-10 15:06:39,833 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:39,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834525359] [2020-07-10 15:06:39,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:39,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:06:39,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957576263] [2020-07-10 15:06:39,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 15:06:39,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:39,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:06:39,886 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:39,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:06:39,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:39,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:06:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:06:39,900 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2020-07-10 15:06:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:40,172 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-10 15:06:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:06:40,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-10 15:06:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:06:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-10 15:06:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:06:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-10 15:06:40,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-10 15:06:40,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:40,266 INFO L225 Difference]: With dead ends: 29 [2020-07-10 15:06:40,267 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:06:40,270 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:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:06:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-10 15:06:40,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:40,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-10 15:06:40,346 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:06:40,346 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:06:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:40,350 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 15:06:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:06:40,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:40,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:40,351 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:06:40,351 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:06:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:40,355 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 15:06:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:06:40,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:40,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:40,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:40,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:06:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-10 15:06:40,360 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2020-07-10 15:06:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:40,361 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-10 15:06:40,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:06:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:06:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:06:40,362 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:40,362 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:40,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:06:40,363 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:40,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:40,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1019657549, now seen corresponding path program 1 times [2020-07-10 15:06:40,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:40,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825691807] [2020-07-10 15:06:40,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:40,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#(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); {139#true} is VALID [2020-07-10 15:06:40,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {139#true} assume true; {139#true} is VALID [2020-07-10 15:06:40,490 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {139#true} {139#true} #38#return; {139#true} is VALID [2020-07-10 15:06:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:40,497 INFO L280 TraceCheckUtils]: 0: Hoare triple {139#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {139#true} is VALID [2020-07-10 15:06:40,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {139#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;havoc #t~nondet0; {139#true} is VALID [2020-07-10 15:06:40,498 INFO L280 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2020-07-10 15:06:40,498 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #42#return; {139#true} is VALID [2020-07-10 15:06:40,500 INFO L263 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {151#(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:40,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#(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); {139#true} is VALID [2020-07-10 15:06:40,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2020-07-10 15:06:40,501 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #38#return; {139#true} is VALID [2020-07-10 15:06:40,501 INFO L263 TraceCheckUtils]: 4: Hoare triple {139#true} call #t~ret9 := main(); {139#true} is VALID [2020-07-10 15:06:40,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {139#true} havoc ~a~1;havoc ~b~1;call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4);call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~a~1 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~b~1 := #t~nondet3;havoc #t~nondet3;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; {139#true} is VALID [2020-07-10 15:06:40,502 INFO L263 TraceCheckUtils]: 6: Hoare triple {139#true} call #t~ret4.base, #t~ret4.offset := get_dummy(); {139#true} is VALID [2020-07-10 15:06:40,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {139#true} assume 0 != #t~nondet0 % 256;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {139#true} is VALID [2020-07-10 15:06:40,502 INFO L280 TraceCheckUtils]: 8: Hoare triple {139#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;havoc #t~nondet0; {139#true} is VALID [2020-07-10 15:06:40,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {139#true} assume true; {139#true} is VALID [2020-07-10 15:06:40,503 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {139#true} {139#true} #42#return; {139#true} is VALID [2020-07-10 15:06:40,504 INFO L280 TraceCheckUtils]: 11: Hoare triple {139#true} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret4.base, #t~ret4.offset;#t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {148#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 15:06:40,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {148#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short8;#t~short7 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {148#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 15:06:40,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {148#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume #t~short7;call #t~mem5 := read~int(~pa~0.base, ~pa~0.offset, 4);call #t~mem6 := read~int(~pb~0.base, ~pb~0.offset, 4);#t~short7 := #t~mem5 != #t~mem6; {149#(not |main_#t~short7|)} is VALID [2020-07-10 15:06:40,507 INFO L280 TraceCheckUtils]: 14: Hoare triple {149#(not |main_#t~short7|)} #t~short8 := #t~short7; {150#(not |main_#t~short8|)} is VALID [2020-07-10 15:06:40,508 INFO L280 TraceCheckUtils]: 15: Hoare triple {150#(not |main_#t~short8|)} assume #t~short8;havoc #t~mem6;havoc #t~short7;havoc #t~mem5;havoc #t~short8; {140#false} is VALID [2020-07-10 15:06:40,508 INFO L280 TraceCheckUtils]: 16: Hoare triple {140#false} assume !false; {140#false} is VALID [2020-07-10 15:06:40,510 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:40,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825691807] [2020-07-10 15:06:40,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:40,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:06:40,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646158559] [2020-07-10 15:06:40,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:06:40,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:40,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:06:40,543 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:40,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:06:40,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:40,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:06:40,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:06:40,545 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-07-10 15:06:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:40,780 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 15:06:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:06:40,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:06:40,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:06:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-10 15:06:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:06:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-10 15:06:40,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2020-07-10 15:06:40,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:40,816 INFO L225 Difference]: With dead ends: 18 [2020-07-10 15:06:40,816 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:06:40,817 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:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:06:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:06:40,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:40,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:40,818 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:40,818 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:40,819 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:40,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:40,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:40,820 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:40,820 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:40,820 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:40,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:40,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:40,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:40,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:06:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:06:40,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-10 15:06:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:40,822 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:06:40,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:06:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:40,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:40,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:06:40,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:06:40,906 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:40,907 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:40,907 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:40,907 INFO L268 CegarLoopResult]: For program point get_dummyFINAL(lines 7 10) no Hoare annotation was computed. [2020-07-10 15:06:40,907 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-10 15:06:40,908 INFO L271 CegarLoopResult]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2020-07-10 15:06:40,908 INFO L268 CegarLoopResult]: For program point get_dummyEXIT(lines 7 10) no Hoare annotation was computed. [2020-07-10 15:06:40,908 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:40,908 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:06:40,908 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:06:40,908 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:40,909 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2020-07-10 15:06:40,909 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 12 27) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-10 15:06:40,909 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 12 27) no Hoare annotation was computed. [2020-07-10 15:06:40,909 INFO L264 CegarLoopResult]: At program point L20(lines 12 27) the Hoare annotation is: false [2020-07-10 15:06:40,910 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-10 15:06:40,910 INFO L268 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2020-07-10 15:06:40,910 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-10 15:06:40,910 INFO L268 CegarLoopResult]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-07-10 15:06:40,910 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-10 15:06:40,910 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2020-07-10 15:06:40,911 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 12 27) no Hoare annotation was computed. [2020-07-10 15:06:40,917 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:40,920 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:06:40,921 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:06:40,922 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:40,922 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:40,923 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-10 15:06:40,923 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 15:06:40,923 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:06:40,923 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:40,923 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2020-07-10 15:06:40,924 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 15:06:40,924 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-10 15:06:40,924 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:06:40,924 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:06:40,924 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-10 15:06:40,924 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-10 15:06:40,924 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:06:40,925 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:06:40,925 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:06:40,925 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:06:40,925 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:06:40,925 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-10 15:06:40,925 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:06:40,926 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:40,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:06:40 BoogieIcfgContainer [2020-07-10 15:06:40,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:06:40,938 INFO L168 Benchmark]: Toolchain (without parser) took 2567.20 ms. Allocated memory was 137.9 MB in the beginning and 233.3 MB in the end (delta: 95.4 MB). Free memory was 103.1 MB in the beginning and 117.6 MB in the end (delta: -14.5 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:40,939 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 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:40,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.68 ms. Allocated memory is still 137.9 MB. Free memory was 102.9 MB in the beginning and 92.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:40,941 INFO L168 Benchmark]: Boogie Preprocessor took 155.41 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 92.6 MB in the beginning and 179.0 MB in the end (delta: -86.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:40,941 INFO L168 Benchmark]: RCFGBuilder took 385.94 ms. Allocated memory is still 200.8 MB. Free memory was 179.0 MB in the beginning and 157.7 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:40,942 INFO L168 Benchmark]: TraceAbstraction took 1653.45 ms. Allocated memory was 200.8 MB in the beginning and 233.3 MB in the end (delta: 32.5 MB). Free memory was 157.7 MB in the beginning and 117.6 MB in the end (delta: 40.1 MB). Peak memory consumption was 72.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:40,946 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.48 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 361.68 ms. Allocated memory is still 137.9 MB. Free memory was 102.9 MB in the beginning and 92.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.41 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 92.6 MB in the beginning and 179.0 MB in the end (delta: -86.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.94 ms. Allocated memory is still 200.8 MB. Free memory was 179.0 MB in the beginning and 157.7 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1653.45 ms. Allocated memory was 200.8 MB in the beginning and 233.3 MB in the end (delta: 32.5 MB). Free memory was 157.7 MB in the beginning and 117.6 MB in the end (delta: 40.1 MB). Peak memory consumption was 72.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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, 22 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 SDtfs, 24 SDslu, 42 SDs, 0 SdLazy, 67 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 40 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.3s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 1494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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...