java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_24_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:24,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:24,647 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:24,662 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:24,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:24,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:24,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:24,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:24,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:24,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:24,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:24,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:24,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:24,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:24,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:24,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:24,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:24,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:24,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:24,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:24,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:24,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:24,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:24,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:24,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:24,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:24,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:24,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:24,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:24,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:24,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:24,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:24,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:24,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:24,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:24,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:24,704 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:58:24,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:24,733 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:24,735 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:24,735 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:24,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:24,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:24,736 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:24,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:24,737 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:24,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:24,737 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:24,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:24,738 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:24,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:24,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:24,739 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:24,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:24,740 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:24,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:24,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:24,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:24,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:24,742 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:24,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:24,742 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:24,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:24,743 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:24,743 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:24,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:24,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:24,744 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:24,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:24,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:24,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:24,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:24,832 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:24,833 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 11:58:24,901 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9435350e9/f1ec735cfd924b7e929f1a18d31bdc58/FLAG746b9c207 [2018-11-23 11:58:25,395 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:25,396 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 11:58:25,406 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9435350e9/f1ec735cfd924b7e929f1a18d31bdc58/FLAG746b9c207 [2018-11-23 11:58:25,745 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9435350e9/f1ec735cfd924b7e929f1a18d31bdc58 [2018-11-23 11:58:25,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:25,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:25,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:25,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:25,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:25,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:25" (1/1) ... [2018-11-23 11:58:25,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f55dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:25, skipping insertion in model container [2018-11-23 11:58:25,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:25" (1/1) ... [2018-11-23 11:58:25,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:25,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:26,032 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:26,037 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:26,066 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:26,097 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:26,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26 WrapperNode [2018-11-23 11:58:26,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:26,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:26,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:26,099 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:26,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:26,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:26,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:26,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:26,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (1/1) ... [2018-11-23 11:58:26,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:26,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:26,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:26,187 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:26,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (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 [2018-11-23 11:58:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:26,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure printOdd [2018-11-23 11:58:26,330 INFO L138 BoogieDeclarations]: Found implementation of procedure printOdd [2018-11-23 11:58:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:26,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure printEven [2018-11-23 11:58:26,330 INFO L138 BoogieDeclarations]: Found implementation of procedure printEven [2018-11-23 11:58:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:26,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:26,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:27,021 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:27,021 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:58:27,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:27 BoogieIcfgContainer [2018-11-23 11:58:27,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:27,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:27,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:27,027 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:27,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:25" (1/3) ... [2018-11-23 11:58:27,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794e9b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:27, skipping insertion in model container [2018-11-23 11:58:27,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:26" (2/3) ... [2018-11-23 11:58:27,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794e9b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:27, skipping insertion in model container [2018-11-23 11:58:27,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:27" (3/3) ... [2018-11-23 11:58:27,031 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 11:58:27,041 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:27,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:27,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:27,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:27,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:27,103 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:27,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:27,104 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:27,104 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:27,104 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:27,104 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:27,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 11:58:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:58:27,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:27,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:27,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:27,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1836635640, now seen corresponding path program 1 times [2018-11-23 11:58:27,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:27,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:27,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:27,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:27,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:27,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 11:58:27,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 11:58:27,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 11:58:27,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #69#return; {39#true} is VALID [2018-11-23 11:58:27,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret7 := main(); {39#true} is VALID [2018-11-23 11:58:27,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {39#true} is VALID [2018-11-23 11:58:27,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !!(~i~0 < ~num~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {41#(= |main_#t~mem2| (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 11:58:27,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#(= |main_#t~mem2| (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* 4 main_~i~0))))} assume 0 == (if #t~mem2 < 0 && 0 != #t~mem2 % 2 then #t~mem2 % 2 - 2 else #t~mem2 % 2);havoc #t~mem2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42#(<= |main_#t~mem3| (* 2 (div |main_#t~mem3| 2)))} is VALID [2018-11-23 11:58:27,964 INFO L256 TraceCheckUtils]: 8: Hoare triple {42#(<= |main_#t~mem3| (* 2 (div |main_#t~mem3| 2)))} call printEven(#t~mem3); {43#(<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))} is VALID [2018-11-23 11:58:27,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#(<= |printEven_#in~i| (* 2 (div |printEven_#in~i| 2)))} ~i := #in~i; {44#(<= printEven_~i (* 2 (div printEven_~i 2)))} is VALID [2018-11-23 11:58:27,967 INFO L256 TraceCheckUtils]: 10: Hoare triple {44#(<= printEven_~i (* 2 (div printEven_~i 2)))} call __VERIFIER_assert((if 0 == (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {45#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:58:27,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {45#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {46#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:58:27,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {40#false} is VALID [2018-11-23 11:58:27,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 11:58:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:27,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:27,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:58:27,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 11:58:27,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:27,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:28,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:28,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:28,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:28,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:28,056 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 8 states. [2018-11-23 11:58:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:29,231 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2018-11-23 11:58:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:29,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 11:58:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-23 11:58:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-23 11:58:29,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2018-11-23 11:58:29,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:29,448 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:58:29,449 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:58:29,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:58:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 11:58:29,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:29,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 11:58:29,532 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:58:29,532 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:58:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:29,537 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 11:58:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:58:29,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:29,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:29,539 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:58:29,539 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:58:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:29,544 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 11:58:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:58:29,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:29,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:29,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:29,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:58:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-23 11:58:29,551 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2018-11-23 11:58:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:29,551 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-23 11:58:29,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:58:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:58:29,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:29,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:29,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:29,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:29,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1211296837, now seen corresponding path program 1 times [2018-11-23 11:58:29,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:29,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:29,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:29,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:29,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {265#true} call ULTIMATE.init(); {265#true} is VALID [2018-11-23 11:58:29,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {265#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {265#true} is VALID [2018-11-23 11:58:29,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {265#true} assume true; {265#true} is VALID [2018-11-23 11:58:29,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {265#true} {265#true} #69#return; {265#true} is VALID [2018-11-23 11:58:29,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {265#true} call #t~ret7 := main(); {265#true} is VALID [2018-11-23 11:58:29,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {265#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {267#(= main_~i~0 0)} is VALID [2018-11-23 11:58:29,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {267#(= main_~i~0 0)} assume !(~i~0 < ~num~0); {268#(<= main_~num~0 0)} is VALID [2018-11-23 11:58:29,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {268#(<= main_~num~0 0)} ~i~0 := 0; {269#(and (<= main_~num~0 0) (= main_~i~0 0))} is VALID [2018-11-23 11:58:29,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {269#(and (<= main_~num~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~num~0);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {266#false} is VALID [2018-11-23 11:58:29,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {266#false} assume 0 != (if #t~mem5 < 0 && 0 != #t~mem5 % 2 then #t~mem5 % 2 - 2 else #t~mem5 % 2);havoc #t~mem5;call #t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {266#false} is VALID [2018-11-23 11:58:29,721 INFO L256 TraceCheckUtils]: 10: Hoare triple {266#false} call printOdd(#t~mem6); {266#false} is VALID [2018-11-23 11:58:29,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {266#false} ~i := #in~i; {266#false} is VALID [2018-11-23 11:58:29,722 INFO L256 TraceCheckUtils]: 12: Hoare triple {266#false} call __VERIFIER_assert((if 0 != (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {266#false} is VALID [2018-11-23 11:58:29,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {266#false} ~cond := #in~cond; {266#false} is VALID [2018-11-23 11:58:29,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {266#false} assume 0 == ~cond; {266#false} is VALID [2018-11-23 11:58:29,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {266#false} assume !false; {266#false} is VALID [2018-11-23 11:58:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:29,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:29,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:58:29,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:58:29,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:29,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:58:29,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:29,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:58:29,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:58:29,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:29,780 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2018-11-23 11:58:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,028 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-23 11:58:30,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:30,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:58:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:58:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:58:30,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-23 11:58:30,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:30,172 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:58:30,172 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:58:30,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:58:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-11-23 11:58:30,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:30,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 36 states. [2018-11-23 11:58:30,233 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 36 states. [2018-11-23 11:58:30,233 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 36 states. [2018-11-23 11:58:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,238 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:58:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 11:58:30,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:30,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:30,240 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 45 states. [2018-11-23 11:58:30,240 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 45 states. [2018-11-23 11:58:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,245 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:58:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 11:58:30,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:30,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:30,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:30,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:58:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-23 11:58:30,249 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 16 [2018-11-23 11:58:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:30,249 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 11:58:30,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:58:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 11:58:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:58:30,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:30,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:30,251 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:30,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 308392718, now seen corresponding path program 1 times [2018-11-23 11:58:30,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:30,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:30,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:30,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:30,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:30,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {499#true} call ULTIMATE.init(); {499#true} is VALID [2018-11-23 11:58:30,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {499#true} is VALID [2018-11-23 11:58:30,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {499#true} assume true; {499#true} is VALID [2018-11-23 11:58:30,451 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {499#true} {499#true} #69#return; {499#true} is VALID [2018-11-23 11:58:30,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {499#true} call #t~ret7 := main(); {499#true} is VALID [2018-11-23 11:58:30,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {499#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~num~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {499#true} is VALID [2018-11-23 11:58:30,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {499#true} assume !!(~i~0 < ~num~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {499#true} is VALID [2018-11-23 11:58:30,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {499#true} assume !(0 == (if #t~mem2 < 0 && 0 != #t~mem2 % 2 then #t~mem2 % 2 - 2 else #t~mem2 % 2));havoc #t~mem2; {499#true} is VALID [2018-11-23 11:58:30,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {499#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {499#true} is VALID [2018-11-23 11:58:30,454 INFO L273 TraceCheckUtils]: 9: Hoare triple {499#true} assume !(~i~0 < ~num~0); {499#true} is VALID [2018-11-23 11:58:30,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {499#true} ~i~0 := 0; {499#true} is VALID [2018-11-23 11:58:30,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {499#true} assume !!(~i~0 < ~num~0);call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {501#(= |main_#t~mem5| (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 11:58:30,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {501#(= |main_#t~mem5| (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* 4 main_~i~0))))} assume 0 != (if #t~mem5 < 0 && 0 != #t~mem5 % 2 then #t~mem5 % 2 - 2 else #t~mem5 % 2);havoc #t~mem5;call #t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {502#(<= (+ |main_#t~mem6| 1) (* 2 (div (+ |main_#t~mem6| 1) 2)))} is VALID [2018-11-23 11:58:30,457 INFO L256 TraceCheckUtils]: 13: Hoare triple {502#(<= (+ |main_#t~mem6| 1) (* 2 (div (+ |main_#t~mem6| 1) 2)))} call printOdd(#t~mem6); {503#(<= (+ |printOdd_#in~i| 1) (* 2 (div (+ |printOdd_#in~i| 1) 2)))} is VALID [2018-11-23 11:58:30,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {503#(<= (+ |printOdd_#in~i| 1) (* 2 (div (+ |printOdd_#in~i| 1) 2)))} ~i := #in~i; {504#(<= (+ (* 2 (div printOdd_~i 2)) 1) printOdd_~i)} is VALID [2018-11-23 11:58:30,466 INFO L256 TraceCheckUtils]: 15: Hoare triple {504#(<= (+ (* 2 (div printOdd_~i 2)) 1) printOdd_~i)} call __VERIFIER_assert((if 0 != (if ~i < 0 && 0 != ~i % 2 then ~i % 2 - 2 else ~i % 2) then 1 else 0)); {505#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:58:30,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {505#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {506#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:58:30,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {506#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {500#false} is VALID [2018-11-23 11:58:30,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {500#false} assume !false; {500#false} is VALID [2018-11-23 11:58:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:58:30,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:30,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:58:30,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:58:30,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:30,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:30,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:30,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:30,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:30,512 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 8 states. [2018-11-23 11:58:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,952 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 11:58:30,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:30,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:58:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2018-11-23 11:58:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2018-11-23 11:58:30,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2018-11-23 11:58:31,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:31,130 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:58:31,130 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:58:31,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:58:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:58:31,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:31,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:58:31,132 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:58:31,132 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:58:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,132 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:58:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:58:31,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:31,133 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:58:31,133 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:58:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,134 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:58:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:58:31,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:31,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:31,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:58:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:58:31,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-11-23 11:58:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:31,136 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:58:31,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:58:31,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:58:31,301 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-23 11:58:31,350 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:58:31,350 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:58:31,350 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:58:31,351 INFO L451 ceAbstractionStarter]: At program point printOddENTRY(lines 7 9) the Hoare annotation is: true [2018-11-23 11:58:31,351 INFO L444 ceAbstractionStarter]: At program point L8(line 8) the Hoare annotation is: (or (<= (+ (* 2 (div printOdd_~i 2)) 1) printOdd_~i) (let ((.cse0 (+ |printOdd_#in~i| 1))) (< (* 2 (div .cse0 2)) .cse0))) [2018-11-23 11:58:31,351 INFO L448 ceAbstractionStarter]: For program point printOddFINAL(lines 7 9) no Hoare annotation was computed. [2018-11-23 11:58:31,351 INFO L448 ceAbstractionStarter]: For program point printOddEXIT(lines 7 9) no Hoare annotation was computed. [2018-11-23 11:58:31,351 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:58:31,351 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:58:31,351 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:58:31,351 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:58:31,352 INFO L448 ceAbstractionStarter]: For program point printEvenEXIT(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:58:31,352 INFO L451 ceAbstractionStarter]: At program point printEvenENTRY(lines 4 6) the Hoare annotation is: true [2018-11-23 11:58:31,352 INFO L448 ceAbstractionStarter]: For program point printEvenFINAL(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:58:31,352 INFO L444 ceAbstractionStarter]: At program point L5(line 5) the Hoare annotation is: (or (< (* 2 (div |printEven_#in~i| 2)) |printEven_#in~i|) (<= printEven_~i (* 2 (div printEven_~i 2)))) [2018-11-23 11:58:31,352 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 30) no Hoare annotation was computed. [2018-11-23 11:58:31,352 INFO L444 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: (<= |main_#t~mem3| (* 2 (div |main_#t~mem3| 2))) [2018-11-23 11:58:31,352 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-23 11:58:31,352 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 20) no Hoare annotation was computed. [2018-11-23 11:58:31,352 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 21) no Hoare annotation was computed. [2018-11-23 11:58:31,353 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 30) no Hoare annotation was computed. [2018-11-23 11:58:31,353 INFO L451 ceAbstractionStarter]: At program point L15-3(lines 15 21) the Hoare annotation is: true [2018-11-23 11:58:31,353 INFO L448 ceAbstractionStarter]: For program point L15-4(lines 15 21) no Hoare annotation was computed. [2018-11-23 11:58:31,353 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 30) the Hoare annotation is: true [2018-11-23 11:58:31,353 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (+ |main_#t~mem6| 1))) (<= .cse0 (* 2 (div .cse0 2)))) [2018-11-23 11:58:31,353 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-23 11:58:31,353 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2018-11-23 11:58:31,354 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 22 28) no Hoare annotation was computed. [2018-11-23 11:58:31,354 INFO L451 ceAbstractionStarter]: At program point L22-3(lines 22 28) the Hoare annotation is: true [2018-11-23 11:58:31,354 INFO L448 ceAbstractionStarter]: For program point L22-4(lines 22 28) no Hoare annotation was computed. [2018-11-23 11:58:31,354 INFO L448 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2018-11-23 11:58:31,354 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2018-11-23 11:58:31,354 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2018-11-23 11:58:31,354 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2018-11-23 11:58:31,354 INFO L448 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2018-11-23 11:58:31,355 INFO L448 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2018-11-23 11:58:31,356 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:58:31,358 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:58:31,358 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:58:31,358 WARN L170 areAnnotationChecker]: printOddFINAL has no Hoare annotation [2018-11-23 11:58:31,358 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:58:31,359 WARN L170 areAnnotationChecker]: printEvenFINAL has no Hoare annotation [2018-11-23 11:58:31,359 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2018-11-23 11:58:31,359 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2018-11-23 11:58:31,359 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:58:31,359 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:58:31,359 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:58:31,359 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:58:31,359 WARN L170 areAnnotationChecker]: printOddFINAL has no Hoare annotation [2018-11-23 11:58:31,360 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:58:31,360 WARN L170 areAnnotationChecker]: printEvenFINAL has no Hoare annotation [2018-11-23 11:58:31,360 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2018-11-23 11:58:31,360 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:58:31,360 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:58:31,360 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2018-11-23 11:58:31,360 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2018-11-23 11:58:31,361 WARN L170 areAnnotationChecker]: L3-3 has no Hoare annotation [2018-11-23 11:58:31,361 WARN L170 areAnnotationChecker]: printOddEXIT has no Hoare annotation [2018-11-23 11:58:31,361 WARN L170 areAnnotationChecker]: printEvenEXIT has no Hoare annotation [2018-11-23 11:58:31,361 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2018-11-23 11:58:31,361 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2018-11-23 11:58:31,361 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:58:31,361 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 11:58:31,362 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:58:31,363 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-23 11:58:31,363 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:58:31,363 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:58:31,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:58:31 BoogieIcfgContainer [2018-11-23 11:58:31,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:58:31,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:58:31,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:58:31,370 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:58:31,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:27" (3/4) ... [2018-11-23 11:58:31,374 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:58:31,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:58:31,380 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure printOdd [2018-11-23 11:58:31,380 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure printEven [2018-11-23 11:58:31,380 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:58:31,380 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:58:31,385 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 11:58:31,385 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 11:58:31,385 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:58:31,437 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:58:31,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:58:31,439 INFO L168 Benchmark]: Toolchain (without parser) took 5683.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -467.4 MB). Peak memory consumption was 246.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:58:31,440 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:58:31,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:58:31,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:58:31,441 INFO L168 Benchmark]: Boogie Preprocessor took 53.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:58:31,442 INFO L168 Benchmark]: RCFGBuilder took 835.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -746.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:58:31,443 INFO L168 Benchmark]: TraceAbstraction took 4345.78 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.7 MB). Peak memory consumption was 268.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:58:31,443 INFO L168 Benchmark]: Witness Printer took 67.83 ms. Allocated memory is still 2.2 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:58:31,447 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 341.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 835.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -746.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4345.78 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.7 MB). Peak memory consumption was 268.7 MB. Max. memory is 7.1 GB. * Witness Printer took 67.83 ms. Allocated memory is still 2.2 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 92 SDtfs, 26 SDslu, 392 SDs, 0 SdLazy, 127 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 23 PreInvPairs, 29 NumberOfFragments, 65 HoareAnnotationTreeSize, 23 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 2040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...