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/ldv-regression/test10_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:29,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:29,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:29,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:29,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:29,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:29,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:29,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:29,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:29,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:29,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:29,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:29,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:29,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:29,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:29,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:29,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:29,720 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:29,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:29,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:29,725 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:29,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:29,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:29,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:29,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:29,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:29,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:29,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:29,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:29,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:29,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:29,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:29,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:29,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:29,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:29,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:29,739 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 12:54:29,768 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:29,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:29,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:29,770 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:29,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:29,771 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:29,771 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:29,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:29,771 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:29,771 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:29,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:29,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:29,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:29,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:29,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:29,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:29,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:29,773 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:29,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:29,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:29,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:29,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:29,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:29,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:29,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:29,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:29,775 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:29,775 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:29,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:29,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:29,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:29,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:29,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:29,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:29,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:29,870 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:29,871 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test10_true-unreach-call_true-termination.c [2018-11-23 12:54:29,942 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4982604/ac60c2d7e8a24cd9b8223bd9290955e0/FLAG3d639306f [2018-11-23 12:54:30,356 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:30,357 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test10_true-unreach-call_true-termination.c [2018-11-23 12:54:30,363 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4982604/ac60c2d7e8a24cd9b8223bd9290955e0/FLAG3d639306f [2018-11-23 12:54:30,730 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4982604/ac60c2d7e8a24cd9b8223bd9290955e0 [2018-11-23 12:54:30,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:30,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:30,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:30,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:30,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:30,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:30" (1/1) ... [2018-11-23 12:54:30,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615fcdfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:30, skipping insertion in model container [2018-11-23 12:54:30,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:30" (1/1) ... [2018-11-23 12:54:30,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:30,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:31,005 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:31,028 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:31,061 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:31,089 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:31,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31 WrapperNode [2018-11-23 12:54:31,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:31,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:31,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:31,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:31,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:31,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:31,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:31,132 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:31,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (1/1) ... [2018-11-23 12:54:31,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:31,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:31,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:31,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:31,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (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 12:54:31,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:54:31,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:54:31,328 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 12:54:31,328 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 12:54:31,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:31,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:31,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 12:54:31,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:54:31,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:31,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:31,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:31,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:31,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:31,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:31,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:32,024 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:32,024 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:32,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:32 BoogieIcfgContainer [2018-11-23 12:54:32,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:32,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:32,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:32,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:32,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:30" (1/3) ... [2018-11-23 12:54:32,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1264e4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:32, skipping insertion in model container [2018-11-23 12:54:32,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:31" (2/3) ... [2018-11-23 12:54:32,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1264e4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:32, skipping insertion in model container [2018-11-23 12:54:32,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:32" (3/3) ... [2018-11-23 12:54:32,033 INFO L112 eAbstractionObserver]: Analyzing ICFG test10_true-unreach-call_true-termination.c [2018-11-23 12:54:32,044 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:32,052 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:32,072 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:32,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:32,108 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:32,108 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:32,108 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:32,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:32,109 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:32,109 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:32,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:32,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 12:54:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:54:32,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:32,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:32,151 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:32,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:32,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1020605804, now seen corresponding path program 1 times [2018-11-23 12:54:32,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:32,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:32,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:32,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:32,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:33,185 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-11-23 12:54:33,482 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 12:54:33,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 12:54:33,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#p1~0.base, ~#p1~0.offset, 4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#p2~0.base, ~#p2~0.offset, 4);~pp1~0.base, ~pp1~0.offset := 0, 0;~pp2~0.base, ~pp2~0.offset := 0, 0; {24#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:33,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} assume true; {24#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:33,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} {22#true} #25#return; {24#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:33,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} call #t~ret10 := main(); {24#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:33,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} havoc ~px~0.base, ~px~0.offset;call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);~pp1~0.base, ~pp1~0.offset := ~#p1~0.base, ~#p1~0.offset;~pp2~0.base, ~pp2~0.offset := ~#p2~0.base, ~#p2~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3; {25#(and (= ~pp1~0.offset |~#p1~0.offset|) (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#a~0.base| ~pp1~0.base)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#b~0.base| ~pp1~0.base)) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#a~0.base| |~#b~0.base|)))} is VALID [2018-11-23 12:54:33,723 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#(and (= ~pp1~0.offset |~#p1~0.offset|) (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#a~0.base| ~pp1~0.base)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#b~0.base| ~pp1~0.base)) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#a~0.base| |~#b~0.base|)))} call #t~ret4 := f(); {26#(and (= ~pp2~0.base |old(~pp2~0.base)|) (= (select |old(#memory_$Pointer$.base)| ~pp2~0.base) (select |#memory_$Pointer$.base| ~pp2~0.base)) (= (select |old(#memory_$Pointer$.offset)| ~pp2~0.base) (select |#memory_$Pointer$.offset| ~pp2~0.base)) (= ~pp2~0.offset |old(~pp2~0.offset)|))} is VALID [2018-11-23 12:54:33,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#(and (= ~pp2~0.base |old(~pp2~0.base)|) (= (select |old(#memory_$Pointer$.base)| ~pp2~0.base) (select |#memory_$Pointer$.base| ~pp2~0.base)) (= (select |old(#memory_$Pointer$.offset)| ~pp2~0.base) (select |#memory_$Pointer$.offset| ~pp2~0.base)) (= ~pp2~0.offset |old(~pp2~0.offset)|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~v~0 := #t~nondet0;havoc #t~nondet0;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~pp2~0.base, ~pp2~0.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~pp1~0.base, ~pp1~0.offset, 4);havoc #t~mem1.base, #t~mem1.offset;~pp2~0.base, ~pp2~0.offset := ~pp1~0.base, ~pp1~0.offset;#res := ~v~0; {27#(and (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.offset| ~pp1~0.base) ~pp1~0.offset)) (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.base| ~pp1~0.base) ~pp1~0.offset)))} is VALID [2018-11-23 12:54:33,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#(and (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.offset| ~pp1~0.base) ~pp1~0.offset)) (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.base| ~pp1~0.base) ~pp1~0.offset)))} assume true; {27#(and (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.offset| ~pp1~0.base) ~pp1~0.offset)) (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.base| ~pp1~0.base) ~pp1~0.offset)))} is VALID [2018-11-23 12:54:33,728 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {27#(and (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.offset| ~pp1~0.base) ~pp1~0.offset)) (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.base| ~pp1~0.base) ~pp1~0.offset)))} {25#(and (= ~pp1~0.offset |~#p1~0.offset|) (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#a~0.base| ~pp1~0.base)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#b~0.base| ~pp1~0.base)) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#a~0.base| |~#b~0.base|)))} #29#return; {28#(and (not (= |~#b~0.base| |~#p1~0.base|)) (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) |~#p1~0.offset|)) (not (= |~#a~0.base| |~#p1~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| |~#p1~0.base|) |~#p1~0.offset|)))} is VALID [2018-11-23 12:54:33,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#(and (not (= |~#b~0.base| |~#p1~0.base|)) (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) |~#p1~0.offset|)) (not (= |~#a~0.base| |~#p1~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| |~#p1~0.base|) |~#p1~0.offset|)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;call write~int(#t~ret4, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret4;call write~int(0, ~#a~0.base, ~#a~0.offset, 4);call write~int(0, ~#b~0.base, ~#b~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~pp2~0.base, ~pp2~0.offset, 4);~px~0.base, ~px~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;call write~int(7, ~#a~0.base, ~#a~0.offset, 4);call write~int(8, ~#b~0.base, ~#b~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4);#t~short9 := 8 != #t~mem7; {29#(not |main_#t~short9|)} is VALID [2018-11-23 12:54:33,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#(not |main_#t~short9|)} assume #t~short9; {23#false} is VALID [2018-11-23 12:54:33,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {23#false} assume #t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short9; {23#false} is VALID [2018-11-23 12:54:33,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 12:54:33,738 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 12:54:33,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:33,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:54:33,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 12:54:33,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:33,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:54:33,912 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 12:54:33,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:54:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:54:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:33,928 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 8 states. [2018-11-23 12:54:35,034 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-11-23 12:54:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:35,773 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:54:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:54:35,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 12:54:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2018-11-23 12:54:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2018-11-23 12:54:35,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 27 transitions. [2018-11-23 12:54:35,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:35,894 INFO L225 Difference]: With dead ends: 26 [2018-11-23 12:54:35,894 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 12:54:35,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:54:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 12:54:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 12:54:35,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:35,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 12:54:35,998 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 12:54:35,999 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 12:54:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:36,002 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-23 12:54:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 12:54:36,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:36,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:36,003 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 12:54:36,003 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 12:54:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:36,006 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-23 12:54:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 12:54:36,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:36,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:36,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:36,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:54:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2018-11-23 12:54:36,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 14 [2018-11-23 12:54:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:36,011 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2018-11-23 12:54:36,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:54:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 12:54:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:54:36,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:36,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:36,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:36,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1020603882, now seen corresponding path program 1 times [2018-11-23 12:54:36,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:36,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:36,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:36,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:36,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-23 12:54:36,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#p1~0.base, ~#p1~0.offset, 4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#p2~0.base, ~#p2~0.offset, 4);~pp1~0.base, ~pp1~0.offset := 0, 0;~pp2~0.base, ~pp2~0.offset := 0, 0; {134#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:36,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {134#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} assume true; {134#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:36,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {134#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} {132#true} #25#return; {134#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:36,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {134#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} call #t~ret10 := main(); {134#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:36,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {134#(and (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} havoc ~px~0.base, ~px~0.offset;call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);~pp1~0.base, ~pp1~0.offset := ~#p1~0.base, ~#p1~0.offset;~pp2~0.base, ~pp2~0.offset := ~#p2~0.base, ~#p2~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3; {135#(and (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| ~pp2~0.base) ~pp2~0.offset)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#b~0.base| ~pp1~0.base)) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:36,623 INFO L256 TraceCheckUtils]: 6: Hoare triple {135#(and (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| ~pp2~0.base) ~pp2~0.offset)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#b~0.base| ~pp1~0.base)) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} call #t~ret4 := f(); {136#(and (= ~pp2~0.base |old(~pp2~0.base)|) (= (select |old(#memory_$Pointer$.base)| ~pp2~0.base) (select |#memory_$Pointer$.base| ~pp2~0.base)) (= (select |old(#memory_$Pointer$.offset)| ~pp2~0.base) (select |#memory_$Pointer$.offset| ~pp2~0.base)) (= ~pp2~0.offset |old(~pp2~0.offset)|))} is VALID [2018-11-23 12:54:36,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {136#(and (= ~pp2~0.base |old(~pp2~0.base)|) (= (select |old(#memory_$Pointer$.base)| ~pp2~0.base) (select |#memory_$Pointer$.base| ~pp2~0.base)) (= (select |old(#memory_$Pointer$.offset)| ~pp2~0.base) (select |#memory_$Pointer$.offset| ~pp2~0.base)) (= ~pp2~0.offset |old(~pp2~0.offset)|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~v~0 := #t~nondet0;havoc #t~nondet0;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~pp2~0.base, ~pp2~0.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~pp1~0.base, ~pp1~0.offset, 4);havoc #t~mem1.base, #t~mem1.offset;~pp2~0.base, ~pp2~0.offset := ~pp1~0.base, ~pp1~0.offset;#res := ~v~0; {137#(and (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.base| ~pp1~0.base) ~pp2~0.offset)) (= ~pp1~0.base ~pp2~0.base) (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.offset| ~pp1~0.base) ~pp2~0.offset)))} is VALID [2018-11-23 12:54:36,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#(and (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.base| ~pp1~0.base) ~pp2~0.offset)) (= ~pp1~0.base ~pp2~0.base) (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.offset| ~pp1~0.base) ~pp2~0.offset)))} assume true; {137#(and (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.base| ~pp1~0.base) ~pp2~0.offset)) (= ~pp1~0.base ~pp2~0.base) (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.offset| ~pp1~0.base) ~pp2~0.offset)))} is VALID [2018-11-23 12:54:36,630 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {137#(and (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.base| ~pp1~0.base) ~pp2~0.offset)) (= ~pp1~0.base ~pp2~0.base) (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) (select (select |#memory_$Pointer$.offset| ~pp1~0.base) ~pp2~0.offset)))} {135#(and (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| ~pp2~0.base) ~pp2~0.offset)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) ~pp2~0.offset)) (not (= |~#b~0.base| ~pp1~0.base)) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} #29#return; {138#(and (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) ~pp2~0.offset)) (= ~pp2~0.base |~#p1~0.base|) (not (= ~pp2~0.base |~#b~0.base|)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| |~#p1~0.base|) ~pp2~0.offset)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} is VALID [2018-11-23 12:54:36,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {138#(and (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) ~pp2~0.offset)) (= ~pp2~0.base |~#p1~0.base|) (not (= ~pp2~0.base |~#b~0.base|)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| |~#p1~0.base|) ~pp2~0.offset)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;call write~int(#t~ret4, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret4;call write~int(0, ~#a~0.base, ~#a~0.offset, 4);call write~int(0, ~#b~0.base, ~#b~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~pp2~0.base, ~pp2~0.offset, 4);~px~0.base, ~px~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;call write~int(7, ~#a~0.base, ~#a~0.offset, 4);call write~int(8, ~#b~0.base, ~#b~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4);#t~short9 := 8 != #t~mem7; {139#(= 8 (select (select |#memory_int| main_~px~0.base) main_~px~0.offset))} is VALID [2018-11-23 12:54:36,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {139#(= 8 (select (select |#memory_int| main_~px~0.base) main_~px~0.offset))} assume !#t~short9;call #t~mem8 := read~int(~px~0.base, ~px~0.offset, 4);#t~short9 := 8 != #t~mem8; {140#(not |main_#t~short9|)} is VALID [2018-11-23 12:54:36,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {140#(not |main_#t~short9|)} assume #t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short9; {133#false} is VALID [2018-11-23 12:54:36,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-23 12:54:36,638 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 12:54:36,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:36,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 12:54:36,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-11-23 12:54:36,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:36,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:54:36,747 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 12:54:36,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:54:36,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:54:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:36,748 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 9 states. [2018-11-23 12:54:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,004 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-23 12:54:38,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:54:38,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-11-23 12:54:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:54:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 12:54:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:54:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 12:54:38,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 14 transitions. [2018-11-23 12:54:38,071 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 12:54:38,071 INFO L225 Difference]: With dead ends: 15 [2018-11-23 12:54:38,072 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:54:38,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:54:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:54:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:54:38,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:38,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,075 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,075 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,075 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:38,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:38,076 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,076 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,077 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:38,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:38,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:38,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:54:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:54:38,079 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-11-23 12:54:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:38,079 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:54:38,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:54:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:38,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:54:38,432 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2018-11-23 12:54:38,522 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:38,522 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~pp2~0.base |old(~pp2~0.base)|) (= ~pp2~0.offset |old(~pp2~0.offset)|)) [2018-11-23 12:54:38,523 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:38,523 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 9 14) no Hoare annotation was computed. [2018-11-23 12:54:38,523 INFO L444 ceAbstractionStarter]: At program point fENTRY(lines 9 14) the Hoare annotation is: (or (and (= (select |old(#memory_$Pointer$.base)| ~pp2~0.base) (select |#memory_$Pointer$.base| ~pp2~0.base)) (= ~pp2~0.offset |old(~pp2~0.offset)|) (= ~pp2~0.base |old(~pp2~0.base)|) (= (select |old(#memory_$Pointer$.offset)| ~pp2~0.base) (select |#memory_$Pointer$.offset| ~pp2~0.base))) (not (= ~pp1~0.base |~#p1~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) |~#b~0.base|)) (= |~#a~0.base| |~#b~0.base|) (= |~#p2~0.base| |~#b~0.base|) (= |~#a~0.base| |~#p1~0.base|) (= |~#p2~0.base| |~#a~0.base|) (not (= ~pp1~0.offset |~#p1~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|) |~#b~0.offset|)) (= ~pp1~0.base |~#b~0.base|)) [2018-11-23 12:54:38,523 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 9 14) no Hoare annotation was computed. [2018-11-23 12:54:38,523 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:38,524 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#a~0.base| |~#b~0.base|)) (not (= |~#p1~0.base| |~#a~0.base|))) [2018-11-23 12:54:38,524 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:54:38,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:38,524 INFO L444 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (= |~#p2~0.base| |~#b~0.base|) (= |~#a~0.base| |~#p1~0.base|) (= |~#p2~0.base| |~#a~0.base|) (and (= ~pp1~0.offset |~#p1~0.offset|) (= |~#b~0.offset| (select (select |#memory_$Pointer$.offset| ~pp2~0.base) ~pp2~0.offset)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) ~pp2~0.offset)) (= |~#p1~0.base| ~pp1~0.base)) (= |~#p1~0.base| |~#b~0.base|)) [2018-11-23 12:54:38,524 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2018-11-23 12:54:38,525 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 16 49) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (= |~#p2~0.base| |~#b~0.base|) (= |~#a~0.base| |~#p1~0.base|) (= |~#p2~0.base| |~#a~0.base|) (and (= ~pp2~0.base |old(~pp2~0.base)|) (= (select |old(#memory_$Pointer$.base)| ~pp2~0.base) (select |#memory_$Pointer$.base| ~pp2~0.base)) (= (select |old(#memory_$Pointer$.offset)| ~pp2~0.base) (select |#memory_$Pointer$.offset| ~pp2~0.base)) (= ~pp2~0.offset |old(~pp2~0.offset)|)) (= |~#p1~0.base| |~#b~0.base|)) [2018-11-23 12:54:38,525 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2018-11-23 12:54:38,525 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 16 49) no Hoare annotation was computed. [2018-11-23 12:54:38,525 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 16 49) no Hoare annotation was computed. [2018-11-23 12:54:38,525 INFO L444 ceAbstractionStarter]: At program point L42(lines 16 49) the Hoare annotation is: (or (= |~#a~0.base| |~#b~0.base|) (= |~#p2~0.base| |~#b~0.base|) (= |~#a~0.base| |~#p1~0.base|) (= |~#p2~0.base| |~#a~0.base|) (= |~#p1~0.base| |~#b~0.base|)) [2018-11-23 12:54:38,525 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-23 12:54:38,525 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 41 43) no Hoare annotation was computed. [2018-11-23 12:54:38,528 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:38,528 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-23 12:54:38,531 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:38,532 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-23 12:54:38,532 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:38,534 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-23 12:54:38,536 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:38,536 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 12:54:38,536 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:38,536 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-23 12:54:38,537 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:54:38,537 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:54:38,537 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-23 12:54:38,537 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-23 12:54:38,537 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:54:38,538 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:38,538 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:38,538 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:38,538 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:54:38,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:38 BoogieIcfgContainer [2018-11-23 12:54:38,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:38,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:38,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:38,552 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:38,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:32" (3/4) ... [2018-11-23 12:54:38,557 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:54:38,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:54:38,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-23 12:54:38,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:54:38,572 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 12:54:38,572 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:54:38,573 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:54:38,640 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test10_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:38,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:38,642 INFO L168 Benchmark]: Toolchain (without parser) took 7901.01 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.5 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -228.1 MB). Peak memory consumption was 474.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:38,643 INFO L168 Benchmark]: CDTParser took 0.26 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 12:54:38,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.57 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 12:54:38,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.03 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 12:54:38,648 INFO L168 Benchmark]: Boogie Preprocessor took 55.14 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 12:54:38,648 INFO L168 Benchmark]: RCFGBuilder took 837.35 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:38,649 INFO L168 Benchmark]: TraceAbstraction took 6525.79 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 502.9 MB). Peak memory consumption was 502.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:38,650 INFO L168 Benchmark]: Witness Printer took 88.69 ms. Allocated memory is still 2.2 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:38,655 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.26 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. * CACSL2BoogieTranslator took 347.57 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 40.03 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 55.14 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 837.35 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6525.79 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 502.9 MB). Peak memory consumption was 502.9 MB. Max. memory is 7.1 GB. * Witness Printer took 88.69 ms. Allocated memory is still 2.2 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: 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: 16]: Loop Invariant Derived loop invariant: (((a == b || p2 == b) || a == p1) || p2 == a) || p1 == b - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 6.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 20 SDslu, 53 SDs, 0 SdLazy, 81 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 180 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 5772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...