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/Problem02_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:41:07,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:41:07,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:41:07,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:41:07,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:41:07,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:41:07,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:41:07,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:41:07,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:41:07,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:41:07,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:41:07,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:41:07,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:41:07,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:41:07,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:41:07,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:41:07,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:41:07,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:41:07,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:41:07,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:41:07,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:41:07,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:41:07,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:41:07,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:41:07,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:41:07,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:41:07,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:41:07,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:41:07,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:41:07,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:41:07,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:41:07,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:41:07,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:41:07,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:41:07,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:41:07,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:41:07,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:41:07,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:41:07,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:41:07,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:41:07,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:41:07,768 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-13 21:41:07,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:41:07,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:41:07,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:41:07,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:41:07,785 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:41:07,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:41:07,785 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:41:07,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:41:07,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:41:07,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:41:07,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:41:07,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:41:07,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:41:07,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:41:07,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:41:07,787 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:41:07,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:41:07,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:41:07,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:41:07,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:41:07,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:41:07,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:41:07,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:41:07,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:41:07,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:41:07,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:41:07,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:41:07,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:41:07,790 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-13 21:41:08,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:41:08,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:41:08,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:41:08,085 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:41:08,086 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:41:08,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24.c [2019-10-13 21:41:08,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664b844c8/ca5cee8bf664467ab2f79ef2be1c64b0/FLAG9a7e556d1 [2019-10-13 21:41:08,665 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:41:08,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24.c [2019-10-13 21:41:08,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664b844c8/ca5cee8bf664467ab2f79ef2be1c64b0/FLAG9a7e556d1 [2019-10-13 21:41:08,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664b844c8/ca5cee8bf664467ab2f79ef2be1c64b0 [2019-10-13 21:41:08,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:41:08,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:41:08,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:08,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:41:08,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:41:08,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:08" (1/1) ... [2019-10-13 21:41:08,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3a515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:08, skipping insertion in model container [2019-10-13 21:41:08,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:41:08" (1/1) ... [2019-10-13 21:41:08,966 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:41:09,036 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:41:09,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:09,651 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:41:09,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:41:09,852 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:41:09,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09 WrapperNode [2019-10-13 21:41:09,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:41:09,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:41:09,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:41:09,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:41:09,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (1/1) ... [2019-10-13 21:41:09,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (1/1) ... [2019-10-13 21:41:09,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (1/1) ... [2019-10-13 21:41:09,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (1/1) ... [2019-10-13 21:41:09,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (1/1) ... [2019-10-13 21:41:09,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (1/1) ... [2019-10-13 21:41:09,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (1/1) ... [2019-10-13 21:41:09,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:41:09,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:41:09,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:41:09,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:41:09,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (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-13 21:41:10,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:41:10,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:41:10,038 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 21:41:10,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:41:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 21:41:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:41:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:41:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:41:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:41:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:41:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:41:12,086 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:41:12,086 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:41:12,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:12 BoogieIcfgContainer [2019-10-13 21:41:12,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:41:12,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:41:12,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:41:12,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:41:12,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:41:08" (1/3) ... [2019-10-13 21:41:12,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7735c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:12, skipping insertion in model container [2019-10-13 21:41:12,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:41:09" (2/3) ... [2019-10-13 21:41:12,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7735c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:41:12, skipping insertion in model container [2019-10-13 21:41:12,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:41:12" (3/3) ... [2019-10-13 21:41:12,097 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label24.c [2019-10-13 21:41:12,107 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:41:12,115 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:41:12,127 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:41:12,153 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:41:12,153 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:41:12,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:41:12,154 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:41:12,154 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:41:12,154 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:41:12,154 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:41:12,155 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:41:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-13 21:41:12,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 21:41:12,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:12,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:12,189 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:12,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:12,195 INFO L82 PathProgramCache]: Analyzing trace with hash -219361993, now seen corresponding path program 1 times [2019-10-13 21:41:12,205 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:12,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514280873] [2019-10-13 21:41:12,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:12,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:12,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:12,673 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-13 21:41:12,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514280873] [2019-10-13 21:41:12,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:12,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:12,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612017409] [2019-10-13 21:41:12,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:12,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:12,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:12,704 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-13 21:41:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:13,231 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-10-13 21:41:13,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:13,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-13 21:41:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:13,250 INFO L225 Difference]: With dead ends: 273 [2019-10-13 21:41:13,250 INFO L226 Difference]: Without dead ends: 175 [2019-10-13 21:41:13,254 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-13 21:41:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-13 21:41:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-13 21:41:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 21:41:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 312 transitions. [2019-10-13 21:41:13,340 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 312 transitions. Word has length 86 [2019-10-13 21:41:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:13,342 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 312 transitions. [2019-10-13 21:41:13,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 312 transitions. [2019-10-13 21:41:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:41:13,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:13,356 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:41:13,357 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash -701896772, now seen corresponding path program 1 times [2019-10-13 21:41:13,358 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:13,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119211668] [2019-10-13 21:41:13,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:13,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:13,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:13,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119211668] [2019-10-13 21:41:13,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:13,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:13,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055037317] [2019-10-13 21:41:13,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:13,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:13,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:13,532 INFO L87 Difference]: Start difference. First operand 175 states and 312 transitions. Second operand 3 states. [2019-10-13 21:41:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:13,934 INFO L93 Difference]: Finished difference Result 513 states and 937 transitions. [2019-10-13 21:41:13,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:13,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-13 21:41:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:13,941 INFO L225 Difference]: With dead ends: 513 [2019-10-13 21:41:13,941 INFO L226 Difference]: Without dead ends: 343 [2019-10-13 21:41:13,943 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-13 21:41:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-13 21:41:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-10-13 21:41:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-13 21:41:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 515 transitions. [2019-10-13 21:41:13,997 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 515 transitions. Word has length 94 [2019-10-13 21:41:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:13,998 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 515 transitions. [2019-10-13 21:41:13,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 515 transitions. [2019-10-13 21:41:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:41:14,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:14,004 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:41:14,005 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:14,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:14,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1298849335, now seen corresponding path program 1 times [2019-10-13 21:41:14,006 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:14,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290846310] [2019-10-13 21:41:14,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:14,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:14,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:14,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290846310] [2019-10-13 21:41:14,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:14,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:41:14,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024237497] [2019-10-13 21:41:14,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:14,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:14,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:14,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:41:14,201 INFO L87 Difference]: Start difference. First operand 343 states and 515 transitions. Second operand 3 states. [2019-10-13 21:41:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:14,593 INFO L93 Difference]: Finished difference Result 1017 states and 1570 transitions. [2019-10-13 21:41:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:14,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-13 21:41:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:14,604 INFO L225 Difference]: With dead ends: 1017 [2019-10-13 21:41:14,604 INFO L226 Difference]: Without dead ends: 679 [2019-10-13 21:41:14,607 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-13 21:41:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-10-13 21:41:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2019-10-13 21:41:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-10-13 21:41:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 995 transitions. [2019-10-13 21:41:14,656 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 995 transitions. Word has length 120 [2019-10-13 21:41:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:14,656 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 995 transitions. [2019-10-13 21:41:14,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 995 transitions. [2019-10-13 21:41:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:41:14,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:14,660 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, 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] [2019-10-13 21:41:14,661 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1383621181, now seen corresponding path program 1 times [2019-10-13 21:41:14,662 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:14,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835140509] [2019-10-13 21:41:14,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:14,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:14,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:14,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835140509] [2019-10-13 21:41:14,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741037887] [2019-10-13 21:41:14,893 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-13 21:41:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:14,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:41:14,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:41:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:15,129 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:41:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:15,204 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:41:15,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:41:15,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023189501] [2019-10-13 21:41:15,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:41:15,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:15,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:41:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:41:15,207 INFO L87 Difference]: Start difference. First operand 679 states and 995 transitions. Second operand 3 states. [2019-10-13 21:41:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:15,788 INFO L93 Difference]: Finished difference Result 1185 states and 1789 transitions. [2019-10-13 21:41:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:41:15,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-13 21:41:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:15,803 INFO L225 Difference]: With dead ends: 1185 [2019-10-13 21:41:15,804 INFO L226 Difference]: Without dead ends: 1183 [2019-10-13 21:41:15,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 274 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:41:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-10-13 21:41:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1099. [2019-10-13 21:41:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-10-13 21:41:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1633 transitions. [2019-10-13 21:41:15,889 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1633 transitions. Word has length 137 [2019-10-13 21:41:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:15,892 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 1633 transitions. [2019-10-13 21:41:15,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:41:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1633 transitions. [2019-10-13 21:41:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:41:15,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:41:15,902 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, 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] [2019-10-13 21:41:16,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:41:16,108 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:41:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:41:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1126475805, now seen corresponding path program 1 times [2019-10-13 21:41:16,109 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:41:16,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822747784] [2019-10-13 21:41:16,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:16,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:41:16,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:41:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:41:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:41:16,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822747784] [2019-10-13 21:41:16,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:41:16,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:41:16,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308290867] [2019-10-13 21:41:16,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:41:16,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:41:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:41:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:41:16,243 INFO L87 Difference]: Start difference. First operand 1099 states and 1633 transitions. Second operand 6 states. [2019-10-13 21:41:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:41:16,643 INFO L93 Difference]: Finished difference Result 2029 states and 2953 transitions. [2019-10-13 21:41:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:41:16,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:41:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:41:16,644 INFO L225 Difference]: With dead ends: 2029 [2019-10-13 21:41:16,644 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:41:16,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:41:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:41:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:41:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:41:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:41:16,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2019-10-13 21:41:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:41:16,650 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:41:16,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:41:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:41:16,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:41:16,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:41:16,938 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-10-13 21:41:17,065 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a17~0 |old(~a17~0)|) [2019-10-13 21:41:17,065 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:41:17,065 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-13 21:41:17,065 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-13 21:41:17,066 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-13 21:41:17,066 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-13 21:41:17,066 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-13 21:41:17,066 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-13 21:41:17,066 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-13 21:41:17,066 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-13 21:41:17,066 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-13 21:41:17,067 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-13 21:41:17,067 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-13 21:41:17,067 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-13 21:41:17,067 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-13 21:41:17,067 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-13 21:41:17,067 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-13 21:41:17,067 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-13 21:41:17,068 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-13 21:41:17,068 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-13 21:41:17,068 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-13 21:41:17,068 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-13 21:41:17,068 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-13 21:41:17,068 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-13 21:41:17,068 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-13 21:41:17,069 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-13 21:41:17,069 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-13 21:41:17,069 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:17,069 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-13 21:41:17,069 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-13 21:41:17,069 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-13 21:41:17,069 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-13 21:41:17,070 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-13 21:41:17,070 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-13 21:41:17,070 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-13 21:41:17,070 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-13 21:41:17,070 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-13 21:41:17,070 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:17,071 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:17,071 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-13 21:41:17,071 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-13 21:41:17,071 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-13 21:41:17,071 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-13 21:41:17,071 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-13 21:41:17,071 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-13 21:41:17,071 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-13 21:41:17,072 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 514) no Hoare annotation was computed. [2019-10-13 21:41:17,072 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-13 21:41:17,072 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-13 21:41:17,072 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-13 21:41:17,072 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-13 21:41:17,072 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-13 21:41:17,073 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-13 21:41:17,073 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-13 21:41:17,073 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-13 21:41:17,073 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-13 21:41:17,073 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-13 21:41:17,073 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-13 21:41:17,073 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-13 21:41:17,074 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-13 21:41:17,074 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (= ~a11~0 1)) (.cse2 (not (= 1 |old(~a11~0)|))) (.cse4 (not (= 1 |old(~a25~0)|))) (.cse6 (= ~a25~0 1)) (.cse8 (= 9 |old(~a28~0)|)) (.cse7 (not (= ~a28~0 9))) (.cse1 (not (<= 8 |old(~a17~0)|))) (.cse3 (= 9 |old(~a17~0)|)) (.cse5 (= ~a17~0 |old(~a17~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (and .cse5 .cse6 .cse0) .cse2 .cse3) (or (and .cse5 .cse0 .cse7) .cse8 .cse2 .cse3) (or (and .cse5 .cse6 .cse7) .cse3 (or .cse4 .cse8)) (or .cse1 .cse4 .cse6 .cse3) (or .cse1 .cse8 .cse7 .cse3) (or .cse1 .cse3 .cse5))) [2019-10-13 21:41:17,074 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-13 21:41:17,074 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-13 21:41:17,074 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-13 21:41:17,075 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-13 21:41:17,075 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-13 21:41:17,075 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-13 21:41:17,075 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-13 21:41:17,075 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-13 21:41:17,075 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-13 21:41:17,075 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-13 21:41:17,076 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-13 21:41:17,076 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-13 21:41:17,076 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-13 21:41:17,076 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-13 21:41:17,076 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-13 21:41:17,076 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-13 21:41:17,076 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-13 21:41:17,077 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-13 21:41:17,077 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-13 21:41:17,077 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-13 21:41:17,077 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-13 21:41:17,077 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-13 21:41:17,077 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-13 21:41:17,078 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:41:17,078 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 8 ~a17~0) (not (= ~a28~0 9)) (not (= ~a17~0 9))) [2019-10-13 21:41:17,078 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:41:17,078 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:41:17,078 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (<= 8 |old(~a17~0)|)) (= 9 |old(~a28~0)|) (and (= ~a17~0 |old(~a17~0)|) (not (= ~a28~0 9))) (= 9 |old(~a17~0)|)) [2019-10-13 21:41:17,078 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (= ~a11~0 1)) (.cse1 (not (= ~a17~0 9)))) (or (not (<= 8 |old(~a17~0)|)) (and (= ~a25~0 1) .cse0 .cse1) (and .cse0 (not (= ~a28~0 9)) .cse1) (= 9 |old(~a28~0)|) (= 9 |old(~a17~0)|) (= ~a17~0 |old(~a17~0)|))) [2019-10-13 21:41:17,079 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-13 21:41:17,079 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-13 21:41:17,079 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= ~a11~0 1)) (.cse1 (not (= ~a17~0 9)))) (or (not (<= 8 |old(~a17~0)|)) (and (= ~a25~0 1) .cse0 .cse1) (and .cse0 (not (= ~a28~0 9)) .cse1) (= 9 |old(~a28~0)|) (= 9 |old(~a17~0)|) (= ~a17~0 |old(~a17~0)|))) [2019-10-13 21:41:17,079 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-13 21:41:17,079 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-13 21:41:17,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:41:17 BoogieIcfgContainer [2019-10-13 21:41:17,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:41:17,098 INFO L168 Benchmark]: Toolchain (without parser) took 8151.02 ms. Allocated memory was 137.9 MB in the beginning and 335.5 MB in the end (delta: 197.7 MB). Free memory was 100.2 MB in the beginning and 190.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 107.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:17,099 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:41:17,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 904.82 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.0 MB in the beginning and 168.9 MB in the end (delta: -68.9 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:17,101 INFO L168 Benchmark]: Boogie Preprocessor took 113.98 ms. Allocated memory is still 203.4 MB. Free memory was 168.9 MB in the beginning and 163.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:17,102 INFO L168 Benchmark]: RCFGBuilder took 2120.32 ms. Allocated memory was 203.4 MB in the beginning and 250.6 MB in the end (delta: 47.2 MB). Free memory was 163.9 MB in the beginning and 204.4 MB in the end (delta: -40.5 MB). Peak memory consumption was 117.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:17,103 INFO L168 Benchmark]: TraceAbstraction took 5007.32 ms. Allocated memory was 250.6 MB in the beginning and 335.5 MB in the end (delta: 84.9 MB). Free memory was 204.4 MB in the beginning and 190.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:41:17,107 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 904.82 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.0 MB in the beginning and 168.9 MB in the end (delta: -68.9 MB). Peak memory consumption was 33.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.98 ms. Allocated memory is still 203.4 MB. Free memory was 168.9 MB in the beginning and 163.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2120.32 ms. Allocated memory was 203.4 MB in the beginning and 250.6 MB in the end (delta: 47.2 MB). Free memory was 163.9 MB in the beginning and 204.4 MB in the end (delta: -40.5 MB). Peak memory consumption was 117.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5007.32 ms. Allocated memory was 250.6 MB in the beginning and 335.5 MB in the end (delta: 84.9 MB). Free memory was 204.4 MB in the beginning and 190.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 98.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 514]: 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: 606]: Loop Invariant Derived loop invariant: ((((!(8 <= \old(a17)) || ((a25 == 1 && a11 == 1) && !(a17 == 9))) || ((a11 == 1 && !(a28 == 9)) && !(a17 == 9))) || 9 == \old(a28)) || 9 == \old(a17)) || a17 == \old(a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 1 error locations. Result: SAFE, OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 416 SDtfs, 357 SDslu, 73 SDs, 0 SdLazy, 1226 SolverSat, 362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 289 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1099occurred 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, 84 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 37 PreInvPairs, 59 NumberOfFragments, 233 HoareAnnotationTreeSize, 37 FomulaSimplifications, 264 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 258 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 846 ConstructedInterpolants, 0 QuantifiedInterpolants, 296937 SizeOfPredicates, 2 NumberOfNonLiveVariables, 372 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 229/233 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...