/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/test29-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:07:08,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:07:08,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:07:08,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:07:08,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:07:08,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:07:08,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:07:08,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:07:08,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:07:08,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:07:08,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:07:08,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:07:08,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:07:08,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:07:08,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:07:08,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:07:08,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:07:08,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:07:08,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:07:08,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:07:08,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:07:08,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:07:08,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:07:08,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:07:08,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:07:08,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:07:08,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:07:08,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:07:08,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:07:08,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:07:08,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:07:08,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:07:08,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:07:08,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:07:08,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:07:08,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:07:08,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:07:08,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:07:08,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:07:08,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:07:08,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:07:08,164 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:07:08,203 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:07:08,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:07:08,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:07:08,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:07:08,207 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:07:08,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:07:08,207 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:07:08,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:07:08,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:07:08,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:07:08,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:07:08,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:07:08,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:07:08,212 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:07:08,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:07:08,212 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:07:08,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:07:08,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:07:08,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:07:08,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:07:08,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:07:08,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:07:08,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:07:08,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:07:08,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:07:08,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:07:08,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:07:08,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:07:08,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:07:08,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:07:08,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:07:08,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:07:08,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:07:08,609 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:07:08,609 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:07:08,612 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test29-2.c [2020-07-10 15:07:08,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfb0de51/983220fdf6864301b13705922059bc46/FLAGd3330f03f [2020-07-10 15:07:09,181 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:07:09,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-2.c [2020-07-10 15:07:09,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfb0de51/983220fdf6864301b13705922059bc46/FLAGd3330f03f [2020-07-10 15:07:09,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfb0de51/983220fdf6864301b13705922059bc46 [2020-07-10 15:07:09,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:07:09,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:07:09,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:07:09,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:07:09,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:07:09,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275a248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09, skipping insertion in model container [2020-07-10 15:07:09,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:07:09,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:07:09,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:07:09,776 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:07:09,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:07:09,812 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:07:09,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09 WrapperNode [2020-07-10 15:07:09,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:07:09,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:07:09,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:07:09,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:07:09,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (1/1) ... [2020-07-10 15:07:09,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:07:09,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:07:09,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:07:09,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:07:09,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (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:07:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:07:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:07:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:07:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:07:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:07:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:07:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:07:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:07:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:07:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:07:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:07:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:07:10,332 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:07:10,332 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:07:10,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:07:10 BoogieIcfgContainer [2020-07-10 15:07:10,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:07:10,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:07:10,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:07:10,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:07:10,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:07:09" (1/3) ... [2020-07-10 15:07:10,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df54b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:07:10, skipping insertion in model container [2020-07-10 15:07:10,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:07:09" (2/3) ... [2020-07-10 15:07:10,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df54b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:07:10, skipping insertion in model container [2020-07-10 15:07:10,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:07:10" (3/3) ... [2020-07-10 15:07:10,344 INFO L109 eAbstractionObserver]: Analyzing ICFG test29-2.c [2020-07-10 15:07:10,352 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:07:10,358 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:07:10,370 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:07:10,392 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:07:10,392 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:07:10,392 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:07:10,393 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:07:10,393 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:07:10,393 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:07:10,393 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:07:10,393 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:07:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-10 15:07:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:07:10,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:10,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:07:10,417 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:10,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:10,422 INFO L82 PathProgramCache]: Analyzing trace with hash 668850033, now seen corresponding path program 1 times [2020-07-10 15:07:10,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:10,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056066147] [2020-07-10 15:07:10,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:10,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#true} is VALID [2020-07-10 15:07:10,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-10 15:07:10,722 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2020-07-10 15:07:10,725 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {28#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:07:10,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#true} is VALID [2020-07-10 15:07:10,726 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-10 15:07:10,727 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2020-07-10 15:07:10,727 INFO L263 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2020-07-10 15:07:10,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID [2020-07-10 15:07:10,729 INFO L280 TraceCheckUtils]: 6: Hoare triple {21#true} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {26#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (= |main_#t~ite1.offset| |main_~#d1~0.offset|))} is VALID [2020-07-10 15:07:10,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (= |main_#t~ite1.offset| |main_~#d1~0.offset|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {27#(and (= |main_~#d1~0.offset| main_~pd~0.offset) (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-10 15:07:10,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {27#(and (= |main_~#d1~0.offset| main_~pd~0.offset) (= |main_~#d1~0.base| main_~pd~0.base))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, ~pd~0.offset, 1); {22#false} is VALID [2020-07-10 15:07:10,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {22#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {22#false} is VALID [2020-07-10 15:07:10,735 INFO L280 TraceCheckUtils]: 10: Hoare triple {22#false} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1);#t~short3 := 0 != #t~mem2; {22#false} is VALID [2020-07-10 15:07:10,736 INFO L280 TraceCheckUtils]: 11: Hoare triple {22#false} assume #t~short3;havoc #t~mem2;havoc #t~short3; {22#false} is VALID [2020-07-10 15:07:10,736 INFO L280 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2020-07-10 15:07:10,738 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:07:10,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056066147] [2020-07-10 15:07:10,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:07:10,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:07:10,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149653118] [2020-07-10 15:07:10,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 15:07:10,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:10,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:07:10,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:10,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:07:10,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:07:10,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:07:10,808 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-07-10 15:07:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,015 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-07-10 15:07:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:07:11,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 15:07:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:07:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-10 15:07:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:07:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-10 15:07:11,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-10 15:07:11,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:11,110 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:07:11,110 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 15:07:11,114 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:07:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 15:07:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2020-07-10 15:07:11,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:11,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 16 states. [2020-07-10 15:07:11,159 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 16 states. [2020-07-10 15:07:11,160 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 16 states. [2020-07-10 15:07:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,164 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-10 15:07:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-10 15:07:11,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:11,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:11,165 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 21 states. [2020-07-10 15:07:11,165 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 21 states. [2020-07-10 15:07:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,169 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-10 15:07:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-10 15:07:11,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:11,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:11,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:11,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:07:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-10 15:07:11,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2020-07-10 15:07:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:11,175 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-10 15:07:11,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:07:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-10 15:07:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:07:11,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:11,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:07:11,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:07:11,178 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 667002991, now seen corresponding path program 1 times [2020-07-10 15:07:11,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:11,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823212145] [2020-07-10 15:07:11,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:11,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-10 15:07:11,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-10 15:07:11,316 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #35#return; {135#true} is VALID [2020-07-10 15:07:11,317 INFO L263 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {144#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:07:11,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-10 15:07:11,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-10 15:07:11,318 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #35#return; {135#true} is VALID [2020-07-10 15:07:11,318 INFO L263 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2020-07-10 15:07:11,320 INFO L280 TraceCheckUtils]: 5: Hoare triple {135#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {140#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-10 15:07:11,321 INFO L280 TraceCheckUtils]: 6: Hoare triple {140#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {141#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-10 15:07:11,322 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {142#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-10 15:07:11,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {142#(not (= main_~pd~0.base |main_~#d2~0.base|))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); {142#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-10 15:07:11,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {142#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {143#(not |main_#t~short3|)} is VALID [2020-07-10 15:07:11,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {143#(not |main_#t~short3|)} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1);#t~short3 := 0 != #t~mem2; {136#false} is VALID [2020-07-10 15:07:11,325 INFO L280 TraceCheckUtils]: 11: Hoare triple {136#false} assume #t~short3;havoc #t~mem2;havoc #t~short3; {136#false} is VALID [2020-07-10 15:07:11,325 INFO L280 TraceCheckUtils]: 12: Hoare triple {136#false} assume !false; {136#false} is VALID [2020-07-10 15:07:11,326 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:07:11,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823212145] [2020-07-10 15:07:11,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:07:11,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:07:11,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692680737] [2020-07-10 15:07:11,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-10 15:07:11,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:11,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:07:11,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:11,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:07:11,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:11,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:07:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:07:11,348 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2020-07-10 15:07:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,562 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 15:07:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:07:11,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-10 15:07:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:07:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-10 15:07:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:07:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-10 15:07:11,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2020-07-10 15:07:11,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:11,602 INFO L225 Difference]: With dead ends: 23 [2020-07-10 15:07:11,602 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:07:11,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:07:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:07:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:07:11,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:11,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:07:11,613 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:07:11,613 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:07:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,615 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-10 15:07:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-10 15:07:11,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:11,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:11,616 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:07:11,616 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:07:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,617 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-10 15:07:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-10 15:07:11,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:11,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:11,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:11,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:07:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2020-07-10 15:07:11,620 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2020-07-10 15:07:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:11,621 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2020-07-10 15:07:11,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:07:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-10 15:07:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:07:11,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:11,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:07:11,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:07:11,622 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:11,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1851109901, now seen corresponding path program 1 times [2020-07-10 15:07:11,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:11,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692143553] [2020-07-10 15:07:11,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:11,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {231#true} is VALID [2020-07-10 15:07:11,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2020-07-10 15:07:11,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #35#return; {231#true} is VALID [2020-07-10 15:07:11,764 INFO L263 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {240#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:07:11,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {231#true} is VALID [2020-07-10 15:07:11,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2020-07-10 15:07:11,765 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #35#return; {231#true} is VALID [2020-07-10 15:07:11,765 INFO L263 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret4 := main(); {231#true} is VALID [2020-07-10 15:07:11,765 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {231#true} is VALID [2020-07-10 15:07:11,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {231#true} assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {236#(and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-10 15:07:11,773 INFO L280 TraceCheckUtils]: 7: Hoare triple {236#(and (= |main_#t~ite1.offset| |main_~#d2~0.offset|) (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {237#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-10 15:07:11,774 INFO L280 TraceCheckUtils]: 8: Hoare triple {237#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, ~pd~0.offset, 1); {238#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-10 15:07:11,775 INFO L280 TraceCheckUtils]: 9: Hoare triple {238#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {238#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} is VALID [2020-07-10 15:07:11,776 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|))} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, ~#d2~0.offset, 1);#t~short3 := 0 != #t~mem2; {239#(not |main_#t~short3|)} is VALID [2020-07-10 15:07:11,777 INFO L280 TraceCheckUtils]: 11: Hoare triple {239#(not |main_#t~short3|)} assume #t~short3;havoc #t~mem2;havoc #t~short3; {232#false} is VALID [2020-07-10 15:07:11,777 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#false} assume !false; {232#false} is VALID [2020-07-10 15:07:11,778 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:07:11,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692143553] [2020-07-10 15:07:11,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:07:11,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:07:11,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703690344] [2020-07-10 15:07:11,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-10 15:07:11,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:11,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:07:11,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:11,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:07:11,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:11,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:07:11,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:07:11,808 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 7 states. [2020-07-10 15:07:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,942 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-10 15:07:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:07:11,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-10 15:07:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:07:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2020-07-10 15:07:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:07:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2020-07-10 15:07:11,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2020-07-10 15:07:11,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:07:11,966 INFO L225 Difference]: With dead ends: 14 [2020-07-10 15:07:11,966 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:07:11,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:07:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:07:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:07:11,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:11,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:11,968 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:11,969 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:07:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:07:11,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:11,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:11,970 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:11,970 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:07:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:11,971 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:07:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:07:11,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:11,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:11,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:11,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:07:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:07:11,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-10 15:07:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:11,973 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:07:11,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:07:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:07:11,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:11,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:07:11,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:07:12,018 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:07:12,019 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:07:12,019 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:07:12,019 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:07:12,019 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:07:12,019 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:07:12,020 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:07:12,020 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 29) no Hoare annotation was computed. [2020-07-10 15:07:12,020 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-10 15:07:12,020 INFO L268 CegarLoopResult]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2020-07-10 15:07:12,020 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-10 15:07:12,021 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-10 15:07:12,021 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 29) no Hoare annotation was computed. [2020-07-10 15:07:12,021 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2020-07-10 15:07:12,021 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 29) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:07:12,021 INFO L264 CegarLoopResult]: At program point L22(lines 12 29) the Hoare annotation is: false [2020-07-10 15:07:12,022 INFO L268 CegarLoopResult]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-07-10 15:07:12,022 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 20) no Hoare annotation was computed. [2020-07-10 15:07:12,027 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:07:12,028 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:07:12,028 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:07:12,029 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:07:12,029 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:07:12,030 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:07:12,030 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:07:12,030 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:07:12,030 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-10 15:07:12,030 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 15:07:12,031 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 15:07:12,031 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-10 15:07:12,031 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:07:12,031 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:07:12,031 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 15:07:12,032 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 15:07:12,032 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:07:12,032 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:07:12,032 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:07:12,033 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:07:12,033 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:07:12,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:07:12 BoogieIcfgContainer [2020-07-10 15:07:12,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:07:12,046 INFO L168 Benchmark]: Toolchain (without parser) took 2494.55 ms. Allocated memory was 141.0 MB in the beginning and 232.8 MB in the end (delta: 91.8 MB). Free memory was 104.9 MB in the beginning and 91.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:12,047 INFO L168 Benchmark]: CDTParser took 3.26 ms. Allocated memory is still 141.0 MB. Free memory was 122.9 MB in the beginning and 122.7 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:07:12,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.25 ms. Allocated memory is still 141.0 MB. Free memory was 104.7 MB in the beginning and 94.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:12,049 INFO L168 Benchmark]: Boogie Preprocessor took 126.66 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 94.5 MB in the beginning and 181.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:12,050 INFO L168 Benchmark]: RCFGBuilder took 395.75 ms. Allocated memory is still 203.9 MB. Free memory was 181.7 MB in the beginning and 164.0 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:12,051 INFO L168 Benchmark]: TraceAbstraction took 1705.41 ms. Allocated memory was 203.9 MB in the beginning and 232.8 MB in the end (delta: 28.8 MB). Free memory was 163.4 MB in the beginning and 91.7 MB in the end (delta: 71.7 MB). Peak memory consumption was 100.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:07:12,055 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 3.26 ms. Allocated memory is still 141.0 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.25 ms. Allocated memory is still 141.0 MB. Free memory was 104.7 MB in the beginning and 94.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.66 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 94.5 MB in the beginning and 181.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 395.75 ms. Allocated memory is still 203.9 MB. Free memory was 181.7 MB in the beginning and 164.0 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1705.41 ms. Allocated memory was 203.9 MB in the beginning and 232.8 MB in the end (delta: 28.8 MB). Free memory was 163.4 MB in the beginning and 91.7 MB in the end (delta: 71.7 MB). Peak memory consumption was 100.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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 3 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 SDtfs, 26 SDslu, 70 SDs, 0 SdLazy, 116 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 16 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1356 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...