/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:09,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:09,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:09,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:09,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:09,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:09,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:09,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:09,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:09,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:09,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:09,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:09,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:09,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:09,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:09,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:09,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:09,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:09,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:09,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:09,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:09,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:09,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:09,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:09,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:09,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:09,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:09,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:09,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:09,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:09,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:09,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:09,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:09,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:09,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:09,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:09,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:09,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:09,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:09,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:09,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:09,806 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:31:09,821 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:09,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:09,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:09,822 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:09,823 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:09,823 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:09,823 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:09,823 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:09,823 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:09,823 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:09,824 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:09,824 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:09,824 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:09,824 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:09,825 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:09,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:09,825 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:09,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:09,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:09,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:09,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:09,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:09,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:09,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:09,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:09,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:09,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:09,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:09,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:09,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:09,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:09,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:09,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:09,829 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:09,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:09,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:09,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:09,830 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:10,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:10,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:10,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:10,118 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:10,118 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:10,119 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label39.c [2019-11-23 23:31:10,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5dec42a/75190d41c766404096ea48759b95eda4/FLAGffaf3a876 [2019-11-23 23:31:10,771 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:10,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label39.c [2019-11-23 23:31:10,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5dec42a/75190d41c766404096ea48759b95eda4/FLAGffaf3a876 [2019-11-23 23:31:11,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5dec42a/75190d41c766404096ea48759b95eda4 [2019-11-23 23:31:11,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:11,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:11,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:11,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:11,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:11,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6a1297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11, skipping insertion in model container [2019-11-23 23:31:11,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:11,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:11,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:11,587 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:11,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:11,800 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:11,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11 WrapperNode [2019-11-23 23:31:11,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:11,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:11,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:11,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:11,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:11,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:11,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:11,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:11,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (1/1) ... [2019-11-23 23:31:11,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:11,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:11,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:11,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:11,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (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-11-23 23:31:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:12,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:14,161 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:14,161 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:14,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:14 BoogieIcfgContainer [2019-11-23 23:31:14,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:14,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:14,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:14,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:14,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:11" (1/3) ... [2019-11-23 23:31:14,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9545414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:14, skipping insertion in model container [2019-11-23 23:31:14,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:11" (2/3) ... [2019-11-23 23:31:14,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9545414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:14, skipping insertion in model container [2019-11-23 23:31:14,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:14" (3/3) ... [2019-11-23 23:31:14,178 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label39.c [2019-11-23 23:31:14,188 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:14,197 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:14,209 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:14,243 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:14,244 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:14,244 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:14,245 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:14,245 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:14,245 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:14,245 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:14,246 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:14,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:14,288 INFO L410 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] [2019-11-23 23:31:14,289 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1323228569, now seen corresponding path program 1 times [2019-11-23 23:31:14,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:14,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068646822] [2019-11-23 23:31:14,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:14,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068646822] [2019-11-23 23:31:14,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:14,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:14,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414750058] [2019-11-23 23:31:14,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:14,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:14,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:14,807 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 23:31:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:15,298 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-23 23:31:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:15,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 23:31:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:15,323 INFO L225 Difference]: With dead ends: 224 [2019-11-23 23:31:15,323 INFO L226 Difference]: Without dead ends: 145 [2019-11-23 23:31:15,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:31:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-23 23:31:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-23 23:31:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:31:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:31:15,417 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:31:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:15,419 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:31:15,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:31:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:31:15,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:15,426 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:31:15,426 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:15,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:15,427 INFO L82 PathProgramCache]: Analyzing trace with hash 585789151, now seen corresponding path program 1 times [2019-11-23 23:31:15,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:15,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711773481] [2019-11-23 23:31:15,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:15,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711773481] [2019-11-23 23:31:15,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:15,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:15,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823154475] [2019-11-23 23:31:15,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:15,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:15,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:15,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:15,507 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:31:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:15,994 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2019-11-23 23:31:15,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:15,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:31:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:15,997 INFO L225 Difference]: With dead ends: 431 [2019-11-23 23:31:15,997 INFO L226 Difference]: Without dead ends: 287 [2019-11-23 23:31:15,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-23 23:31:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-23 23:31:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:31:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 479 transitions. [2019-11-23 23:31:16,020 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 479 transitions. Word has length 76 [2019-11-23 23:31:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:16,020 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 479 transitions. [2019-11-23 23:31:16,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 479 transitions. [2019-11-23 23:31:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:31:16,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:16,026 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:31:16,026 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1566173749, now seen corresponding path program 1 times [2019-11-23 23:31:16,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:16,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154285711] [2019-11-23 23:31:16,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:16,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154285711] [2019-11-23 23:31:16,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:16,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:16,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860267207] [2019-11-23 23:31:16,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:16,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:16,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:16,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:16,134 INFO L87 Difference]: Start difference. First operand 287 states and 479 transitions. Second operand 3 states. [2019-11-23 23:31:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:16,458 INFO L93 Difference]: Finished difference Result 644 states and 1076 transitions. [2019-11-23 23:31:16,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:16,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:31:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:16,462 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:31:16,463 INFO L226 Difference]: Without dead ends: 358 [2019-11-23 23:31:16,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:31:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-23 23:31:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 287. [2019-11-23 23:31:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:31:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 473 transitions. [2019-11-23 23:31:16,479 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 473 transitions. Word has length 84 [2019-11-23 23:31:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:16,480 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 473 transitions. [2019-11-23 23:31:16,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 473 transitions. [2019-11-23 23:31:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:16,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:16,483 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:16,483 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:16,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:16,483 INFO L82 PathProgramCache]: Analyzing trace with hash -81006435, now seen corresponding path program 1 times [2019-11-23 23:31:16,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:16,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590467662] [2019-11-23 23:31:16,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:16,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590467662] [2019-11-23 23:31:16,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:16,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:16,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976395266] [2019-11-23 23:31:16,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:16,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:16,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:16,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:16,605 INFO L87 Difference]: Start difference. First operand 287 states and 473 transitions. Second operand 4 states. [2019-11-23 23:31:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:17,277 INFO L93 Difference]: Finished difference Result 1070 states and 1768 transitions. [2019-11-23 23:31:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:17,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-23 23:31:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:17,282 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:31:17,283 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:31:17,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:31:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 713. [2019-11-23 23:31:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:31:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1105 transitions. [2019-11-23 23:31:17,325 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1105 transitions. Word has length 93 [2019-11-23 23:31:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:17,326 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1105 transitions. [2019-11-23 23:31:17,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1105 transitions. [2019-11-23 23:31:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:31:17,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:17,329 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-23 23:31:17,330 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:17,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2009846028, now seen corresponding path program 1 times [2019-11-23 23:31:17,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:17,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761269735] [2019-11-23 23:31:17,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:17,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761269735] [2019-11-23 23:31:17,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:17,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:17,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760355664] [2019-11-23 23:31:17,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:17,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:17,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:17,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:17,453 INFO L87 Difference]: Start difference. First operand 713 states and 1105 transitions. Second operand 4 states. [2019-11-23 23:31:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:18,013 INFO L93 Difference]: Finished difference Result 1513 states and 2315 transitions. [2019-11-23 23:31:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:18,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 23:31:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:18,020 INFO L225 Difference]: With dead ends: 1513 [2019-11-23 23:31:18,020 INFO L226 Difference]: Without dead ends: 801 [2019-11-23 23:31:18,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-23 23:31:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 784. [2019-11-23 23:31:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1182 transitions. [2019-11-23 23:31:18,044 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1182 transitions. Word has length 99 [2019-11-23 23:31:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:18,045 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1182 transitions. [2019-11-23 23:31:18,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1182 transitions. [2019-11-23 23:31:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 23:31:18,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:18,048 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:18,048 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1788105540, now seen corresponding path program 1 times [2019-11-23 23:31:18,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:18,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550720414] [2019-11-23 23:31:18,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:18,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550720414] [2019-11-23 23:31:18,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:18,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:18,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036753785] [2019-11-23 23:31:18,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:18,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:18,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:18,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:18,111 INFO L87 Difference]: Start difference. First operand 784 states and 1182 transitions. Second operand 4 states. [2019-11-23 23:31:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:18,605 INFO L93 Difference]: Finished difference Result 1567 states and 2375 transitions. [2019-11-23 23:31:18,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:18,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 23:31:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:18,610 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:31:18,611 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:31:18,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:31:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-23 23:31:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1253 transitions. [2019-11-23 23:31:18,635 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1253 transitions. Word has length 103 [2019-11-23 23:31:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:18,636 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1253 transitions. [2019-11-23 23:31:18,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1253 transitions. [2019-11-23 23:31:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 23:31:18,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:18,639 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:18,639 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:18,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1752329919, now seen corresponding path program 1 times [2019-11-23 23:31:18,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:18,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542154208] [2019-11-23 23:31:18,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:18,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542154208] [2019-11-23 23:31:18,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:18,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:18,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863866727] [2019-11-23 23:31:18,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:18,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:18,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:18,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:18,736 INFO L87 Difference]: Start difference. First operand 855 states and 1253 transitions. Second operand 3 states. [2019-11-23 23:31:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:19,182 INFO L93 Difference]: Finished difference Result 1993 states and 2965 transitions. [2019-11-23 23:31:19,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:19,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 23:31:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:19,189 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:31:19,189 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:31:19,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 23:31:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:31:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-23 23:31:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:31:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1147 transitions. [2019-11-23 23:31:19,216 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1147 transitions. Word has length 106 [2019-11-23 23:31:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:19,216 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1147 transitions. [2019-11-23 23:31:19,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1147 transitions. [2019-11-23 23:31:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 23:31:19,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:19,223 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 23:31:19,223 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1472778589, now seen corresponding path program 1 times [2019-11-23 23:31:19,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:19,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994925915] [2019-11-23 23:31:19,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:19,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994925915] [2019-11-23 23:31:19,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:19,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:19,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315535122] [2019-11-23 23:31:19,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:31:19,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:19,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:31:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:19,341 INFO L87 Difference]: Start difference. First operand 926 states and 1147 transitions. Second operand 5 states. [2019-11-23 23:31:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:20,022 INFO L93 Difference]: Finished difference Result 2492 states and 3154 transitions. [2019-11-23 23:31:20,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:20,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 23:31:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:20,030 INFO L225 Difference]: With dead ends: 2492 [2019-11-23 23:31:20,031 INFO L226 Difference]: Without dead ends: 1638 [2019-11-23 23:31:20,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2019-11-23 23:31:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1352. [2019-11-23 23:31:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-23 23:31:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1625 transitions. [2019-11-23 23:31:20,070 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1625 transitions. Word has length 121 [2019-11-23 23:31:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:20,071 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1625 transitions. [2019-11-23 23:31:20,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:31:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1625 transitions. [2019-11-23 23:31:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:31:20,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:20,075 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-23 23:31:20,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1169271863, now seen corresponding path program 1 times [2019-11-23 23:31:20,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:20,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622399441] [2019-11-23 23:31:20,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 23:31:20,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622399441] [2019-11-23 23:31:20,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:20,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:20,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486566633] [2019-11-23 23:31:20,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:20,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:20,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:20,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:20,232 INFO L87 Difference]: Start difference. First operand 1352 states and 1625 transitions. Second operand 4 states. [2019-11-23 23:31:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:20,782 INFO L93 Difference]: Finished difference Result 2916 states and 3544 transitions. [2019-11-23 23:31:20,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:20,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 23:31:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:20,789 INFO L225 Difference]: With dead ends: 2916 [2019-11-23 23:31:20,789 INFO L226 Difference]: Without dead ends: 1565 [2019-11-23 23:31:20,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-11-23 23:31:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1352. [2019-11-23 23:31:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-23 23:31:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1546 transitions. [2019-11-23 23:31:20,823 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1546 transitions. Word has length 150 [2019-11-23 23:31:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:20,824 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1546 transitions. [2019-11-23 23:31:20,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1546 transitions. [2019-11-23 23:31:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-23 23:31:20,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:20,829 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:20,829 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash -986741178, now seen corresponding path program 1 times [2019-11-23 23:31:20,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:20,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566588760] [2019-11-23 23:31:20,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-23 23:31:20,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566588760] [2019-11-23 23:31:20,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:20,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:20,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513931910] [2019-11-23 23:31:20,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:20,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:20,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:20,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:20,942 INFO L87 Difference]: Start difference. First operand 1352 states and 1546 transitions. Second operand 4 states. [2019-11-23 23:31:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:21,402 INFO L93 Difference]: Finished difference Result 2774 states and 3171 transitions. [2019-11-23 23:31:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:21,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-11-23 23:31:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:21,417 INFO L225 Difference]: With dead ends: 2774 [2019-11-23 23:31:21,417 INFO L226 Difference]: Without dead ends: 1494 [2019-11-23 23:31:21,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-23 23:31:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1281. [2019-11-23 23:31:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-11-23 23:31:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1452 transitions. [2019-11-23 23:31:21,451 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1452 transitions. Word has length 241 [2019-11-23 23:31:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:21,452 INFO L462 AbstractCegarLoop]: Abstraction has 1281 states and 1452 transitions. [2019-11-23 23:31:21,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1452 transitions. [2019-11-23 23:31:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-23 23:31:21,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:21,458 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:21,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:21,459 INFO L82 PathProgramCache]: Analyzing trace with hash -352592681, now seen corresponding path program 1 times [2019-11-23 23:31:21,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:21,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316105803] [2019-11-23 23:31:21,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:31:21,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316105803] [2019-11-23 23:31:21,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:21,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:21,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006566300] [2019-11-23 23:31:21,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:21,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:21,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:21,615 INFO L87 Difference]: Start difference. First operand 1281 states and 1452 transitions. Second operand 3 states. [2019-11-23 23:31:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:21,985 INFO L93 Difference]: Finished difference Result 2630 states and 2997 transitions. [2019-11-23 23:31:21,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:21,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-23 23:31:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:21,987 INFO L225 Difference]: With dead ends: 2630 [2019-11-23 23:31:21,987 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:21,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 23:31:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:21,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2019-11-23 23:31:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:21,992 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:21,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:21,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:22,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:22,338 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-11-23 23:31:22,496 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:22,500 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:22,501 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 23:31:22,502 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:22,502 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1))) (let ((.cse4 (= ~a16~0 6)) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a16~0 4)) (.cse3 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= 15 ~a8~0)) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1) (= 1 ~a7~0) (and .cse2 .cse3 .cse4) (and .cse5 (= ~a21~0 1)) (and .cse6 .cse7) (and .cse6 .cse2 .cse4) (and .cse6 .cse0 .cse3) (and .cse1 .cse2 .cse7)))) [2019-11-23 23:31:22,503 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:22,503 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:22,503 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:22,503 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:22,503 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:22,504 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:22,504 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:22,504 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:22,504 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:22,504 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:22,504 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:22,504 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:22,504 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:22,505 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:22,505 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:22,505 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:22,505 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:22,505 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:22,505 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:22,505 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:22,505 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:22,506 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:22,506 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:22,506 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1))) (let ((.cse4 (= ~a16~0 6)) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a16~0 4)) (.cse3 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= 15 ~a8~0)) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1) (= 1 ~a7~0) (and .cse2 .cse3 .cse4) (and .cse5 (= ~a21~0 1)) (and .cse6 .cse7) (and .cse6 .cse2 .cse4) (and .cse6 .cse0 .cse3) (and .cse1 .cse2 .cse7)))) [2019-11-23 23:31:22,506 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:22,506 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:22,506 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:22,507 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:22,507 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:22,507 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:22,507 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:22,507 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:22,507 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:22,507 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:22,507 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:22,508 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:22,509 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:22,509 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:22,509 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 572) no Hoare annotation was computed. [2019-11-23 23:31:22,509 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:22,509 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:22,509 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:22,509 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:22,509 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:22,510 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:22,510 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:22,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:22 BoogieIcfgContainer [2019-11-23 23:31:22,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:22,531 INFO L168 Benchmark]: Toolchain (without parser) took 11518.39 ms. Allocated memory was 137.9 MB in the beginning and 395.3 MB in the end (delta: 257.4 MB). Free memory was 100.2 MB in the beginning and 309.8 MB in the end (delta: -209.6 MB). Peak memory consumption was 273.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:22,532 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:22,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.06 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 100.0 MB in the beginning and 171.1 MB in the end (delta: -71.1 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:22,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.83 ms. Allocated memory is still 204.5 MB. Free memory was 171.1 MB in the beginning and 164.7 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:22,535 INFO L168 Benchmark]: Boogie Preprocessor took 64.72 ms. Allocated memory is still 204.5 MB. Free memory was 164.7 MB in the beginning and 160.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:22,536 INFO L168 Benchmark]: RCFGBuilder took 2211.15 ms. Allocated memory was 204.5 MB in the beginning and 253.2 MB in the end (delta: 48.8 MB). Free memory was 160.5 MB in the beginning and 206.0 MB in the end (delta: -45.5 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:22,537 INFO L168 Benchmark]: TraceAbstraction took 8361.03 ms. Allocated memory was 253.2 MB in the beginning and 395.3 MB in the end (delta: 142.1 MB). Free memory was 206.0 MB in the beginning and 309.8 MB in the end (delta: -103.8 MB). Peak memory consumption was 263.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:22,542 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.29 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.06 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 100.0 MB in the beginning and 171.1 MB in the end (delta: -71.1 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.83 ms. Allocated memory is still 204.5 MB. Free memory was 171.1 MB in the beginning and 164.7 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.72 ms. Allocated memory is still 204.5 MB. Free memory was 164.7 MB in the beginning and 160.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2211.15 ms. Allocated memory was 204.5 MB in the beginning and 253.2 MB in the end (delta: 48.8 MB). Free memory was 160.5 MB in the beginning and 206.0 MB in the end (delta: -45.5 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8361.03 ms. Allocated memory was 253.2 MB in the beginning and 395.3 MB in the end (delta: 142.1 MB). Free memory was 206.0 MB in the beginning and 309.8 MB in the end (delta: -103.8 MB). Peak memory consumption was 263.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 572]: 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: 30]: Loop Invariant Derived loop invariant: (((((((a16 == 4 && a17 <= 0) || 1 == a7) || ((15 == a8 && !(a17 == 1)) && a16 == 6)) || (a17 == 1 && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((a16 == 4 && a17 <= 0) || 1 == a7) || ((15 == a8 && !(a17 == 1)) && a16 == 6)) || (a17 == 1 && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 8.2s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 659 SDtfs, 1119 SDslu, 101 SDs, 0 SdLazy, 3391 SolverSat, 728 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1352occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1013 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 51 NumberOfFragments, 141 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3731 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 112 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1390 ConstructedInterpolants, 0 QuantifiedInterpolants, 381371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1139/1139 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...