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_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:40:50,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:40:50,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:40:50,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:40:50,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:40:50,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:40:50,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:40:50,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:40:50,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:40:50,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:40:50,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:40:50,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:40:50,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:40:50,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:40:50,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:40:50,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:40:50,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:40:50,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:40:50,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:40:50,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:40:50,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:40:50,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:40:50,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:40:50,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:40:50,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:40:50,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:40:50,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:40:50,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:40:50,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:40:50,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:40:50,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:40:50,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:40:50,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:40:50,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:40:50,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:40:50,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:40:50,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:40:50,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:40:50,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:40:50,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:40:50,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:40:50,680 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-15 01:40:50,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:40:50,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:40:50,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:40:50,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:40:50,705 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:40:50,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:40:50,705 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:40:50,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:40:50,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:40:50,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:40:50,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:40:50,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:40:50,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:40:50,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:40:50,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:40:50,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:40:50,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:40:50,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:40:50,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:40:50,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:40:50,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:40:50,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:40:50,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:40:50,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:40:50,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:40:50,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:40:50,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:40:50,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:40:50,710 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-15 01:40:50,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:40:50,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:40:50,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:40:50,996 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:40:50,996 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:40:50,997 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label54.c [2019-10-15 01:40:51,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e8ff80da/e714c96e58e5442bb6289964aa02b3a9/FLAG530727d8b [2019-10-15 01:40:51,621 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:40:51,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label54.c [2019-10-15 01:40:51,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e8ff80da/e714c96e58e5442bb6289964aa02b3a9/FLAG530727d8b [2019-10-15 01:40:51,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e8ff80da/e714c96e58e5442bb6289964aa02b3a9 [2019-10-15 01:40:51,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:40:51,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:40:51,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:40:51,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:40:51,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:40:51,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:40:51" (1/1) ... [2019-10-15 01:40:51,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7492c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:51, skipping insertion in model container [2019-10-15 01:40:51,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:40:51" (1/1) ... [2019-10-15 01:40:51,907 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:40:51,965 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:40:52,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:40:52,493 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:40:52,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:40:52,640 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:40:52,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52 WrapperNode [2019-10-15 01:40:52,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:40:52,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:40:52,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:40:52,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:40:52,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (1/1) ... [2019-10-15 01:40:52,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (1/1) ... [2019-10-15 01:40:52,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (1/1) ... [2019-10-15 01:40:52,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (1/1) ... [2019-10-15 01:40:52,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (1/1) ... [2019-10-15 01:40:52,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (1/1) ... [2019-10-15 01:40:52,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (1/1) ... [2019-10-15 01:40:52,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:40:52,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:40:52,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:40:52,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:40:52,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (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-15 01:40:52,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:40:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:40:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 01:40:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:40:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 01:40:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:40:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:40:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:40:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:40:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:40:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:40:54,513 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:40:54,513 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:40:54,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:40:54 BoogieIcfgContainer [2019-10-15 01:40:54,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:40:54,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:40:54,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:40:54,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:40:54,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:40:51" (1/3) ... [2019-10-15 01:40:54,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a370733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:40:54, skipping insertion in model container [2019-10-15 01:40:54,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:40:52" (2/3) ... [2019-10-15 01:40:54,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a370733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:40:54, skipping insertion in model container [2019-10-15 01:40:54,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:40:54" (3/3) ... [2019-10-15 01:40:54,535 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label54.c [2019-10-15 01:40:54,547 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:40:54,556 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:40:54,567 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:40:54,594 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:40:54,594 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:40:54,595 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:40:54,595 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:40:54,596 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:40:54,596 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:40:54,596 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:40:54,596 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:40:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-15 01:40:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:40:54,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:40:54,641 INFO L380 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-15 01:40:54,645 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:40:54,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:40:54,650 INFO L82 PathProgramCache]: Analyzing trace with hash 826824036, now seen corresponding path program 1 times [2019-10-15 01:40:54,659 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:40:54,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008909583] [2019-10-15 01:40:54,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:54,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:54,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:40:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:40:55,133 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-15 01:40:55,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008909583] [2019-10-15 01:40:55,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:40:55,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:40:55,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220342771] [2019-10-15 01:40:55,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:40:55,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:40:55,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:40:55,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:40:55,160 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-15 01:40:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:40:55,619 INFO L93 Difference]: Finished difference Result 246 states and 454 transitions. [2019-10-15 01:40:55,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:40:55,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-15 01:40:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:40:55,636 INFO L225 Difference]: With dead ends: 246 [2019-10-15 01:40:55,636 INFO L226 Difference]: Without dead ends: 157 [2019-10-15 01:40:55,641 INFO L600 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-15 01:40:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-15 01:40:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-15 01:40:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-15 01:40:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 291 transitions. [2019-10-15 01:40:55,731 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 291 transitions. Word has length 77 [2019-10-15 01:40:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:40:55,732 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 291 transitions. [2019-10-15 01:40:55,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:40:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 291 transitions. [2019-10-15 01:40:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:40:55,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:40:55,737 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-15 01:40:55,738 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:40:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:40:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash 579798987, now seen corresponding path program 1 times [2019-10-15 01:40:55,739 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:40:55,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109614598] [2019-10-15 01:40:55,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:55,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:55,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:40:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:40:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:40:55,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109614598] [2019-10-15 01:40:55,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:40:55,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:40:55,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504983969] [2019-10-15 01:40:55,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:40:55,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:40:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:40:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:40:55,893 INFO L87 Difference]: Start difference. First operand 157 states and 291 transitions. Second operand 3 states. [2019-10-15 01:40:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:40:56,297 INFO L93 Difference]: Finished difference Result 459 states and 874 transitions. [2019-10-15 01:40:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:40:56,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-15 01:40:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:40:56,302 INFO L225 Difference]: With dead ends: 459 [2019-10-15 01:40:56,303 INFO L226 Difference]: Without dead ends: 307 [2019-10-15 01:40:56,305 INFO L600 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-15 01:40:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-15 01:40:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 232. [2019-10-15 01:40:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:40:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 412 transitions. [2019-10-15 01:40:56,330 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 412 transitions. Word has length 94 [2019-10-15 01:40:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:40:56,330 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 412 transitions. [2019-10-15 01:40:56,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:40:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 412 transitions. [2019-10-15 01:40:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:40:56,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:40:56,334 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:40:56,334 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:40:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:40:56,335 INFO L82 PathProgramCache]: Analyzing trace with hash 95155127, now seen corresponding path program 1 times [2019-10-15 01:40:56,335 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:40:56,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029330189] [2019-10-15 01:40:56,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:56,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:56,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:40:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:40:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:40:56,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029330189] [2019-10-15 01:40:56,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:40:56,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:40:56,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705355804] [2019-10-15 01:40:56,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:40:56,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:40:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:40:56,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:40:56,530 INFO L87 Difference]: Start difference. First operand 232 states and 412 transitions. Second operand 6 states. [2019-10-15 01:40:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:40:57,100 INFO L93 Difference]: Finished difference Result 635 states and 1153 transitions. [2019-10-15 01:40:57,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:40:57,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-15 01:40:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:40:57,107 INFO L225 Difference]: With dead ends: 635 [2019-10-15 01:40:57,107 INFO L226 Difference]: Without dead ends: 408 [2019-10-15 01:40:57,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:40:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-10-15 01:40:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 396. [2019-10-15 01:40:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-15 01:40:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 651 transitions. [2019-10-15 01:40:57,146 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 651 transitions. Word has length 121 [2019-10-15 01:40:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:40:57,147 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 651 transitions. [2019-10-15 01:40:57,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:40:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 651 transitions. [2019-10-15 01:40:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:40:57,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:40:57,152 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:40:57,152 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:40:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:40:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash -67994930, now seen corresponding path program 1 times [2019-10-15 01:40:57,153 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:40:57,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964598851] [2019-10-15 01:40:57,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:57,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:57,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:40:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:40:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:40:57,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964598851] [2019-10-15 01:40:57,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820242069] [2019-10-15 01:40:57,269 INFO L94 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-15 01:40:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:40:57,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:40:57,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:40:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:40:57,521 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:40:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:40:57,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:40:57,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-15 01:40:57,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81173364] [2019-10-15 01:40:57,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:40:57,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:40:57,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:40:57,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:40:57,608 INFO L87 Difference]: Start difference. First operand 396 states and 651 transitions. Second operand 5 states. [2019-10-15 01:40:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:40:58,172 INFO L93 Difference]: Finished difference Result 1050 states and 1807 transitions. [2019-10-15 01:40:58,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:40:58,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-10-15 01:40:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:40:58,183 INFO L225 Difference]: With dead ends: 1050 [2019-10-15 01:40:58,183 INFO L226 Difference]: Without dead ends: 659 [2019-10-15 01:40:58,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:40:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-15 01:40:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 556. [2019-10-15 01:40:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-15 01:40:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 891 transitions. [2019-10-15 01:40:58,268 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 891 transitions. Word has length 131 [2019-10-15 01:40:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:40:58,268 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 891 transitions. [2019-10-15 01:40:58,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:40:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 891 transitions. [2019-10-15 01:40:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:40:58,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:40:58,278 INFO L380 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, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:40:58,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:40:58,481 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:40:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:40:58,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1205364438, now seen corresponding path program 1 times [2019-10-15 01:40:58,482 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:40:58,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003660265] [2019-10-15 01:40:58,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:58,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:40:58,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:40:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:40:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:40:58,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003660265] [2019-10-15 01:40:58,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406106576] [2019-10-15 01:40:58,665 INFO L94 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-15 01:40:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:40:58,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:40:58,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:40:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:40:58,810 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:40:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:40:58,865 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:40:58,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:40:58,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802682316] [2019-10-15 01:40:58,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:40:58,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:40:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:40:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:40:58,868 INFO L87 Difference]: Start difference. First operand 556 states and 891 transitions. Second operand 3 states. [2019-10-15 01:40:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:40:59,251 INFO L93 Difference]: Finished difference Result 1411 states and 2345 transitions. [2019-10-15 01:40:59,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:40:59,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-15 01:40:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:40:59,253 INFO L225 Difference]: With dead ends: 1411 [2019-10-15 01:40:59,253 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:40:59,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 262 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-15 01:40:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:40:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:40:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:40:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:40:59,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2019-10-15 01:40:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:40:59,257 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:40:59,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:40:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:40:59,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:40:59,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:40:59,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:40:59,777 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-10-15 01:40:59,873 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a16~0 |old(~a16~0)|) (= ~a7~0 |old(~a7~0)|)) [2019-10-15 01:40:59,873 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:40:59,874 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-15 01:40:59,874 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-15 01:40:59,874 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-15 01:40:59,874 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-15 01:40:59,874 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-15 01:40:59,874 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-15 01:40:59,875 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-15 01:40:59,875 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-15 01:40:59,875 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-15 01:40:59,875 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-15 01:40:59,875 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-15 01:40:59,875 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-15 01:40:59,875 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-15 01:40:59,876 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-15 01:40:59,876 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:40:59,876 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-15 01:40:59,876 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-15 01:40:59,878 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-15 01:40:59,879 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:40:59,879 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-15 01:40:59,879 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-15 01:40:59,879 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-15 01:40:59,879 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-15 01:40:59,879 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-15 01:40:59,879 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-15 01:40:59,880 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-15 01:40:59,880 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-15 01:40:59,880 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-15 01:40:59,880 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-15 01:40:59,880 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-15 01:40:59,880 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-15 01:40:59,880 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-15 01:40:59,881 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:40:59,881 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:40:59,881 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-15 01:40:59,881 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-15 01:40:59,885 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-15 01:40:59,886 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-15 01:40:59,886 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-15 01:40:59,886 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-15 01:40:59,886 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-15 01:40:59,886 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-15 01:40:59,886 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-15 01:40:59,886 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-15 01:40:59,887 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2019-10-15 01:40:59,887 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-15 01:40:59,887 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-15 01:40:59,887 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-15 01:40:59,887 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-15 01:40:59,887 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-15 01:40:59,888 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-15 01:40:59,888 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-15 01:40:59,888 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse3 (<= ~a16~0 |old(~a16~0)|)) (.cse4 (= ~a7~0 |old(~a7~0)|))) (let ((.cse1 (= 14 |old(~a8~0)|)) (.cse0 (and .cse3 .cse4 (not (= 14 ~a8~0)))) (.cse2 (= 1 |old(~a7~0)|))) (and (or .cse0 (not (<= |old(~a16~0)| 5)) .cse1) (or .cse2 .cse1 .cse0) (or .cse2 (not (<= |old(~a16~0)| 4)) (and .cse3 .cse4)) (or (= 1 |old(~a17~0)|) (and .cse3 .cse4 (not (= ~a17~0 1))))))) [2019-10-15 01:40:59,889 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-15 01:40:59,889 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-15 01:40:59,889 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-15 01:40:59,889 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-15 01:40:59,890 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-15 01:40:59,890 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-15 01:40:59,890 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-15 01:40:59,890 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-15 01:40:59,890 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-15 01:40:59,890 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-15 01:40:59,890 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-15 01:40:59,890 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-15 01:40:59,891 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-15 01:40:59,891 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-15 01:40:59,891 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-15 01:40:59,891 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-15 01:40:59,891 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-15 01:40:59,891 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-15 01:40:59,891 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-15 01:40:59,891 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-15 01:40:59,892 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:40:59,894 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a7~0 1)) (<= ~a16~0 5) (not (= 14 ~a8~0))) [2019-10-15 01:40:59,894 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:40:59,894 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:40:59,895 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 1 |old(~a7~0)|) (not (<= |old(~a16~0)| 5)) (= 14 |old(~a8~0)|) (and (<= ~a16~0 |old(~a16~0)|) (= ~a7~0 |old(~a7~0)|) (not (= 14 ~a8~0)))) [2019-10-15 01:40:59,895 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-15 01:40:59,895 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (not (= ~a7~0 1))) (.cse1 (not (= 14 ~a8~0)))) (or (= 1 |old(~a7~0)|) (not (<= |old(~a16~0)| 5)) (and .cse0 .cse1) (= 14 |old(~a8~0)|) (and .cse0 (<= ~a16~0 4)) (and (<= ~a16~0 5) .cse1) (not (= ~a17~0 1)))) [2019-10-15 01:40:59,895 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-15 01:40:59,896 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-15 01:40:59,896 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a7~0 1))) (.cse1 (not (= 14 ~a8~0)))) (or (= 1 |old(~a7~0)|) (not (<= |old(~a16~0)| 5)) (and .cse0 .cse1) (= 14 |old(~a8~0)|) (and .cse0 (<= ~a16~0 4)) (and (<= ~a16~0 5) .cse1) (not (= ~a17~0 1)))) [2019-10-15 01:40:59,896 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-15 01:40:59,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:40:59 BoogieIcfgContainer [2019-10-15 01:40:59,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:40:59,941 INFO L168 Benchmark]: Toolchain (without parser) took 8047.51 ms. Allocated memory was 147.3 MB in the beginning and 321.4 MB in the end (delta: 174.1 MB). Free memory was 102.8 MB in the beginning and 242.8 MB in the end (delta: -140.1 MB). Peak memory consumption was 183.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:40:59,942 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:40:59,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.57 ms. Allocated memory was 147.3 MB in the beginning and 207.6 MB in the end (delta: 60.3 MB). Free memory was 102.6 MB in the beginning and 172.9 MB in the end (delta: -70.4 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:40:59,944 INFO L168 Benchmark]: Boogie Preprocessor took 96.58 ms. Allocated memory is still 207.6 MB. Free memory was 172.9 MB in the beginning and 168.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:40:59,945 INFO L168 Benchmark]: RCFGBuilder took 1779.57 ms. Allocated memory was 207.6 MB in the beginning and 249.0 MB in the end (delta: 41.4 MB). Free memory was 168.1 MB in the beginning and 203.7 MB in the end (delta: -35.6 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:40:59,946 INFO L168 Benchmark]: TraceAbstraction took 5418.22 ms. Allocated memory was 249.0 MB in the beginning and 321.4 MB in the end (delta: 72.4 MB). Free memory was 202.0 MB in the beginning and 242.8 MB in the end (delta: -40.9 MB). Peak memory consumption was 180.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:40:59,951 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.20 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.57 ms. Allocated memory was 147.3 MB in the beginning and 207.6 MB in the end (delta: 60.3 MB). Free memory was 102.6 MB in the beginning and 172.9 MB in the end (delta: -70.4 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.58 ms. Allocated memory is still 207.6 MB. Free memory was 172.9 MB in the beginning and 168.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1779.57 ms. Allocated memory was 207.6 MB in the beginning and 249.0 MB in the end (delta: 41.4 MB). Free memory was 168.1 MB in the beginning and 203.7 MB in the end (delta: -35.6 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5418.22 ms. Allocated memory was 249.0 MB in the beginning and 321.4 MB in the end (delta: 72.4 MB). Free memory was 202.0 MB in the beginning and 242.8 MB in the end (delta: -40.9 MB). Peak memory consumption was 180.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: 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: (((((1 == \old(a7) || !(\old(a16) <= 5)) || (!(a7 == 1) && !(14 == a8))) || 14 == \old(a8)) || (!(a7 == 1) && a16 <= 4)) || (a16 <= 5 && !(14 == a8))) || !(a17 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 349 SDtfs, 611 SDslu, 98 SDs, 0 SdLazy, 1449 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 529 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred 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, 190 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 35 PreInvPairs, 57 NumberOfFragments, 190 HoareAnnotationTreeSize, 35 FomulaSimplifications, 1130 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 309 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 285360 SizeOfPredicates, 3 NumberOfNonLiveVariables, 945 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 395/409 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...