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/test05_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:29,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:29,345 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:29,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:29,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:29,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:29,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:29,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:29,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:29,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:29,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:29,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:29,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:29,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:29,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:29,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:29,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:29,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:29,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:29,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:29,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:29,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:29,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:29,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:29,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:29,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:29,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:29,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:29,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:29,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:29,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:29,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:29,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:29,414 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:29,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:29,416 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:29,416 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,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:29,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:29,432 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:29,432 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:29,433 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:29,433 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:29,434 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:29,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:29,434 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:29,434 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:29,434 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:29,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:29,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:29,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:29,435 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:29,435 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:29,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:29,436 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:29,436 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:29,436 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:29,436 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:29,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:29,437 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:29,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:29,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:29,437 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:29,437 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:29,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:29,441 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:29,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:29,441 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:29,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:29,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:29,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:29,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:29,533 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:29,533 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c [2018-11-23 12:54:29,599 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/123b28873/de91c3afdbf24656ad12d88ac89ae48d/FLAG6ae1f5b8a [2018-11-23 12:54:30,102 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:30,103 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c [2018-11-23 12:54:30,110 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/123b28873/de91c3afdbf24656ad12d88ac89ae48d/FLAG6ae1f5b8a [2018-11-23 12:54:30,453 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/123b28873/de91c3afdbf24656ad12d88ac89ae48d [2018-11-23 12:54:30,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:30,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:30,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:30,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:30,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:30,472 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,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c04e15c 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,475 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,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:30,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:30,699 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:30,714 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:30,748 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:30,769 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:30,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:30 WrapperNode [2018-11-23 12:54:30,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:30,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:30,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:30,771 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:30,780 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:30" (1/1) ... [2018-11-23 12:54:30,790 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:30" (1/1) ... [2018-11-23 12:54:30,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:30,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:30,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:30,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:30,807 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:30" (1/1) ... [2018-11-23 12:54:30,807 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:30" (1/1) ... [2018-11-23 12:54:30,809 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:30" (1/1) ... [2018-11-23 12:54:30,810 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:30" (1/1) ... [2018-11-23 12:54:30,823 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:30" (1/1) ... [2018-11-23 12:54:30,826 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:30" (1/1) ... [2018-11-23 12:54:30,827 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:30" (1/1) ... [2018-11-23 12:54:30,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:30,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:30,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:30,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:30,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:30" (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:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:54:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:30,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 12:54:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 12:54:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-23 12:54:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-23 12:54:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:30,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:30,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:30,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:54:30,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:31,616 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:31,617 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:31,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:31 BoogieIcfgContainer [2018-11-23 12:54:31,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:31,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:31,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:31,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:31,622 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:31,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c1337f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:31, skipping insertion in model container [2018-11-23 12:54:31,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:30" (2/3) ... [2018-11-23 12:54:31,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c1337f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:31, skipping insertion in model container [2018-11-23 12:54:31,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:31" (3/3) ... [2018-11-23 12:54:31,626 INFO L112 eAbstractionObserver]: Analyzing ICFG test05_true-unreach-call_true-termination.c [2018-11-23 12:54:31,637 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:31,645 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:31,664 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:31,699 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:31,700 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:31,701 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:31,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:31,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:31,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:31,702 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:31,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:31,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:54:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:54:31,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:31,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:31,732 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:31,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:31,738 INFO L82 PathProgramCache]: Analyzing trace with hash -685779266, now seen corresponding path program 1 times [2018-11-23 12:54:31,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:31,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:31,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:31,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:31,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:32,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:54:32,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:54:32,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:32,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #34#return; {28#true} is VALID [2018-11-23 12:54:32,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2018-11-23 12:54:32,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);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);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;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {30#(= 4 |main_#t~mem4|)} is VALID [2018-11-23 12:54:32,288 INFO L256 TraceCheckUtils]: 6: Hoare triple {30#(= 4 |main_#t~mem4|)} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {28#true} is VALID [2018-11-23 12:54:32,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {31#(= f_~a |f_#in~a|)} is VALID [2018-11-23 12:54:32,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#(= f_~a |f_#in~a|)} assume !(4 == ~a);#res := 0; {32#(not (= 4 |f_#in~a|))} is VALID [2018-11-23 12:54:32,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#(not (= 4 |f_#in~a|))} assume true; {32#(not (= 4 |f_#in~a|))} is VALID [2018-11-23 12:54:32,296 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {32#(not (= 4 |f_#in~a|))} {30#(= 4 |main_#t~mem4|)} #38#return; {29#false} is VALID [2018-11-23 12:54:32,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {29#false} is VALID [2018-11-23 12:54:32,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume 1 != #t~mem6;havoc #t~mem6; {29#false} is VALID [2018-11-23 12:54:32,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:54:32,300 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:32,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:32,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:54:32,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:54:32,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:32,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:54:32,382 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:32,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:54:32,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:54:32,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:32,395 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2018-11-23 12:54:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,220 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 12:54:33,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:54:33,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:54:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 12:54:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 12:54:33,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-23 12:54:33,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:33,400 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:54:33,400 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:54:33,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:54:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:54:33,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:33,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:33,570 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:33,570 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,575 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:54:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:54:33,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:33,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:33,576 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:33,576 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,581 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:54:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:54:33,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:33,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:33,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:33,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 12:54:33,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 12:54:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:33,588 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 12:54:33,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:54:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:54:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:54:33,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:33,589 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 12:54:33,590 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:33,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash 636648720, now seen corresponding path program 1 times [2018-11-23 12:54:33,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:33,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:33,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:33,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:33,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:33,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2018-11-23 12:54:33,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {155#true} is VALID [2018-11-23 12:54:33,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {155#true} assume true; {155#true} is VALID [2018-11-23 12:54:33,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} #34#return; {155#true} is VALID [2018-11-23 12:54:33,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {155#true} call #t~ret9 := main(); {155#true} is VALID [2018-11-23 12:54:33,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);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);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;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {155#true} is VALID [2018-11-23 12:54:33,869 INFO L256 TraceCheckUtils]: 6: Hoare triple {155#true} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {155#true} is VALID [2018-11-23 12:54:33,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {155#true} is VALID [2018-11-23 12:54:33,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {155#true} assume 4 == ~a; {155#true} is VALID [2018-11-23 12:54:33,870 INFO L256 TraceCheckUtils]: 9: Hoare triple {155#true} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {155#true} is VALID [2018-11-23 12:54:33,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {155#true} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {155#true} is VALID [2018-11-23 12:54:33,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {155#true} assume true; {155#true} is VALID [2018-11-23 12:54:33,871 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {155#true} {155#true} #32#return; {155#true} is VALID [2018-11-23 12:54:33,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {155#true} #res := 1; {157#(= 1 |f_#res|)} is VALID [2018-11-23 12:54:33,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {157#(= 1 |f_#res|)} assume true; {157#(= 1 |f_#res|)} is VALID [2018-11-23 12:54:33,874 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {157#(= 1 |f_#res|)} {155#true} #38#return; {158#(= 1 |main_#t~ret5|)} is VALID [2018-11-23 12:54:33,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {158#(= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {159#(= |main_#t~mem6| 1)} is VALID [2018-11-23 12:54:33,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {159#(= |main_#t~mem6| 1)} assume 1 != #t~mem6;havoc #t~mem6; {156#false} is VALID [2018-11-23 12:54:33,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {156#false} assume !false; {156#false} is VALID [2018-11-23 12:54:33,882 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,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:33,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:54:33,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:54:33,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:33,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:54:33,945 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 12:54:33,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:54:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:54:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:33,947 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 5 states. [2018-11-23 12:54:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:34,134 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2018-11-23 12:54:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:54:34,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:54:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-23 12:54:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-23 12:54:34,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2018-11-23 12:54:34,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:34,177 INFO L225 Difference]: With dead ends: 23 [2018-11-23 12:54:34,177 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:54:34,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:54:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:54:34,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:34,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:34,193 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:34,193 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:34,195 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 12:54:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-23 12:54:34,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:34,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:34,196 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:34,197 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:54:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:34,199 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 12:54:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-23 12:54:34,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:34,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:34,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:34,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2018-11-23 12:54:34,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 19 [2018-11-23 12:54:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:34,202 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2018-11-23 12:54:34,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:54:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-23 12:54:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:54:34,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:34,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:34,204 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:34,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1738724303, now seen corresponding path program 1 times [2018-11-23 12:54:34,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:34,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:34,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:34,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:34,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:34,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {267#true} call ULTIMATE.init(); {267#true} is VALID [2018-11-23 12:54:34,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {267#true} is VALID [2018-11-23 12:54:34,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {267#true} assume true; {267#true} is VALID [2018-11-23 12:54:34,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {267#true} {267#true} #34#return; {267#true} is VALID [2018-11-23 12:54:34,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {267#true} call #t~ret9 := main(); {267#true} is VALID [2018-11-23 12:54:34,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {267#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);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);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;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {269#(and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#a~0.base| |main_~#p1~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 12:54:34,778 INFO L256 TraceCheckUtils]: 6: Hoare triple {269#(and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#a~0.base| |main_~#p1~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)))} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {270#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2018-11-23 12:54:34,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {270#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2018-11-23 12:54:34,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} assume 4 == ~a; {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2018-11-23 12:54:34,787 INFO L256 TraceCheckUtils]: 9: Hoare triple {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {270#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2018-11-23 12:54:34,789 INFO L273 TraceCheckUtils]: 10: Hoare triple {270#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {272#(or (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) |g_#in~p1.base|) (and (= (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2018-11-23 12:54:34,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {272#(or (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) |g_#in~p1.base|) (and (= (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} assume true; {272#(or (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) |g_#in~p1.base|) (and (= (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2018-11-23 12:54:34,797 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {272#(or (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) |g_#in~p1.base|) (and (= (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} {271#(and (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} #32#return; {273#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) |f_#in~p1.base|))} is VALID [2018-11-23 12:54:34,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {273#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) |f_#in~p1.base|))} #res := 1; {273#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) |f_#in~p1.base|))} is VALID [2018-11-23 12:54:34,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {273#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) |f_#in~p1.base|))} assume true; {273#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) |f_#in~p1.base|))} is VALID [2018-11-23 12:54:34,800 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {273#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) |f_#in~p1.base|))} {269#(and (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#a~0.base| |main_~#p1~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)))} #38#return; {274#(and (= 0 (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset| |main_#t~ret5|)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (not (= |main_~#a~0.base| |main_~#p1~0.base|)))} is VALID [2018-11-23 12:54:34,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {274#(and (= 0 (select (select (store |#memory_int| |main_~#a~0.base| (store (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset| |main_#t~ret5|)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (not (= |main_~#a~0.base| |main_~#p1~0.base|)))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {275#(= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} is VALID [2018-11-23 12:54:34,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {275#(= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} assume !(1 != #t~mem6);havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, #t~mem7.offset, 4); {276#(= |main_#t~mem8| 0)} is VALID [2018-11-23 12:54:34,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {276#(= |main_#t~mem8| 0)} assume 0 != #t~mem8;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset; {268#false} is VALID [2018-11-23 12:54:34,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {268#false} assume !false; {268#false} is VALID [2018-11-23 12:54:34,812 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:34,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:34,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:54:34,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 12:54:34,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:34,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:54:34,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:34,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:54:34,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:54:34,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:54:34,869 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 10 states. [2018-11-23 12:54:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:35,573 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 12:54:35,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:54:35,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 12:54:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:54:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-11-23 12:54:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:54:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-11-23 12:54:35,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 20 transitions. [2018-11-23 12:54:35,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:35,656 INFO L225 Difference]: With dead ends: 21 [2018-11-23 12:54:35,657 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:54:35,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:54:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:54:35,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:35,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:35,659 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:35,660 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:35,660 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:35,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:35,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:35,661 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:35,661 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:54:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:35,662 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:54:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:35,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:35,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:35,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:35,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:54:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:54:35,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-23 12:54:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:35,664 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:54:35,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:54:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:54:35,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:35,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:54:35,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:35,772 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:54:35,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:35,772 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (= f_~a |f_#in~a|) (= f_~p1.offset |f_#in~p1.offset|) (= f_~p2.base |f_#in~p2.base|) (= f_~p1.base |f_#in~p1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|)) [2018-11-23 12:54:35,772 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 17) no Hoare annotation was computed. [2018-11-23 12:54:35,772 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-23 12:54:35,772 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 18) no Hoare annotation was computed. [2018-11-23 12:54:35,772 INFO L444 ceAbstractionStarter]: At program point fENTRY(lines 11 18) the Hoare annotation is: (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) [2018-11-23 12:54:35,773 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 11 18) no Hoare annotation was computed. [2018-11-23 12:54:35,773 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 12:54:35,773 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 4 9) no Hoare annotation was computed. [2018-11-23 12:54:35,773 INFO L444 ceAbstractionStarter]: At program point gENTRY(lines 4 9) the Hoare annotation is: (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) [2018-11-23 12:54:35,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:54:35,773 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:54:35,773 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:54:35,773 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:54:35,774 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2018-11-23 12:54:35,774 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|))) (and (= 4 |main_#t~mem4|) (not (= |main_~#p1~0.base| .cse0)) (not (= .cse0 |main_~#a~0.base|)) (not (= |main_~#a~0.base| |main_~#p1~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)))) [2018-11-23 12:54:35,774 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-23 12:54:35,774 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 20 46) the Hoare annotation is: (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) [2018-11-23 12:54:35,774 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20 46) no Hoare annotation was computed. [2018-11-23 12:54:35,774 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20 46) no Hoare annotation was computed. [2018-11-23 12:54:35,774 INFO L444 ceAbstractionStarter]: At program point L39(lines 20 46) the Hoare annotation is: false [2018-11-23 12:54:35,774 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-23 12:54:35,775 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-23 12:54:35,776 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:35,776 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 12:54:35,776 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-23 12:54:35,779 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:35,779 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 12:54:35,780 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 12:54:35,780 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-23 12:54:35,780 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:35,782 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 12:54:35,784 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:35,785 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 12:54:35,788 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-23 12:54:35,788 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2018-11-23 12:54:35,788 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:35,788 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 12:54:35,788 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 12:54:35,788 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 12:54:35,788 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 12:54:35,789 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 12:54:35,789 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:54:35,789 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:35,789 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:54:35,789 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:54:35,790 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:35,790 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:35,790 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:54:35,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:35 BoogieIcfgContainer [2018-11-23 12:54:35,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:35,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:35,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:35,796 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:35,797 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:31" (3/4) ... [2018-11-23 12:54:35,800 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:54:35,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:54:35,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-23 12:54:35,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-23 12:54:35,807 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:54:35,813 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 12:54:35,814 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 12:54:35,814 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 12:54:35,814 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 12:54:35,867 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test05_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:35,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:35,872 INFO L168 Benchmark]: Toolchain (without parser) took 5405.75 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -488.5 MB). Peak memory consumption was 227.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:35,878 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 12:54:35,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.61 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:35,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.17 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:35,883 INFO L168 Benchmark]: Boogie Preprocessor took 32.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:35,884 INFO L168 Benchmark]: RCFGBuilder took 786.52 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:35,885 INFO L168 Benchmark]: TraceAbstraction took 4177.50 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: 253.1 MB). Peak memory consumption was 253.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:35,885 INFO L168 Benchmark]: Witness Printer took 71.17 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 12:54:35,889 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 305.61 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 27.17 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 32.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. * RCFGBuilder took 786.52 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4177.50 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: 253.1 MB). Peak memory consumption was 253.1 MB. Max. memory is 7.1 GB. * Witness Printer took 71.17 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: 44]: 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: 20]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. SAFE Result, 4.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 10 SDslu, 150 SDs, 0 SdLazy, 99 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 60 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 6277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...