java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label52.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:56:59,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:56:59,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:56:59,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:56:59,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:56:59,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:56:59,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:56:59,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:56:59,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:56:59,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:56:59,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:56:59,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:56:59,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:56:59,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:56:59,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:56:59,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:56:59,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:56:59,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:56:59,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:56:59,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:56:59,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:56:59,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:56:59,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:56:59,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:56:59,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:56:59,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:56:59,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:56:59,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:56:59,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:56:59,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:56:59,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:56:59,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:56:59,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:56:59,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:56:59,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:56:59,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:56:59,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:56:59,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:56:59,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:56:59,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:56:59,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:56:59,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:56:59,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:56:59,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:56:59,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:56:59,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:56:59,742 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:56:59,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:56:59,743 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:56:59,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:56:59,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:56:59,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:56:59,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:56:59,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:56:59,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:56:59,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:56:59,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:56:59,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:56:59,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:56:59,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:56:59,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:56:59,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:56:59,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:56:59,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:56:59,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:56:59,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:56:59,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:56:59,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:56:59,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:56:59,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:56:59,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:57:00,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:57:00,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:57:00,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:57:00,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:57:00,049 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:57:00,050 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label52.c [2019-10-07 00:57:00,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf7b397/2a83a36b480948a3aa60d05633cca031/FLAGc94ebfa1a [2019-10-07 00:57:00,742 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:57:00,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label52.c [2019-10-07 00:57:00,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf7b397/2a83a36b480948a3aa60d05633cca031/FLAGc94ebfa1a [2019-10-07 00:57:00,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccf7b397/2a83a36b480948a3aa60d05633cca031 [2019-10-07 00:57:00,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:57:00,987 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:57:00,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:57:00,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:57:00,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:57:00,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:57:00" (1/1) ... [2019-10-07 00:57:00,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6b6da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:00, skipping insertion in model container [2019-10-07 00:57:00,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:57:00" (1/1) ... [2019-10-07 00:57:01,005 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:57:01,069 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:57:01,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:57:01,629 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:57:01,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:57:01,781 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:57:01,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01 WrapperNode [2019-10-07 00:57:01,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:57:01,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:57:01,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:57:01,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:57:01,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (1/1) ... [2019-10-07 00:57:01,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (1/1) ... [2019-10-07 00:57:01,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (1/1) ... [2019-10-07 00:57:01,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (1/1) ... [2019-10-07 00:57:01,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (1/1) ... [2019-10-07 00:57:01,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (1/1) ... [2019-10-07 00:57:01,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (1/1) ... [2019-10-07 00:57:01,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:57:01,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:57:01,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:57:01,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:57:01,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (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 [2019-10-07 00:57:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:57:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:57:01,955 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:57:01,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:57:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:57:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:57:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:57:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:57:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:57:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:57:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:57:03,886 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:57:03,886 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:57:03,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:57:03 BoogieIcfgContainer [2019-10-07 00:57:03,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:57:03,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:57:03,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:57:03,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:57:03,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:57:00" (1/3) ... [2019-10-07 00:57:03,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a22bc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:57:03, skipping insertion in model container [2019-10-07 00:57:03,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:01" (2/3) ... [2019-10-07 00:57:03,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a22bc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:57:03, skipping insertion in model container [2019-10-07 00:57:03,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:57:03" (3/3) ... [2019-10-07 00:57:03,896 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label52.c [2019-10-07 00:57:03,906 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:57:03,915 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:57:03,927 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:57:03,953 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:57:03,954 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:57:03,954 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:57:03,954 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:57:03,956 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:57:03,957 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:57:03,957 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:57:03,957 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:57:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-07 00:57:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-07 00:57:04,002 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:04,003 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:04,005 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:04,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:04,011 INFO L82 PathProgramCache]: Analyzing trace with hash 826825060, now seen corresponding path program 1 times [2019-10-07 00:57:04,020 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:04,020 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:04,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:04,021 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:04,466 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:04,467 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:04,467 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:04,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:04,489 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-07 00:57:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:05,036 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-07 00:57:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:05,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-07 00:57:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:05,065 INFO L225 Difference]: With dead ends: 246 [2019-10-07 00:57:05,066 INFO L226 Difference]: Without dead ends: 157 [2019-10-07 00:57:05,072 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-07 00:57:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-07 00:57:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 00:57:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 285 transitions. [2019-10-07 00:57:05,181 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 285 transitions. Word has length 77 [2019-10-07 00:57:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:05,182 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 285 transitions. [2019-10-07 00:57:05,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 285 transitions. [2019-10-07 00:57:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 00:57:05,191 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:05,192 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:05,192 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1022491173, now seen corresponding path program 1 times [2019-10-07 00:57:05,193 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:05,194 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:05,195 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:05,195 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:05,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:05,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:05,320 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:05,320 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 00:57:05,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:57:05,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:57:05,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:57:05,323 INFO L87 Difference]: Start difference. First operand 157 states and 285 transitions. Second operand 5 states. [2019-10-07 00:57:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:05,908 INFO L93 Difference]: Finished difference Result 479 states and 892 transitions. [2019-10-07 00:57:05,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:57:05,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-07 00:57:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:05,914 INFO L225 Difference]: With dead ends: 479 [2019-10-07 00:57:05,914 INFO L226 Difference]: Without dead ends: 327 [2019-10-07 00:57:05,917 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 00:57:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-07 00:57:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2019-10-07 00:57:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-10-07 00:57:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 547 transitions. [2019-10-07 00:57:05,972 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 547 transitions. Word has length 86 [2019-10-07 00:57:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:05,972 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 547 transitions. [2019-10-07 00:57:05,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:57:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 547 transitions. [2019-10-07 00:57:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 00:57:05,976 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:05,976 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:05,977 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash -311197368, now seen corresponding path program 1 times [2019-10-07 00:57:05,977 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:05,978 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:05,978 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:05,978 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:06,076 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:06,077 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:06,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:06,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:57:06,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 00:57:06,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:57:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 00:57:06,368 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:57:06,368 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-07 00:57:06,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:57:06,370 INFO L87 Difference]: Start difference. First operand 317 states and 547 transitions. Second operand 3 states. [2019-10-07 00:57:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:06,824 INFO L93 Difference]: Finished difference Result 860 states and 1512 transitions. [2019-10-07 00:57:06,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:06,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-07 00:57:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:06,837 INFO L225 Difference]: With dead ends: 860 [2019-10-07 00:57:06,837 INFO L226 Difference]: Without dead ends: 548 [2019-10-07 00:57:06,843 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:57:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-07 00:57:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-10-07 00:57:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-10-07 00:57:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 908 transitions. [2019-10-07 00:57:06,879 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 908 transitions. Word has length 97 [2019-10-07 00:57:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:06,880 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 908 transitions. [2019-10-07 00:57:06,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 908 transitions. [2019-10-07 00:57:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-07 00:57:06,884 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:06,885 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:07,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:07,090 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:07,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:07,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1630250311, now seen corresponding path program 1 times [2019-10-07 00:57:07,091 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:07,091 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:07,092 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:07,092 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 00:57:07,205 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:07,205 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:07,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:57:07,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:07,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:57:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:07,417 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:57:07,417 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-07 00:57:07,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:57:07,420 INFO L87 Difference]: Start difference. First operand 548 states and 908 transitions. Second operand 3 states. [2019-10-07 00:57:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:07,778 INFO L93 Difference]: Finished difference Result 702 states and 1160 transitions. [2019-10-07 00:57:07,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:07,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-07 00:57:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:07,784 INFO L225 Difference]: With dead ends: 702 [2019-10-07 00:57:07,784 INFO L226 Difference]: Without dead ends: 700 [2019-10-07 00:57:07,785 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 00:57:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-10-07 00:57:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 550. [2019-10-07 00:57:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-07 00:57:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 910 transitions. [2019-10-07 00:57:07,812 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 910 transitions. Word has length 96 [2019-10-07 00:57:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:07,813 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 910 transitions. [2019-10-07 00:57:07,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 910 transitions. [2019-10-07 00:57:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-07 00:57:07,816 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:07,816 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:08,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:08,029 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:08,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash -498196244, now seen corresponding path program 1 times [2019-10-07 00:57:08,031 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:08,031 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:08,031 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:08,031 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:08,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:08,101 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:08,102 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:08,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:08,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:57:08,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 00:57:08,226 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:57:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 00:57:08,260 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:57:08,260 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-07 00:57:08,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:57:08,261 INFO L87 Difference]: Start difference. First operand 550 states and 910 transitions. Second operand 3 states. [2019-10-07 00:57:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:08,699 INFO L93 Difference]: Finished difference Result 1093 states and 1823 transitions. [2019-10-07 00:57:08,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:08,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-07 00:57:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:08,703 INFO L225 Difference]: With dead ends: 1093 [2019-10-07 00:57:08,703 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:57:08,706 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:57:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:57:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:57:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:57:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:57:08,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2019-10-07 00:57:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:08,707 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:57:08,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:57:08,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:57:08,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:08,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:57:09,150 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-10-07 00:57:09,210 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a8~0 |old(~a8~0)|) [2019-10-07 00:57:09,211 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:57:09,211 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-07 00:57:09,211 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-07 00:57:09,211 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-07 00:57:09,211 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-07 00:57:09,211 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-07 00:57:09,212 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-07 00:57:09,212 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-07 00:57:09,212 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-07 00:57:09,212 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-07 00:57:09,216 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-07 00:57:09,216 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-07 00:57:09,216 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-07 00:57:09,216 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-07 00:57:09,217 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-07 00:57:09,217 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-07 00:57:09,217 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-07 00:57:09,217 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-07 00:57:09,217 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-07 00:57:09,217 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-07 00:57:09,217 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-07 00:57:09,218 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-07 00:57:09,218 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-07 00:57:09,218 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-07 00:57:09,218 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-07 00:57:09,218 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-07 00:57:09,220 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-07 00:57:09,220 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-07 00:57:09,220 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-07 00:57:09,221 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2019-10-07 00:57:09,221 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-07 00:57:09,221 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:57:09,221 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:57:09,221 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-07 00:57:09,221 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-07 00:57:09,221 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-07 00:57:09,222 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-07 00:57:09,222 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-07 00:57:09,222 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-07 00:57:09,222 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-07 00:57:09,222 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-07 00:57:09,222 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-07 00:57:09,222 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:57:09,223 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-07 00:57:09,223 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-07 00:57:09,223 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-07 00:57:09,225 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-07 00:57:09,225 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-07 00:57:09,225 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-07 00:57:09,225 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-07 00:57:09,226 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-07 00:57:09,226 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-07 00:57:09,226 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-07 00:57:09,226 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse2 (not (<= 15 |old(~a8~0)|))) (.cse1 (= 6 |old(~a16~0)|)) (.cse4 (not (<= |old(~a20~0)| 0))) (.cse3 (<= ~a20~0 0)) (.cse0 (= ~a8~0 |old(~a8~0)|))) (and (or (and .cse0 (not (= ~a16~0 6))) .cse1) (or .cse0 .cse2) (or .cse2 .cse3 .cse4) (or (or .cse1 .cse4) .cse3) (or (not (<= |old(~a8~0)| 13)) .cse0))) [2019-10-07 00:57:09,226 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-07 00:57:09,227 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-07 00:57:09,227 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-07 00:57:09,227 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-07 00:57:09,227 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-07 00:57:09,227 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-07 00:57:09,227 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-07 00:57:09,227 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-07 00:57:09,227 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-07 00:57:09,228 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-07 00:57:09,228 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-07 00:57:09,228 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-07 00:57:09,228 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-07 00:57:09,228 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-07 00:57:09,228 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-07 00:57:09,229 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-07 00:57:09,229 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-07 00:57:09,229 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-07 00:57:09,230 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-07 00:57:09,230 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-07 00:57:09,230 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:57:09,230 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 15 ~a8~0) (not (= ~a16~0 6))) [2019-10-07 00:57:09,230 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:57:09,230 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:57:09,232 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (and (= ~a8~0 |old(~a8~0)|) (not (= ~a16~0 6))) (not (<= 15 |old(~a8~0)|))) [2019-10-07 00:57:09,232 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:57:09,232 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (<= ~a8~0 13) (= 6 |old(~a16~0)|) (not (= ~a16~0 6)) (<= 15 ~a8~0) (not (<= 15 |old(~a8~0)|))) [2019-10-07 00:57:09,232 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-07 00:57:09,232 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-07 00:57:09,233 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (<= ~a8~0 13) (= 6 |old(~a16~0)|) (not (= ~a16~0 6)) (<= 15 ~a8~0) (not (<= 15 |old(~a8~0)|))) [2019-10-07 00:57:09,233 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-07 00:57:09,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:57:09 BoogieIcfgContainer [2019-10-07 00:57:09,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:57:09,274 INFO L168 Benchmark]: Toolchain (without parser) took 8286.11 ms. Allocated memory was 137.4 MB in the beginning and 339.2 MB in the end (delta: 201.9 MB). Free memory was 100.7 MB in the beginning and 209.9 MB in the end (delta: -109.2 MB). Peak memory consumption was 92.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:09,275 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:57:09,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.12 ms. Allocated memory was 137.4 MB in the beginning and 203.4 MB in the end (delta: 66.1 MB). Free memory was 100.4 MB in the beginning and 167.5 MB in the end (delta: -67.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:09,279 INFO L168 Benchmark]: Boogie Preprocessor took 120.54 ms. Allocated memory is still 203.4 MB. Free memory was 167.5 MB in the beginning and 162.5 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:09,280 INFO L168 Benchmark]: RCFGBuilder took 1982.36 ms. Allocated memory was 203.4 MB in the beginning and 252.7 MB in the end (delta: 49.3 MB). Free memory was 162.5 MB in the beginning and 213.7 MB in the end (delta: -51.2 MB). Peak memory consumption was 115.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:09,284 INFO L168 Benchmark]: TraceAbstraction took 5382.39 ms. Allocated memory was 252.7 MB in the beginning and 339.2 MB in the end (delta: 86.5 MB). Free memory was 213.7 MB in the beginning and 209.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 90.3 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:09,292 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.12 ms. Allocated memory was 137.4 MB in the beginning and 203.4 MB in the end (delta: 66.1 MB). Free memory was 100.4 MB in the beginning and 167.5 MB in the end (delta: -67.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.54 ms. Allocated memory is still 203.4 MB. Free memory was 167.5 MB in the beginning and 162.5 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1982.36 ms. Allocated memory was 203.4 MB in the beginning and 252.7 MB in the end (delta: 49.3 MB). Free memory was 162.5 MB in the beginning and 213.7 MB in the end (delta: -51.2 MB). Peak memory consumption was 115.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5382.39 ms. Allocated memory was 252.7 MB in the beginning and 339.2 MB in the end (delta: 86.5 MB). Free memory was 213.7 MB in the beginning and 209.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 90.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: 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: 583]: Loop Invariant Derived loop invariant: (((a8 <= 13 || 6 == \old(a16)) || !(a16 == 6)) || 15 <= a8) || !(15 <= \old(a8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 365 SDtfs, 366 SDslu, 80 SDs, 0 SdLazy, 1288 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 611 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 160 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 27 PreInvPairs, 41 NumberOfFragments, 117 HoareAnnotationTreeSize, 27 FomulaSimplifications, 299 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 165 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1064 ConstructedInterpolants, 0 QuantifiedInterpolants, 252460 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 223/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...