/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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:46:14,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:46:14,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:46:14,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:46:14,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:46:14,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:46:14,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:46:14,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:46:14,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:46:14,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:46:14,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:46:14,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:46:14,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:46:14,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:46:14,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:46:14,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:46:14,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:46:14,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:46:14,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:46:14,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:46:14,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:46:14,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:46:14,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:46:14,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:46:14,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:46:14,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:46:14,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:46:14,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:46:14,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:46:14,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:46:14,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:46:14,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:46:14,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:46:14,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:46:14,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:46:14,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:46:14,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:46:14,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:46:14,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:46:14,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:46:14,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:46:14,459 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-24 05:46:14,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:46:14,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:46:14,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:46:14,475 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:46:14,475 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:46:14,475 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:46:14,476 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:46:14,476 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:46:14,476 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:46:14,476 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:46:14,476 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:46:14,476 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:46:14,477 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:46:14,477 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:46:14,477 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:46:14,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:46:14,478 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:46:14,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:46:14,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:46:14,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:46:14,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:46:14,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:46:14,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:46:14,479 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:46:14,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:46:14,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:46:14,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:46:14,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:46:14,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:46:14,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:46:14,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:46:14,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:46:14,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:46:14,481 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:46:14,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:46:14,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:46:14,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:46:14,482 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:46:14,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:46:14,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:46:14,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:46:14,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:46:14,770 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:46:14,770 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:46:14,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adf190b2/dd7ca48cbc1146df9ace8c4218c9c763/FLAG5722abc93 [2019-11-24 05:46:15,506 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:46:15,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:46:15,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adf190b2/dd7ca48cbc1146df9ace8c4218c9c763/FLAG5722abc93 [2019-11-24 05:46:15,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adf190b2/dd7ca48cbc1146df9ace8c4218c9c763 [2019-11-24 05:46:15,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:46:15,628 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:46:15,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:15,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:46:15,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:46:15,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:15" (1/1) ... [2019-11-24 05:46:15,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e00ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:15, skipping insertion in model container [2019-11-24 05:46:15,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:15" (1/1) ... [2019-11-24 05:46:15,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:46:15,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:46:16,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:16,839 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:46:17,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:17,156 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:46:17,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17 WrapperNode [2019-11-24 05:46:17,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:17,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:17,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:46:17,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:46:17,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:17,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:46:17,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:46:17,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:46:17,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (1/1) ... [2019-11-24 05:46:17,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:46:17,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:46:17,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:46:17,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:46:17,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (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-24 05:46:17,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:46:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:46:21,664 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:46:21,665 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:46:21,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:21 BoogieIcfgContainer [2019-11-24 05:46:21,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:46:21,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:46:21,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:46:21,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:46:21,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:46:15" (1/3) ... [2019-11-24 05:46:21,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c52322b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:21, skipping insertion in model container [2019-11-24 05:46:21,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:17" (2/3) ... [2019-11-24 05:46:21,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c52322b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:21, skipping insertion in model container [2019-11-24 05:46:21,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:21" (3/3) ... [2019-11-24 05:46:21,677 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-24 05:46:21,688 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:46:21,698 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:46:21,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:46:21,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:46:21,760 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:46:21,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:46:21,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:46:21,761 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:46:21,761 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:46:21,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:46:21,761 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:46:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states. [2019-11-24 05:46:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:46:21,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:21,831 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] [2019-11-24 05:46:21,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash 966667412, now seen corresponding path program 1 times [2019-11-24 05:46:21,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:21,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639770553] [2019-11-24 05:46:21,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:22,275 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-24 05:46:22,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639770553] [2019-11-24 05:46:22,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:22,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:22,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81806415] [2019-11-24 05:46:22,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:22,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:22,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:22,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:22,301 INFO L87 Difference]: Start difference. First operand 1176 states. Second operand 5 states. [2019-11-24 05:46:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:24,344 INFO L93 Difference]: Finished difference Result 2266 states and 3970 transitions. [2019-11-24 05:46:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:24,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-24 05:46:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:24,372 INFO L225 Difference]: With dead ends: 2266 [2019-11-24 05:46:24,373 INFO L226 Difference]: Without dead ends: 1422 [2019-11-24 05:46:24,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2019-11-24 05:46:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1416. [2019-11-24 05:46:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-11-24 05:46:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1858 transitions. [2019-11-24 05:46:24,524 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1858 transitions. Word has length 50 [2019-11-24 05:46:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:24,525 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 1858 transitions. [2019-11-24 05:46:24,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1858 transitions. [2019-11-24 05:46:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:46:24,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:24,529 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] [2019-11-24 05:46:24,530 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:24,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1129412729, now seen corresponding path program 1 times [2019-11-24 05:46:24,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:24,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3934994] [2019-11-24 05:46:24,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:24,713 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-24 05:46:24,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3934994] [2019-11-24 05:46:24,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:24,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:24,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745752524] [2019-11-24 05:46:24,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:24,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:24,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:24,719 INFO L87 Difference]: Start difference. First operand 1416 states and 1858 transitions. Second operand 5 states. [2019-11-24 05:46:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:26,064 INFO L93 Difference]: Finished difference Result 2834 states and 3747 transitions. [2019-11-24 05:46:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:26,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:46:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:26,075 INFO L225 Difference]: With dead ends: 2834 [2019-11-24 05:46:26,075 INFO L226 Difference]: Without dead ends: 1954 [2019-11-24 05:46:26,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-11-24 05:46:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1942. [2019-11-24 05:46:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-24 05:46:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2571 transitions. [2019-11-24 05:46:26,159 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2571 transitions. Word has length 51 [2019-11-24 05:46:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:26,160 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2571 transitions. [2019-11-24 05:46:26,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2571 transitions. [2019-11-24 05:46:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:46:26,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:26,164 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] [2019-11-24 05:46:26,164 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1240611768, now seen corresponding path program 1 times [2019-11-24 05:46:26,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:26,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697834495] [2019-11-24 05:46:26,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:26,243 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-24 05:46:26,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697834495] [2019-11-24 05:46:26,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:26,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:46:26,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372480881] [2019-11-24 05:46:26,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:46:26,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:26,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:46:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:46:26,248 INFO L87 Difference]: Start difference. First operand 1942 states and 2571 transitions. Second operand 5 states. [2019-11-24 05:46:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:27,667 INFO L93 Difference]: Finished difference Result 3917 states and 5227 transitions. [2019-11-24 05:46:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:46:27,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:46:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:27,686 INFO L225 Difference]: With dead ends: 3917 [2019-11-24 05:46:27,686 INFO L226 Difference]: Without dead ends: 2626 [2019-11-24 05:46:27,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2019-11-24 05:46:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2616. [2019-11-24 05:46:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2019-11-24 05:46:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3443 transitions. [2019-11-24 05:46:27,958 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3443 transitions. Word has length 51 [2019-11-24 05:46:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:27,959 INFO L462 AbstractCegarLoop]: Abstraction has 2616 states and 3443 transitions. [2019-11-24 05:46:27,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:46:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3443 transitions. [2019-11-24 05:46:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:46:27,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:27,964 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] [2019-11-24 05:46:27,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash -40243798, now seen corresponding path program 1 times [2019-11-24 05:46:27,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:27,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472746580] [2019-11-24 05:46:27,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:28,130 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-24 05:46:28,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472746580] [2019-11-24 05:46:28,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:28,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:46:28,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126713369] [2019-11-24 05:46:28,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:46:28,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:28,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:46:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:46:28,133 INFO L87 Difference]: Start difference. First operand 2616 states and 3443 transitions. Second operand 8 states. [2019-11-24 05:46:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:31,493 INFO L93 Difference]: Finished difference Result 4498 states and 6007 transitions. [2019-11-24 05:46:31,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:46:31,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-24 05:46:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:31,529 INFO L225 Difference]: With dead ends: 4498 [2019-11-24 05:46:31,530 INFO L226 Difference]: Without dead ends: 4125 [2019-11-24 05:46:31,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:46:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2019-11-24 05:46:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 2616. [2019-11-24 05:46:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2019-11-24 05:46:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3442 transitions. [2019-11-24 05:46:31,823 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3442 transitions. Word has length 52 [2019-11-24 05:46:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:31,823 INFO L462 AbstractCegarLoop]: Abstraction has 2616 states and 3442 transitions. [2019-11-24 05:46:31,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:46:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3442 transitions. [2019-11-24 05:46:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:46:31,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:31,829 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] [2019-11-24 05:46:31,830 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash -185533245, now seen corresponding path program 1 times [2019-11-24 05:46:31,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:31,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937331814] [2019-11-24 05:46:31,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:32,057 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-24 05:46:32,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937331814] [2019-11-24 05:46:32,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:32,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:46:32,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601068840] [2019-11-24 05:46:32,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:46:32,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:32,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:46:32,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:46:32,062 INFO L87 Difference]: Start difference. First operand 2616 states and 3442 transitions. Second operand 8 states. [2019-11-24 05:46:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:34,736 INFO L93 Difference]: Finished difference Result 3758 states and 4961 transitions. [2019-11-24 05:46:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:46:34,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-24 05:46:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:34,753 INFO L225 Difference]: With dead ends: 3758 [2019-11-24 05:46:34,754 INFO L226 Difference]: Without dead ends: 3753 [2019-11-24 05:46:34,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:46:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2019-11-24 05:46:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 2616. [2019-11-24 05:46:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2019-11-24 05:46:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3441 transitions. [2019-11-24 05:46:34,938 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3441 transitions. Word has length 52 [2019-11-24 05:46:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:34,941 INFO L462 AbstractCegarLoop]: Abstraction has 2616 states and 3441 transitions. [2019-11-24 05:46:34,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:46:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3441 transitions. [2019-11-24 05:46:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:46:34,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:34,947 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] [2019-11-24 05:46:34,947 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1651109861, now seen corresponding path program 1 times [2019-11-24 05:46:34,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:34,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745111765] [2019-11-24 05:46:34,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:35,125 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-24 05:46:35,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745111765] [2019-11-24 05:46:35,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:35,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:46:35,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508399803] [2019-11-24 05:46:35,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:46:35,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:46:35,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:46:35,128 INFO L87 Difference]: Start difference. First operand 2616 states and 3441 transitions. Second operand 7 states. [2019-11-24 05:46:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:37,380 INFO L93 Difference]: Finished difference Result 4098 states and 5496 transitions. [2019-11-24 05:46:37,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:46:37,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-24 05:46:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:37,396 INFO L225 Difference]: With dead ends: 4098 [2019-11-24 05:46:37,396 INFO L226 Difference]: Without dead ends: 3627 [2019-11-24 05:46:37,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:46:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2019-11-24 05:46:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 2616. [2019-11-24 05:46:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2019-11-24 05:46:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3440 transitions. [2019-11-24 05:46:37,542 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3440 transitions. Word has length 52 [2019-11-24 05:46:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:37,542 INFO L462 AbstractCegarLoop]: Abstraction has 2616 states and 3440 transitions. [2019-11-24 05:46:37,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:46:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3440 transitions. [2019-11-24 05:46:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:46:37,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:37,546 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] [2019-11-24 05:46:37,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1538413769, now seen corresponding path program 1 times [2019-11-24 05:46:37,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:37,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414502986] [2019-11-24 05:46:37,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:37,600 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-24 05:46:37,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414502986] [2019-11-24 05:46:37,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:37,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:37,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459272762] [2019-11-24 05:46:37,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:37,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:37,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:37,603 INFO L87 Difference]: Start difference. First operand 2616 states and 3440 transitions. Second operand 3 states. [2019-11-24 05:46:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:37,808 INFO L93 Difference]: Finished difference Result 3236 states and 4329 transitions. [2019-11-24 05:46:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:37,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 05:46:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:37,819 INFO L225 Difference]: With dead ends: 3236 [2019-11-24 05:46:37,819 INFO L226 Difference]: Without dead ends: 2551 [2019-11-24 05:46:37,821 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-24 05:46:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-11-24 05:46:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2549. [2019-11-24 05:46:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2019-11-24 05:46:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3348 transitions. [2019-11-24 05:46:37,978 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3348 transitions. Word has length 53 [2019-11-24 05:46:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:37,978 INFO L462 AbstractCegarLoop]: Abstraction has 2549 states and 3348 transitions. [2019-11-24 05:46:37,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3348 transitions. [2019-11-24 05:46:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:46:37,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:37,983 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] [2019-11-24 05:46:37,983 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash -651733059, now seen corresponding path program 1 times [2019-11-24 05:46:37,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:37,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303173751] [2019-11-24 05:46:37,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:38,056 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-24 05:46:38,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303173751] [2019-11-24 05:46:38,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:38,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:38,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623033523] [2019-11-24 05:46:38,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:38,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:38,059 INFO L87 Difference]: Start difference. First operand 2549 states and 3348 transitions. Second operand 3 states. [2019-11-24 05:46:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:38,263 INFO L93 Difference]: Finished difference Result 3582 states and 4842 transitions. [2019-11-24 05:46:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:38,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 05:46:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:38,274 INFO L225 Difference]: With dead ends: 3582 [2019-11-24 05:46:38,274 INFO L226 Difference]: Without dead ends: 2719 [2019-11-24 05:46:38,276 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-24 05:46:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2019-11-24 05:46:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2717. [2019-11-24 05:46:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2717 states. [2019-11-24 05:46:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3613 transitions. [2019-11-24 05:46:38,491 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3613 transitions. Word has length 53 [2019-11-24 05:46:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:38,492 INFO L462 AbstractCegarLoop]: Abstraction has 2717 states and 3613 transitions. [2019-11-24 05:46:38,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3613 transitions. [2019-11-24 05:46:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 05:46:38,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:38,495 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] [2019-11-24 05:46:38,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash 408369717, now seen corresponding path program 1 times [2019-11-24 05:46:38,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:38,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912531233] [2019-11-24 05:46:38,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:38,547 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-24 05:46:38,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912531233] [2019-11-24 05:46:38,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:38,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:38,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644944372] [2019-11-24 05:46:38,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:38,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:38,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:38,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:38,550 INFO L87 Difference]: Start difference. First operand 2717 states and 3613 transitions. Second operand 3 states. [2019-11-24 05:46:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:38,824 INFO L93 Difference]: Finished difference Result 5669 states and 7688 transitions. [2019-11-24 05:46:38,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:38,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 05:46:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:38,838 INFO L225 Difference]: With dead ends: 5669 [2019-11-24 05:46:38,838 INFO L226 Difference]: Without dead ends: 3932 [2019-11-24 05:46:38,842 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-24 05:46:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2019-11-24 05:46:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3926. [2019-11-24 05:46:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states. [2019-11-24 05:46:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5185 transitions. [2019-11-24 05:46:39,061 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5185 transitions. Word has length 53 [2019-11-24 05:46:39,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:39,061 INFO L462 AbstractCegarLoop]: Abstraction has 3926 states and 5185 transitions. [2019-11-24 05:46:39,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5185 transitions. [2019-11-24 05:46:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:46:39,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:39,065 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] [2019-11-24 05:46:39,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 888209781, now seen corresponding path program 1 times [2019-11-24 05:46:39,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:39,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927182345] [2019-11-24 05:46:39,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:39,101 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-24 05:46:39,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927182345] [2019-11-24 05:46:39,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:39,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:39,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98892085] [2019-11-24 05:46:39,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:39,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:39,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:39,104 INFO L87 Difference]: Start difference. First operand 3926 states and 5185 transitions. Second operand 3 states. [2019-11-24 05:46:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:39,606 INFO L93 Difference]: Finished difference Result 6850 states and 9152 transitions. [2019-11-24 05:46:39,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:39,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:46:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:39,617 INFO L225 Difference]: With dead ends: 6850 [2019-11-24 05:46:39,617 INFO L226 Difference]: Without dead ends: 3884 [2019-11-24 05:46:39,621 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-24 05:46:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2019-11-24 05:46:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3131. [2019-11-24 05:46:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2019-11-24 05:46:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4163 transitions. [2019-11-24 05:46:39,870 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4163 transitions. Word has length 54 [2019-11-24 05:46:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:39,870 INFO L462 AbstractCegarLoop]: Abstraction has 3131 states and 4163 transitions. [2019-11-24 05:46:39,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4163 transitions. [2019-11-24 05:46:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:46:39,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:39,873 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] [2019-11-24 05:46:39,874 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:39,874 INFO L82 PathProgramCache]: Analyzing trace with hash -290391896, now seen corresponding path program 1 times [2019-11-24 05:46:39,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:39,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978551792] [2019-11-24 05:46:39,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:39,906 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-24 05:46:39,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978551792] [2019-11-24 05:46:39,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:39,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:39,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645058705] [2019-11-24 05:46:39,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:39,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:39,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:39,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:39,908 INFO L87 Difference]: Start difference. First operand 3131 states and 4163 transitions. Second operand 3 states. [2019-11-24 05:46:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:40,241 INFO L93 Difference]: Finished difference Result 5633 states and 7602 transitions. [2019-11-24 05:46:40,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:40,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:46:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:40,247 INFO L225 Difference]: With dead ends: 5633 [2019-11-24 05:46:40,247 INFO L226 Difference]: Without dead ends: 3189 [2019-11-24 05:46:40,251 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-24 05:46:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-11-24 05:46:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2598. [2019-11-24 05:46:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2019-11-24 05:46:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3457 transitions. [2019-11-24 05:46:40,423 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3457 transitions. Word has length 54 [2019-11-24 05:46:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:40,423 INFO L462 AbstractCegarLoop]: Abstraction has 2598 states and 3457 transitions. [2019-11-24 05:46:40,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3457 transitions. [2019-11-24 05:46:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:46:40,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:40,426 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] [2019-11-24 05:46:40,426 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash -364061502, now seen corresponding path program 1 times [2019-11-24 05:46:40,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:40,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720874180] [2019-11-24 05:46:40,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:40,468 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-24 05:46:40,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720874180] [2019-11-24 05:46:40,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:40,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:40,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657746042] [2019-11-24 05:46:40,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:40,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:40,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:40,471 INFO L87 Difference]: Start difference. First operand 2598 states and 3457 transitions. Second operand 3 states. [2019-11-24 05:46:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:40,756 INFO L93 Difference]: Finished difference Result 4716 states and 6358 transitions. [2019-11-24 05:46:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:40,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:46:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:40,761 INFO L225 Difference]: With dead ends: 4716 [2019-11-24 05:46:40,761 INFO L226 Difference]: Without dead ends: 2425 [2019-11-24 05:46:40,765 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-24 05:46:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2019-11-24 05:46:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2191. [2019-11-24 05:46:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2019-11-24 05:46:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 2925 transitions. [2019-11-24 05:46:40,896 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 2925 transitions. Word has length 54 [2019-11-24 05:46:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:40,897 INFO L462 AbstractCegarLoop]: Abstraction has 2191 states and 2925 transitions. [2019-11-24 05:46:40,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2925 transitions. [2019-11-24 05:46:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:46:40,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:40,898 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] [2019-11-24 05:46:40,898 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:40,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1325150352, now seen corresponding path program 1 times [2019-11-24 05:46:40,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:40,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684074774] [2019-11-24 05:46:40,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:41,420 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-24 05:46:41,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684074774] [2019-11-24 05:46:41,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:41,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-24 05:46:41,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73874436] [2019-11-24 05:46:41,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-24 05:46:41,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-24 05:46:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:46:41,423 INFO L87 Difference]: Start difference. First operand 2191 states and 2925 transitions. Second operand 19 states. [2019-11-24 05:46:42,014 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-24 05:46:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:45,342 INFO L93 Difference]: Finished difference Result 4114 states and 5471 transitions. [2019-11-24 05:46:45,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-24 05:46:45,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-24 05:46:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:45,353 INFO L225 Difference]: With dead ends: 4114 [2019-11-24 05:46:45,353 INFO L226 Difference]: Without dead ends: 4110 [2019-11-24 05:46:45,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2019-11-24 05:46:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2019-11-24 05:46:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 2191. [2019-11-24 05:46:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2019-11-24 05:46:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 2924 transitions. [2019-11-24 05:46:45,609 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 2924 transitions. Word has length 55 [2019-11-24 05:46:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:45,609 INFO L462 AbstractCegarLoop]: Abstraction has 2191 states and 2924 transitions. [2019-11-24 05:46:45,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-24 05:46:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2924 transitions. [2019-11-24 05:46:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:46:45,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:45,611 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] [2019-11-24 05:46:45,611 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash -548611186, now seen corresponding path program 1 times [2019-11-24 05:46:45,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:45,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596300905] [2019-11-24 05:46:45,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:46,142 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-24 05:46:46,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596300905] [2019-11-24 05:46:46,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:46,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-24 05:46:46,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580512320] [2019-11-24 05:46:46,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-24 05:46:46,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-24 05:46:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:46:46,145 INFO L87 Difference]: Start difference. First operand 2191 states and 2924 transitions. Second operand 19 states. [2019-11-24 05:46:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:49,808 INFO L93 Difference]: Finished difference Result 4070 states and 5417 transitions. [2019-11-24 05:46:49,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-24 05:46:49,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-24 05:46:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:49,816 INFO L225 Difference]: With dead ends: 4070 [2019-11-24 05:46:49,816 INFO L226 Difference]: Without dead ends: 4066 [2019-11-24 05:46:49,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-11-24 05:46:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4066 states. [2019-11-24 05:46:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4066 to 2198. [2019-11-24 05:46:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-11-24 05:46:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 2933 transitions. [2019-11-24 05:46:50,092 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 2933 transitions. Word has length 55 [2019-11-24 05:46:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:50,092 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 2933 transitions. [2019-11-24 05:46:50,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-24 05:46:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2933 transitions. [2019-11-24 05:46:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:46:50,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:50,094 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] [2019-11-24 05:46:50,094 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:50,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:50,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1104256696, now seen corresponding path program 1 times [2019-11-24 05:46:50,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:50,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873787742] [2019-11-24 05:46:50,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:50,565 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-24 05:46:50,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873787742] [2019-11-24 05:46:50,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:50,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-24 05:46:50,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622940056] [2019-11-24 05:46:50,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-24 05:46:50,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:50,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-24 05:46:50,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:46:50,567 INFO L87 Difference]: Start difference. First operand 2198 states and 2933 transitions. Second operand 19 states. [2019-11-24 05:46:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:54,617 INFO L93 Difference]: Finished difference Result 3884 states and 5171 transitions. [2019-11-24 05:46:54,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-24 05:46:54,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-24 05:46:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:54,622 INFO L225 Difference]: With dead ends: 3884 [2019-11-24 05:46:54,622 INFO L226 Difference]: Without dead ends: 3878 [2019-11-24 05:46:54,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2019-11-24 05:46:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2019-11-24 05:46:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 2198. [2019-11-24 05:46:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-11-24 05:46:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 2932 transitions. [2019-11-24 05:46:54,860 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 2932 transitions. Word has length 55 [2019-11-24 05:46:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:54,860 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 2932 transitions. [2019-11-24 05:46:54,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-24 05:46:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2932 transitions. [2019-11-24 05:46:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 05:46:54,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:54,861 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] [2019-11-24 05:46:54,861 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1059586101, now seen corresponding path program 1 times [2019-11-24 05:46:54,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:54,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15185249] [2019-11-24 05:46:54,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:55,110 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-24 05:46:55,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15185249] [2019-11-24 05:46:55,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:55,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:46:55,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525308083] [2019-11-24 05:46:55,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:46:55,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:55,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:46:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:46:55,112 INFO L87 Difference]: Start difference. First operand 2198 states and 2932 transitions. Second operand 11 states. [2019-11-24 05:46:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:56,945 INFO L93 Difference]: Finished difference Result 4160 states and 5540 transitions. [2019-11-24 05:46:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-24 05:46:56,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-11-24 05:46:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:56,950 INFO L225 Difference]: With dead ends: 4160 [2019-11-24 05:46:56,950 INFO L226 Difference]: Without dead ends: 3903 [2019-11-24 05:46:56,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2019-11-24 05:46:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3903 states. [2019-11-24 05:46:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3903 to 2151. [2019-11-24 05:46:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2019-11-24 05:46:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 2876 transitions. [2019-11-24 05:46:57,214 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 2876 transitions. Word has length 55 [2019-11-24 05:46:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:57,214 INFO L462 AbstractCegarLoop]: Abstraction has 2151 states and 2876 transitions. [2019-11-24 05:46:57,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:46:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2876 transitions. [2019-11-24 05:46:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:46:57,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:57,216 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] [2019-11-24 05:46:57,216 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2003453, now seen corresponding path program 1 times [2019-11-24 05:46:57,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:57,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599936130] [2019-11-24 05:46:57,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:57,887 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-24 05:46:57,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599936130] [2019-11-24 05:46:57,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:57,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 05:46:57,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961601728] [2019-11-24 05:46:57,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-24 05:46:57,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-24 05:46:57,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:46:57,890 INFO L87 Difference]: Start difference. First operand 2151 states and 2876 transitions. Second operand 14 states. [2019-11-24 05:47:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:00,163 INFO L93 Difference]: Finished difference Result 3730 states and 4983 transitions. [2019-11-24 05:47:00,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-24 05:47:00,164 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-11-24 05:47:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:00,168 INFO L225 Difference]: With dead ends: 3730 [2019-11-24 05:47:00,168 INFO L226 Difference]: Without dead ends: 3603 [2019-11-24 05:47:00,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-11-24 05:47:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2019-11-24 05:47:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 2130. [2019-11-24 05:47:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-11-24 05:47:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2849 transitions. [2019-11-24 05:47:00,387 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2849 transitions. Word has length 56 [2019-11-24 05:47:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:00,387 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 2849 transitions. [2019-11-24 05:47:00,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-24 05:47:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2849 transitions. [2019-11-24 05:47:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-24 05:47:00,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:00,389 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] [2019-11-24 05:47:00,389 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:00,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1411910330, now seen corresponding path program 1 times [2019-11-24 05:47:00,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:00,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205606218] [2019-11-24 05:47:00,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:00,618 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-24 05:47:00,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205606218] [2019-11-24 05:47:00,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:00,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-24 05:47:00,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929700784] [2019-11-24 05:47:00,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-24 05:47:00,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:00,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-24 05:47:00,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:47:00,621 INFO L87 Difference]: Start difference. First operand 2130 states and 2849 transitions. Second operand 13 states. [2019-11-24 05:47:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:02,296 INFO L93 Difference]: Finished difference Result 6355 states and 8591 transitions. [2019-11-24 05:47:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-24 05:47:02,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-11-24 05:47:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:02,301 INFO L225 Difference]: With dead ends: 6355 [2019-11-24 05:47:02,301 INFO L226 Difference]: Without dead ends: 5146 [2019-11-24 05:47:02,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2019-11-24 05:47:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2019-11-24 05:47:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 2764. [2019-11-24 05:47:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2764 states. [2019-11-24 05:47:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3672 transitions. [2019-11-24 05:47:02,661 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3672 transitions. Word has length 58 [2019-11-24 05:47:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:02,661 INFO L462 AbstractCegarLoop]: Abstraction has 2764 states and 3672 transitions. [2019-11-24 05:47:02,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-24 05:47:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3672 transitions. [2019-11-24 05:47:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-24 05:47:02,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:02,663 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] [2019-11-24 05:47:02,663 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -824576521, now seen corresponding path program 1 times [2019-11-24 05:47:02,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:02,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285239989] [2019-11-24 05:47:02,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:02,719 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-24 05:47:02,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285239989] [2019-11-24 05:47:02,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:02,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:02,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000394613] [2019-11-24 05:47:02,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:02,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:02,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:02,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:02,722 INFO L87 Difference]: Start difference. First operand 2764 states and 3672 transitions. Second operand 3 states. [2019-11-24 05:47:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:03,330 INFO L93 Difference]: Finished difference Result 5908 states and 8026 transitions. [2019-11-24 05:47:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:03,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-24 05:47:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:03,334 INFO L225 Difference]: With dead ends: 5908 [2019-11-24 05:47:03,334 INFO L226 Difference]: Without dead ends: 4064 [2019-11-24 05:47:03,337 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-24 05:47:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2019-11-24 05:47:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 3642. [2019-11-24 05:47:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-11-24 05:47:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4831 transitions. [2019-11-24 05:47:03,805 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4831 transitions. Word has length 58 [2019-11-24 05:47:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:03,805 INFO L462 AbstractCegarLoop]: Abstraction has 3642 states and 4831 transitions. [2019-11-24 05:47:03,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4831 transitions. [2019-11-24 05:47:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 05:47:03,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:03,807 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] [2019-11-24 05:47:03,807 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:03,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:03,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1305528370, now seen corresponding path program 1 times [2019-11-24 05:47:03,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:03,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733726125] [2019-11-24 05:47:03,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:03,905 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-24 05:47:03,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733726125] [2019-11-24 05:47:03,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:03,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:03,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470622659] [2019-11-24 05:47:03,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:03,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:03,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:03,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:03,908 INFO L87 Difference]: Start difference. First operand 3642 states and 4831 transitions. Second operand 8 states. [2019-11-24 05:47:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:06,279 INFO L93 Difference]: Finished difference Result 6196 states and 8085 transitions. [2019-11-24 05:47:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-24 05:47:06,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-11-24 05:47:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:06,284 INFO L225 Difference]: With dead ends: 6196 [2019-11-24 05:47:06,284 INFO L226 Difference]: Without dead ends: 5554 [2019-11-24 05:47:06,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-11-24 05:47:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5554 states. [2019-11-24 05:47:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 3642. [2019-11-24 05:47:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-11-24 05:47:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4830 transitions. [2019-11-24 05:47:06,805 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4830 transitions. Word has length 63 [2019-11-24 05:47:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:06,805 INFO L462 AbstractCegarLoop]: Abstraction has 3642 states and 4830 transitions. [2019-11-24 05:47:06,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4830 transitions. [2019-11-24 05:47:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 05:47:06,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:06,807 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] [2019-11-24 05:47:06,808 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:06,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1274327997, now seen corresponding path program 1 times [2019-11-24 05:47:06,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:06,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452803348] [2019-11-24 05:47:06,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:06,857 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-24 05:47:06,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452803348] [2019-11-24 05:47:06,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:06,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:06,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801734207] [2019-11-24 05:47:06,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:06,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:06,860 INFO L87 Difference]: Start difference. First operand 3642 states and 4830 transitions. Second operand 3 states. [2019-11-24 05:47:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:07,865 INFO L93 Difference]: Finished difference Result 7699 states and 10447 transitions. [2019-11-24 05:47:07,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:07,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-24 05:47:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:07,870 INFO L225 Difference]: With dead ends: 7699 [2019-11-24 05:47:07,870 INFO L226 Difference]: Without dead ends: 5055 [2019-11-24 05:47:07,874 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-24 05:47:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5055 states. [2019-11-24 05:47:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5055 to 4631. [2019-11-24 05:47:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4631 states. [2019-11-24 05:47:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 6130 transitions. [2019-11-24 05:47:08,512 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 6130 transitions. Word has length 65 [2019-11-24 05:47:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:08,512 INFO L462 AbstractCegarLoop]: Abstraction has 4631 states and 6130 transitions. [2019-11-24 05:47:08,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 6130 transitions. [2019-11-24 05:47:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:47:08,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:08,514 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:08,515 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1875043093, now seen corresponding path program 1 times [2019-11-24 05:47:08,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:08,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684489933] [2019-11-24 05:47:08,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:47:08,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684489933] [2019-11-24 05:47:08,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:08,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:47:08,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49122240] [2019-11-24 05:47:08,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:08,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:08,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:08,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:08,639 INFO L87 Difference]: Start difference. First operand 4631 states and 6130 transitions. Second operand 5 states. [2019-11-24 05:47:09,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:09,429 INFO L93 Difference]: Finished difference Result 7571 states and 10107 transitions. [2019-11-24 05:47:09,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:09,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-24 05:47:09,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:09,433 INFO L225 Difference]: With dead ends: 7571 [2019-11-24 05:47:09,433 INFO L226 Difference]: Without dead ends: 3910 [2019-11-24 05:47:09,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2019-11-24 05:47:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3906. [2019-11-24 05:47:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3906 states. [2019-11-24 05:47:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 5044 transitions. [2019-11-24 05:47:09,991 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 5044 transitions. Word has length 69 [2019-11-24 05:47:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:09,991 INFO L462 AbstractCegarLoop]: Abstraction has 3906 states and 5044 transitions. [2019-11-24 05:47:09,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 5044 transitions. [2019-11-24 05:47:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 05:47:09,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:09,994 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] [2019-11-24 05:47:09,995 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1276242841, now seen corresponding path program 1 times [2019-11-24 05:47:09,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:09,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666107940] [2019-11-24 05:47:09,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:10,091 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-24 05:47:10,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666107940] [2019-11-24 05:47:10,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:10,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:10,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856272106] [2019-11-24 05:47:10,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:47:10,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:10,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:47:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:10,093 INFO L87 Difference]: Start difference. First operand 3906 states and 5044 transitions. Second operand 7 states. [2019-11-24 05:47:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:11,541 INFO L93 Difference]: Finished difference Result 5229 states and 6696 transitions. [2019-11-24 05:47:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:47:11,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-24 05:47:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:11,549 INFO L225 Difference]: With dead ends: 5229 [2019-11-24 05:47:11,549 INFO L226 Difference]: Without dead ends: 5227 [2019-11-24 05:47:11,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:47:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2019-11-24 05:47:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 4018. [2019-11-24 05:47:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4018 states. [2019-11-24 05:47:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 4018 states and 5192 transitions. [2019-11-24 05:47:12,591 INFO L78 Accepts]: Start accepts. Automaton has 4018 states and 5192 transitions. Word has length 70 [2019-11-24 05:47:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:12,592 INFO L462 AbstractCegarLoop]: Abstraction has 4018 states and 5192 transitions. [2019-11-24 05:47:12,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:47:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4018 states and 5192 transitions. [2019-11-24 05:47:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 05:47:12,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:12,595 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] [2019-11-24 05:47:12,595 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash -647324926, now seen corresponding path program 1 times [2019-11-24 05:47:12,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:12,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144465378] [2019-11-24 05:47:12,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:12,694 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-24 05:47:12,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144465378] [2019-11-24 05:47:12,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:12,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:12,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835037094] [2019-11-24 05:47:12,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:12,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:12,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:12,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:12,696 INFO L87 Difference]: Start difference. First operand 4018 states and 5192 transitions. Second operand 8 states. [2019-11-24 05:47:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:14,678 INFO L93 Difference]: Finished difference Result 5949 states and 7594 transitions. [2019-11-24 05:47:14,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 05:47:14,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-11-24 05:47:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:14,683 INFO L225 Difference]: With dead ends: 5949 [2019-11-24 05:47:14,684 INFO L226 Difference]: Without dead ends: 5443 [2019-11-24 05:47:14,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-11-24 05:47:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2019-11-24 05:47:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 4018. [2019-11-24 05:47:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4018 states. [2019-11-24 05:47:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 4018 states and 5190 transitions. [2019-11-24 05:47:15,352 INFO L78 Accepts]: Start accepts. Automaton has 4018 states and 5190 transitions. Word has length 72 [2019-11-24 05:47:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:15,352 INFO L462 AbstractCegarLoop]: Abstraction has 4018 states and 5190 transitions. [2019-11-24 05:47:15,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4018 states and 5190 transitions. [2019-11-24 05:47:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 05:47:15,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:15,354 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] [2019-11-24 05:47:15,354 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:15,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash -426871478, now seen corresponding path program 1 times [2019-11-24 05:47:15,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:15,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395103514] [2019-11-24 05:47:15,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:15,574 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-24 05:47:15,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395103514] [2019-11-24 05:47:15,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:15,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:47:15,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694649153] [2019-11-24 05:47:15,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:47:15,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:15,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:47:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:47:15,577 INFO L87 Difference]: Start difference. First operand 4018 states and 5190 transitions. Second operand 11 states. [2019-11-24 05:47:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:18,238 INFO L93 Difference]: Finished difference Result 9865 states and 12879 transitions. [2019-11-24 05:47:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-24 05:47:18,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-11-24 05:47:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:18,244 INFO L225 Difference]: With dead ends: 9865 [2019-11-24 05:47:18,244 INFO L226 Difference]: Without dead ends: 7053 [2019-11-24 05:47:18,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-11-24 05:47:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7053 states. [2019-11-24 05:47:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7053 to 5033. [2019-11-24 05:47:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5033 states. [2019-11-24 05:47:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5033 states to 5033 states and 6461 transitions. [2019-11-24 05:47:19,078 INFO L78 Accepts]: Start accepts. Automaton has 5033 states and 6461 transitions. Word has length 72 [2019-11-24 05:47:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:19,078 INFO L462 AbstractCegarLoop]: Abstraction has 5033 states and 6461 transitions. [2019-11-24 05:47:19,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:47:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5033 states and 6461 transitions. [2019-11-24 05:47:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 05:47:19,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:19,081 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:19,081 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1894775453, now seen corresponding path program 1 times [2019-11-24 05:47:19,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:19,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602548218] [2019-11-24 05:47:19,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:19,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602548218] [2019-11-24 05:47:19,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819968262] [2019-11-24 05:47:19,475 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-24 05:47:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:19,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-24 05:47:19,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:47:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:47:19,927 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:47:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:47:20,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:47:20,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [16] total 28 [2019-11-24 05:47:20,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752076635] [2019-11-24 05:47:20,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-24 05:47:20,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:20,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-24 05:47:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-11-24 05:47:20,136 INFO L87 Difference]: Start difference. First operand 5033 states and 6461 transitions. Second operand 14 states. [2019-11-24 05:47:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:23,810 INFO L93 Difference]: Finished difference Result 8447 states and 10808 transitions. [2019-11-24 05:47:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-24 05:47:23,811 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-11-24 05:47:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:23,830 INFO L225 Difference]: With dead ends: 8447 [2019-11-24 05:47:23,830 INFO L226 Difference]: Without dead ends: 7473 [2019-11-24 05:47:23,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2019-11-24 05:47:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7473 states. [2019-11-24 05:47:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7473 to 5018. [2019-11-24 05:47:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5018 states. [2019-11-24 05:47:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 6445 transitions. [2019-11-24 05:47:24,872 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 6445 transitions. Word has length 72 [2019-11-24 05:47:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:24,873 INFO L462 AbstractCegarLoop]: Abstraction has 5018 states and 6445 transitions. [2019-11-24 05:47:24,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-24 05:47:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 6445 transitions. [2019-11-24 05:47:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 05:47:24,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:24,875 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:25,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:47:25,078 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash -697833269, now seen corresponding path program 1 times [2019-11-24 05:47:25,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:25,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284620258] [2019-11-24 05:47:25,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:25,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284620258] [2019-11-24 05:47:25,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066386258] [2019-11-24 05:47:25,480 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-24 05:47:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:25,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-24 05:47:25,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:47:26,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:47:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:47:26,348 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:47:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:47:26,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:47:26,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [16] total 33 [2019-11-24 05:47:26,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647797647] [2019-11-24 05:47:26,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-24 05:47:26,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:26,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-24 05:47:26,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2019-11-24 05:47:26,654 INFO L87 Difference]: Start difference. First operand 5018 states and 6445 transitions. Second operand 19 states. [2019-11-24 05:47:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:30,876 INFO L93 Difference]: Finished difference Result 11328 states and 14692 transitions. [2019-11-24 05:47:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-24 05:47:30,876 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2019-11-24 05:47:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:30,885 INFO L225 Difference]: With dead ends: 11328 [2019-11-24 05:47:30,885 INFO L226 Difference]: Without dead ends: 9302 [2019-11-24 05:47:30,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=341, Invalid=1915, Unknown=0, NotChecked=0, Total=2256 [2019-11-24 05:47:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9302 states. [2019-11-24 05:47:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9302 to 5243. [2019-11-24 05:47:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-11-24 05:47:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6720 transitions. [2019-11-24 05:47:32,049 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6720 transitions. Word has length 73 [2019-11-24 05:47:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:32,050 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 6720 transitions. [2019-11-24 05:47:32,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-24 05:47:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6720 transitions. [2019-11-24 05:47:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 05:47:32,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:32,052 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:32,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:47:32,255 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:32,256 INFO L82 PathProgramCache]: Analyzing trace with hash -963681012, now seen corresponding path program 1 times [2019-11-24 05:47:32,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:32,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434896994] [2019-11-24 05:47:32,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 05:47:32,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434896994] [2019-11-24 05:47:32,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:32,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:32,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747018144] [2019-11-24 05:47:32,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:32,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:32,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:32,376 INFO L87 Difference]: Start difference. First operand 5243 states and 6720 transitions. Second operand 8 states.