/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/Problem03_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:50,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:50,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:50,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:50,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:50,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:50,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:50,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:50,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:50,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:50,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:50,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:50,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:50,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:50,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:50,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:50,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:50,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:50,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:50,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:50,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:50,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:50,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:50,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:50,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:50,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:50,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:50,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:50,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:50,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:50,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:50,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:50,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:50,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:50,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:50,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:50,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:50,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:50,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:50,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:50,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:50,997 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:33:51,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:51,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:51,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:51,014 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:51,014 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:51,014 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:51,014 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:51,015 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:51,015 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:51,015 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:51,015 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:51,015 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:51,016 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:51,016 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:51,016 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:51,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:51,017 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:51,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:51,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:51,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:51,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:51,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:51,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:51,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:51,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:51,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:51,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:51,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:51,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:51,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:51,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:51,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:51,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:51,021 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:51,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:51,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:51,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:51,021 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:51,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:51,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:51,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:51,361 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:51,362 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:51,362 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label13.c [2019-11-23 23:33:51,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0055e2054/25386242010746f587dabdd2368ab176/FLAGc72791794 [2019-11-23 23:33:52,091 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:52,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label13.c [2019-11-23 23:33:52,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0055e2054/25386242010746f587dabdd2368ab176/FLAGc72791794 [2019-11-23 23:33:52,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0055e2054/25386242010746f587dabdd2368ab176 [2019-11-23 23:33:52,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:52,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:52,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:52,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:52,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:52,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:52" (1/1) ... [2019-11-23 23:33:52,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:52, skipping insertion in model container [2019-11-23 23:33:52,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:52" (1/1) ... [2019-11-23 23:33:52,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:52,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:53,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:53,135 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:53,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:53,385 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:53,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53 WrapperNode [2019-11-23 23:33:53,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:53,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:53,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:53,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:53,396 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:33:53" (1/1) ... [2019-11-23 23:33:53,423 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:33:53" (1/1) ... [2019-11-23 23:33:53,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:53,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:53,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:53,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:53,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (1/1) ... [2019-11-23 23:33:53,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:53,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:53,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:53,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:53,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (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:33:53,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:53,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:56,671 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:56,671 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:56,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:56 BoogieIcfgContainer [2019-11-23 23:33:56,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:56,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:56,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:56,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:56,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:52" (1/3) ... [2019-11-23 23:33:56,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7698691b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:56, skipping insertion in model container [2019-11-23 23:33:56,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:53" (2/3) ... [2019-11-23 23:33:56,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7698691b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:56, skipping insertion in model container [2019-11-23 23:33:56,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:56" (3/3) ... [2019-11-23 23:33:56,681 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label13.c [2019-11-23 23:33:56,691 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:56,699 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:56,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:56,738 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:56,738 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:56,738 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:56,738 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:56,739 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:56,739 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:56,739 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:56,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:33:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:33:56,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:56,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:56,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1467461611, now seen corresponding path program 1 times [2019-11-23 23:33:56,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:56,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938562125] [2019-11-23 23:33:56,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:57,552 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:33:57,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938562125] [2019-11-23 23:33:57,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:57,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:57,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374853069] [2019-11-23 23:33:57,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:57,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:57,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:57,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:57,579 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:33:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:59,454 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:33:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:59,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:33:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:59,477 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:33:59,477 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:33:59,481 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:33:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:33:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-11-23 23:33:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-23 23:33:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 728 transitions. [2019-11-23 23:33:59,553 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 728 transitions. Word has length 143 [2019-11-23 23:33:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:59,554 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 728 transitions. [2019-11-23 23:33:59,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 728 transitions. [2019-11-23 23:33:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:33:59,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:59,559 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:59,559 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1977888588, now seen corresponding path program 1 times [2019-11-23 23:33:59,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:59,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965281402] [2019-11-23 23:33:59,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:59,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965281402] [2019-11-23 23:33:59,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:59,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:59,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698064454] [2019-11-23 23:33:59,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:59,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:59,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:59,643 INFO L87 Difference]: Start difference. First operand 432 states and 728 transitions. Second operand 3 states. [2019-11-23 23:34:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:00,588 INFO L93 Difference]: Finished difference Result 1292 states and 2181 transitions. [2019-11-23 23:34:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:00,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:34:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:00,594 INFO L225 Difference]: With dead ends: 1292 [2019-11-23 23:34:00,595 INFO L226 Difference]: Without dead ends: 861 [2019-11-23 23:34:00,598 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:34:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-11-23 23:34:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-11-23 23:34:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-11-23 23:34:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1411 transitions. [2019-11-23 23:34:00,647 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1411 transitions. Word has length 151 [2019-11-23 23:34:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:00,647 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1411 transitions. [2019-11-23 23:34:00,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1411 transitions. [2019-11-23 23:34:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:34:00,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:00,655 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:00,655 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:00,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:00,656 INFO L82 PathProgramCache]: Analyzing trace with hash 559026267, now seen corresponding path program 1 times [2019-11-23 23:34:00,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:00,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602989042] [2019-11-23 23:34:00,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 23:34:00,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602989042] [2019-11-23 23:34:00,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:00,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:00,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909575551] [2019-11-23 23:34:00,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:00,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:00,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:00,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:00,778 INFO L87 Difference]: Start difference. First operand 861 states and 1411 transitions. Second operand 3 states. [2019-11-23 23:34:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:01,201 INFO L93 Difference]: Finished difference Result 2581 states and 4231 transitions. [2019-11-23 23:34:01,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:01,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 23:34:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:01,214 INFO L225 Difference]: With dead ends: 2581 [2019-11-23 23:34:01,214 INFO L226 Difference]: Without dead ends: 1721 [2019-11-23 23:34:01,217 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:34:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-23 23:34:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2019-11-23 23:34:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:34:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2808 transitions. [2019-11-23 23:34:01,312 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2808 transitions. Word has length 163 [2019-11-23 23:34:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:01,313 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2808 transitions. [2019-11-23 23:34:01,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2808 transitions. [2019-11-23 23:34:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 23:34:01,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:01,322 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:01,322 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1010849081, now seen corresponding path program 1 times [2019-11-23 23:34:01,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:01,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908296276] [2019-11-23 23:34:01,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:34:01,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908296276] [2019-11-23 23:34:01,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:01,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:01,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595961289] [2019-11-23 23:34:01,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:01,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:01,523 INFO L87 Difference]: Start difference. First operand 1719 states and 2808 transitions. Second operand 3 states. [2019-11-23 23:34:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:01,987 INFO L93 Difference]: Finished difference Result 3437 states and 5615 transitions. [2019-11-23 23:34:01,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:01,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 23:34:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:01,997 INFO L225 Difference]: With dead ends: 3437 [2019-11-23 23:34:01,997 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:34:02,000 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:34:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:34:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:34:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:34:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2732 transitions. [2019-11-23 23:34:02,041 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2732 transitions. Word has length 171 [2019-11-23 23:34:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:02,041 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2732 transitions. [2019-11-23 23:34:02,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2732 transitions. [2019-11-23 23:34:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:34:02,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:02,046 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:02,046 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1690918503, now seen corresponding path program 1 times [2019-11-23 23:34:02,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:02,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998804565] [2019-11-23 23:34:02,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:02,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998804565] [2019-11-23 23:34:02,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:02,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:34:02,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535152762] [2019-11-23 23:34:02,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:34:02,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:02,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:34:02,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:02,263 INFO L87 Difference]: Start difference. First operand 1719 states and 2732 transitions. Second operand 5 states. [2019-11-23 23:34:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:04,011 INFO L93 Difference]: Finished difference Result 4156 states and 6691 transitions. [2019-11-23 23:34:04,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:34:04,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 23:34:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:04,025 INFO L225 Difference]: With dead ends: 4156 [2019-11-23 23:34:04,025 INFO L226 Difference]: Without dead ends: 2438 [2019-11-23 23:34:04,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:34:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2019-11-23 23:34:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2005. [2019-11-23 23:34:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-11-23 23:34:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 3202 transitions. [2019-11-23 23:34:04,082 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 3202 transitions. Word has length 181 [2019-11-23 23:34:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:04,083 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 3202 transitions. [2019-11-23 23:34:04,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:34:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 3202 transitions. [2019-11-23 23:34:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-23 23:34:04,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:04,089 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:04,089 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1151922907, now seen corresponding path program 1 times [2019-11-23 23:34:04,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:04,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152215326] [2019-11-23 23:34:04,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 23:34:04,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152215326] [2019-11-23 23:34:04,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848251921] [2019-11-23 23:34:04,253 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-11-23 23:34:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:04,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:34:04,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 23:34:04,607 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 23:34:04,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:04,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 3 [2019-11-23 23:34:04,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927577795] [2019-11-23 23:34:04,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:04,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:04,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:04,660 INFO L87 Difference]: Start difference. First operand 2005 states and 3202 transitions. Second operand 3 states. [2019-11-23 23:34:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:05,013 INFO L93 Difference]: Finished difference Result 6013 states and 9604 transitions. [2019-11-23 23:34:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:05,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-11-23 23:34:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:05,042 INFO L225 Difference]: With dead ends: 6013 [2019-11-23 23:34:05,042 INFO L226 Difference]: Without dead ends: 4009 [2019-11-23 23:34:05,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-11-23 23:34:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4007. [2019-11-23 23:34:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-11-23 23:34:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 6380 transitions. [2019-11-23 23:34:05,165 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 6380 transitions. Word has length 215 [2019-11-23 23:34:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:05,166 INFO L462 AbstractCegarLoop]: Abstraction has 4007 states and 6380 transitions. [2019-11-23 23:34:05,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 6380 transitions. [2019-11-23 23:34:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-23 23:34:05,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:05,177 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:05,382 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:05,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:05,382 INFO L82 PathProgramCache]: Analyzing trace with hash -645100411, now seen corresponding path program 1 times [2019-11-23 23:34:05,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:05,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34842441] [2019-11-23 23:34:05,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:05,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34842441] [2019-11-23 23:34:05,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:05,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:05,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256220514] [2019-11-23 23:34:05,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:05,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:05,531 INFO L87 Difference]: Start difference. First operand 4007 states and 6380 transitions. Second operand 3 states. [2019-11-23 23:34:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:06,387 INFO L93 Difference]: Finished difference Result 12017 states and 19137 transitions. [2019-11-23 23:34:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:06,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-23 23:34:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:06,426 INFO L225 Difference]: With dead ends: 12017 [2019-11-23 23:34:06,426 INFO L226 Difference]: Without dead ends: 8011 [2019-11-23 23:34:06,433 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:34:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8011 states. [2019-11-23 23:34:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8011 to 8011. [2019-11-23 23:34:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-11-23 23:34:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 11620 transitions. [2019-11-23 23:34:06,583 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 11620 transitions. Word has length 216 [2019-11-23 23:34:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:06,583 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 11620 transitions. [2019-11-23 23:34:06,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 11620 transitions. [2019-11-23 23:34:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-23 23:34:06,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:06,597 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:06,597 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:06,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:06,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1716624663, now seen corresponding path program 1 times [2019-11-23 23:34:06,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:06,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865701879] [2019-11-23 23:34:06,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:34:06,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865701879] [2019-11-23 23:34:06,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:06,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:06,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898074144] [2019-11-23 23:34:06,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:06,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:06,731 INFO L87 Difference]: Start difference. First operand 8011 states and 11620 transitions. Second operand 3 states. [2019-11-23 23:34:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:07,627 INFO L93 Difference]: Finished difference Result 18023 states and 26582 transitions. [2019-11-23 23:34:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:07,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-23 23:34:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:07,667 INFO L225 Difference]: With dead ends: 18023 [2019-11-23 23:34:07,668 INFO L226 Difference]: Without dead ends: 10013 [2019-11-23 23:34:07,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:34:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2019-11-23 23:34:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 10013. [2019-11-23 23:34:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10013 states. [2019-11-23 23:34:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10013 states to 10013 states and 13732 transitions. [2019-11-23 23:34:07,835 INFO L78 Accepts]: Start accepts. Automaton has 10013 states and 13732 transitions. Word has length 220 [2019-11-23 23:34:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:07,836 INFO L462 AbstractCegarLoop]: Abstraction has 10013 states and 13732 transitions. [2019-11-23 23:34:07,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 10013 states and 13732 transitions. [2019-11-23 23:34:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 23:34:07,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:07,846 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:07,846 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2120042647, now seen corresponding path program 1 times [2019-11-23 23:34:07,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:07,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227064607] [2019-11-23 23:34:07,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:08,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227064607] [2019-11-23 23:34:08,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:08,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:08,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132451073] [2019-11-23 23:34:08,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:08,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:08,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:08,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:08,015 INFO L87 Difference]: Start difference. First operand 10013 states and 13732 transitions. Second operand 4 states. [2019-11-23 23:34:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:09,331 INFO L93 Difference]: Finished difference Result 33183 states and 45028 transitions. [2019-11-23 23:34:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:09,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-23 23:34:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:09,386 INFO L225 Difference]: With dead ends: 33183 [2019-11-23 23:34:09,387 INFO L226 Difference]: Without dead ends: 23171 [2019-11-23 23:34:09,401 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:34:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23171 states. [2019-11-23 23:34:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23171 to 17449. [2019-11-23 23:34:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17449 states. [2019-11-23 23:34:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17449 states to 17449 states and 22844 transitions. [2019-11-23 23:34:09,680 INFO L78 Accepts]: Start accepts. Automaton has 17449 states and 22844 transitions. Word has length 221 [2019-11-23 23:34:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:09,680 INFO L462 AbstractCegarLoop]: Abstraction has 17449 states and 22844 transitions. [2019-11-23 23:34:09,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 17449 states and 22844 transitions. [2019-11-23 23:34:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-23 23:34:09,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:09,698 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:09,699 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:09,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:09,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1755236565, now seen corresponding path program 1 times [2019-11-23 23:34:09,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:09,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816511302] [2019-11-23 23:34:09,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:09,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816511302] [2019-11-23 23:34:09,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:09,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:09,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535428362] [2019-11-23 23:34:09,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:09,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:09,921 INFO L87 Difference]: Start difference. First operand 17449 states and 22844 transitions. Second operand 4 states. [2019-11-23 23:34:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:11,035 INFO L93 Difference]: Finished difference Result 38186 states and 50656 transitions. [2019-11-23 23:34:11,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:11,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-23 23:34:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:11,070 INFO L225 Difference]: With dead ends: 38186 [2019-11-23 23:34:11,071 INFO L226 Difference]: Without dead ends: 20738 [2019-11-23 23:34:11,090 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:34:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20738 states. [2019-11-23 23:34:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20738 to 20738. [2019-11-23 23:34:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20738 states. [2019-11-23 23:34:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20738 states to 20738 states and 26229 transitions. [2019-11-23 23:34:11,390 INFO L78 Accepts]: Start accepts. Automaton has 20738 states and 26229 transitions. Word has length 229 [2019-11-23 23:34:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:11,390 INFO L462 AbstractCegarLoop]: Abstraction has 20738 states and 26229 transitions. [2019-11-23 23:34:11,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 20738 states and 26229 transitions. [2019-11-23 23:34:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-23 23:34:11,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:11,408 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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:34:11,408 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1442927757, now seen corresponding path program 1 times [2019-11-23 23:34:11,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:11,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58071936] [2019-11-23 23:34:11,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:11,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58071936] [2019-11-23 23:34:11,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570114369] [2019-11-23 23:34:11,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:12,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:34:12,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:34:12,408 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:34:12,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:12,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-11-23 23:34:12,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863744232] [2019-11-23 23:34:12,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:12,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:12,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:12,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:34:12,466 INFO L87 Difference]: Start difference. First operand 20738 states and 26229 transitions. Second operand 3 states. [2019-11-23 23:34:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:13,344 INFO L93 Difference]: Finished difference Result 52772 states and 66426 transitions. [2019-11-23 23:34:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:13,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-11-23 23:34:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:13,385 INFO L225 Difference]: With dead ends: 52772 [2019-11-23 23:34:13,385 INFO L226 Difference]: Without dead ends: 32035 [2019-11-23 23:34:13,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 470 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:34:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32035 states. [2019-11-23 23:34:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32035 to 32035. [2019-11-23 23:34:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32035 states. [2019-11-23 23:34:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32035 states to 32035 states and 39370 transitions. [2019-11-23 23:34:14,033 INFO L78 Accepts]: Start accepts. Automaton has 32035 states and 39370 transitions. Word has length 236 [2019-11-23 23:34:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:14,033 INFO L462 AbstractCegarLoop]: Abstraction has 32035 states and 39370 transitions. [2019-11-23 23:34:14,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 32035 states and 39370 transitions. [2019-11-23 23:34:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-23 23:34:14,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:14,059 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2019-11-23 23:34:14,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:14,269 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:14,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash 659468774, now seen corresponding path program 1 times [2019-11-23 23:34:14,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:14,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808596986] [2019-11-23 23:34:14,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 23:34:14,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808596986] [2019-11-23 23:34:14,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:14,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:14,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109739128] [2019-11-23 23:34:14,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:14,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:14,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:14,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:14,429 INFO L87 Difference]: Start difference. First operand 32035 states and 39370 transitions. Second operand 4 states. [2019-11-23 23:34:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:16,194 INFO L93 Difference]: Finished difference Result 115267 states and 141718 transitions. [2019-11-23 23:34:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:16,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-11-23 23:34:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:17,490 INFO L225 Difference]: With dead ends: 115267 [2019-11-23 23:34:17,490 INFO L226 Difference]: Without dead ends: 83233 [2019-11-23 23:34:17,507 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:34:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83233 states. [2019-11-23 23:34:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83233 to 83229. [2019-11-23 23:34:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83229 states. [2019-11-23 23:34:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83229 states to 83229 states and 101986 transitions. [2019-11-23 23:34:18,598 INFO L78 Accepts]: Start accepts. Automaton has 83229 states and 101986 transitions. Word has length 294 [2019-11-23 23:34:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:18,599 INFO L462 AbstractCegarLoop]: Abstraction has 83229 states and 101986 transitions. [2019-11-23 23:34:18,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 83229 states and 101986 transitions. [2019-11-23 23:34:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-23 23:34:18,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:18,622 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-23 23:34:18,622 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash -121508418, now seen corresponding path program 1 times [2019-11-23 23:34:18,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:18,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667121875] [2019-11-23 23:34:18,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 23:34:18,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667121875] [2019-11-23 23:34:18,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:18,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:18,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566097569] [2019-11-23 23:34:18,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:18,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:18,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:18,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:18,810 INFO L87 Difference]: Start difference. First operand 83229 states and 101986 transitions. Second operand 4 states. [2019-11-23 23:34:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:20,309 INFO L93 Difference]: Finished difference Result 202636 states and 247151 transitions. [2019-11-23 23:34:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:20,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-11-23 23:34:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:22,315 INFO L225 Difference]: With dead ends: 202636 [2019-11-23 23:34:22,316 INFO L226 Difference]: Without dead ends: 119408 [2019-11-23 23:34:22,358 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:34:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119408 states. [2019-11-23 23:34:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119408 to 91809. [2019-11-23 23:34:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91809 states. [2019-11-23 23:34:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91809 states to 91809 states and 112469 transitions. [2019-11-23 23:34:23,525 INFO L78 Accepts]: Start accepts. Automaton has 91809 states and 112469 transitions. Word has length 319 [2019-11-23 23:34:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:23,525 INFO L462 AbstractCegarLoop]: Abstraction has 91809 states and 112469 transitions. [2019-11-23 23:34:23,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 91809 states and 112469 transitions. [2019-11-23 23:34:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-11-23 23:34:23,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:23,539 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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] [2019-11-23 23:34:23,539 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash 348729554, now seen corresponding path program 1 times [2019-11-23 23:34:23,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:23,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309547849] [2019-11-23 23:34:23,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-23 23:34:23,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309547849] [2019-11-23 23:34:23,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:23,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:23,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115648017] [2019-11-23 23:34:23,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:23,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:23,679 INFO L87 Difference]: Start difference. First operand 91809 states and 112469 transitions. Second operand 3 states. [2019-11-23 23:34:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:24,958 INFO L93 Difference]: Finished difference Result 223514 states and 272669 transitions. [2019-11-23 23:34:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:24,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-11-23 23:34:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:25,081 INFO L225 Difference]: With dead ends: 223514 [2019-11-23 23:34:25,081 INFO L226 Difference]: Without dead ends: 131706 [2019-11-23 23:34:25,128 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:34:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131706 states. [2019-11-23 23:34:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131706 to 131706. [2019-11-23 23:34:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131706 states. [2019-11-23 23:34:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131706 states to 131706 states and 159944 transitions. [2019-11-23 23:34:29,435 INFO L78 Accepts]: Start accepts. Automaton has 131706 states and 159944 transitions. Word has length 329 [2019-11-23 23:34:29,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:29,436 INFO L462 AbstractCegarLoop]: Abstraction has 131706 states and 159944 transitions. [2019-11-23 23:34:29,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 131706 states and 159944 transitions. [2019-11-23 23:34:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-23 23:34:29,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:29,461 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2019-11-23 23:34:29,461 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1581749553, now seen corresponding path program 1 times [2019-11-23 23:34:29,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:29,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401135906] [2019-11-23 23:34:29,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-23 23:34:29,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401135906] [2019-11-23 23:34:29,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374863438] [2019-11-23 23:34:29,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:29,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:34:29,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-23 23:34:29,940 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:29,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:34:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-23 23:34:30,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:30,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:34:30,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067748509] [2019-11-23 23:34:30,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:30,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:30,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:30,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:34:30,055 INFO L87 Difference]: Start difference. First operand 131706 states and 159944 transitions. Second operand 4 states. [2019-11-23 23:34:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:32,038 INFO L93 Difference]: Finished difference Result 352359 states and 428037 transitions. [2019-11-23 23:34:32,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:32,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-11-23 23:34:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:32,271 INFO L225 Difference]: With dead ends: 352359 [2019-11-23 23:34:32,271 INFO L226 Difference]: Without dead ends: 220654 [2019-11-23 23:34:32,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 668 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:34:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220654 states. [2019-11-23 23:34:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220654 to 215647. [2019-11-23 23:34:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215647 states. [2019-11-23 23:34:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215647 states to 215647 states and 259589 transitions. [2019-11-23 23:34:35,677 INFO L78 Accepts]: Start accepts. Automaton has 215647 states and 259589 transitions. Word has length 336 [2019-11-23 23:34:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:35,677 INFO L462 AbstractCegarLoop]: Abstraction has 215647 states and 259589 transitions. [2019-11-23 23:34:35,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 215647 states and 259589 transitions. [2019-11-23 23:34:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-23 23:34:35,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:35,713 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2019-11-23 23:34:35,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:35,917 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1362645905, now seen corresponding path program 1 times [2019-11-23 23:34:35,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:35,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332979664] [2019-11-23 23:34:35,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 23:34:36,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332979664] [2019-11-23 23:34:36,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:36,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:34:36,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836523011] [2019-11-23 23:34:36,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:34:36,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:34:36,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:36,131 INFO L87 Difference]: Start difference. First operand 215647 states and 259589 transitions. Second operand 5 states. [2019-11-23 23:34:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:39,386 INFO L93 Difference]: Finished difference Result 584875 states and 694485 transitions. [2019-11-23 23:34:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:34:39,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 336 [2019-11-23 23:34:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:39,789 INFO L225 Difference]: With dead ends: 584875 [2019-11-23 23:34:39,789 INFO L226 Difference]: Without dead ends: 369229 [2019-11-23 23:34:39,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:34:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369229 states. [2019-11-23 23:34:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369229 to 363795. [2019-11-23 23:34:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363795 states. [2019-11-23 23:34:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363795 states to 363795 states and 428482 transitions. [2019-11-23 23:34:49,457 INFO L78 Accepts]: Start accepts. Automaton has 363795 states and 428482 transitions. Word has length 336 [2019-11-23 23:34:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:49,457 INFO L462 AbstractCegarLoop]: Abstraction has 363795 states and 428482 transitions. [2019-11-23 23:34:49,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:34:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 363795 states and 428482 transitions. [2019-11-23 23:34:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-11-23 23:34:49,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:49,488 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:34:49,488 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash 649090944, now seen corresponding path program 1 times [2019-11-23 23:34:49,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:49,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120586618] [2019-11-23 23:34:49,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-23 23:34:49,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120586618] [2019-11-23 23:34:49,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:49,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:49,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400248219] [2019-11-23 23:34:49,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:49,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:49,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:49,694 INFO L87 Difference]: Start difference. First operand 363795 states and 428482 transitions. Second operand 4 states. [2019-11-23 23:34:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:53,780 INFO L93 Difference]: Finished difference Result 740602 states and 871592 transitions. [2019-11-23 23:34:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:53,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 340 [2019-11-23 23:34:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:54,240 INFO L225 Difference]: With dead ends: 740602 [2019-11-23 23:34:54,240 INFO L226 Difference]: Without dead ends: 376808 [2019-11-23 23:34:54,389 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:34:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376808 states.