/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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:46:53,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:46:53,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:46:53,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:46:53,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:46:53,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:46:53,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:46:53,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:46:53,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:46:53,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:46:53,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:46:53,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:46:53,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:46:53,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:46:53,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:46:53,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:46:53,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:46:53,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:46:53,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:46:53,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:46:53,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:46:53,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:46:53,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:46:53,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:46:53,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:46:53,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:46:53,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:46:53,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:46:53,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:46:53,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:46:53,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:46:53,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:46:53,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:46:53,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:46:53,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:46:53,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:46:53,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:46:53,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:46:53,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:46:53,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:46:53,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:46:53,466 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:53,486 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:46:53,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:46:53,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:46:53,488 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:46:53,488 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:46:53,488 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:46:53,488 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:46:53,488 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:46:53,489 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:46:53,489 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:46:53,490 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:46:53,490 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:46:53,490 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:46:53,491 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:46:53,491 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:46:53,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:46:53,492 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:46:53,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:46:53,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:46:53,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:46:53,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:46:53,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:46:53,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:46:53,493 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:46:53,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:46:53,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:46:53,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:46:53,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:46:53,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:46:53,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:46:53,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:46:53,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:46:53,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:46:53,496 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:46:53,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:46:53,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:46:53,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:46:53,497 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:46:53,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:46:53,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:46:53,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:46:53,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:46:53,797 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:46:53,798 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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-24 05:46:53,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec65a141/c39cb2ae28614e569c1aa2a2c71b5b6d/FLAGfabf951a4 [2019-11-24 05:46:54,489 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:46:54,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-24 05:46:54,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec65a141/c39cb2ae28614e569c1aa2a2c71b5b6d/FLAGfabf951a4 [2019-11-24 05:46:54,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec65a141/c39cb2ae28614e569c1aa2a2c71b5b6d [2019-11-24 05:46:54,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:46:54,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:46:54,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:54,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:46:54,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:46:54,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:54" (1/1) ... [2019-11-24 05:46:54,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c14900b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:54, skipping insertion in model container [2019-11-24 05:46:54,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:54" (1/1) ... [2019-11-24 05:46:54,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:46:54,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:46:55,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:55,527 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:46:55,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:55,953 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:46:55,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:55 WrapperNode [2019-11-24 05:46:55,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:55,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:55,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:46:55,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:46:55,964 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:55" (1/1) ... [2019-11-24 05:46:56,000 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:55" (1/1) ... [2019-11-24 05:46:56,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:56,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:46:56,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:46:56,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:46:56,105 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:55" (1/1) ... [2019-11-24 05:46:56,105 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:55" (1/1) ... [2019-11-24 05:46:56,111 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:55" (1/1) ... [2019-11-24 05:46:56,112 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:55" (1/1) ... [2019-11-24 05:46:56,150 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:55" (1/1) ... [2019-11-24 05:46:56,177 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:55" (1/1) ... [2019-11-24 05:46:56,187 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:55" (1/1) ... [2019-11-24 05:46:56,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:46:56,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:46:56,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:46:56,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:46:56,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:55" (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:56,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:46:56,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:46:58,494 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:46:58,495 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:46:58,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:58 BoogieIcfgContainer [2019-11-24 05:46:58,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:46:58,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:46:58,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:46:58,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:46:58,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:46:54" (1/3) ... [2019-11-24 05:46:58,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d8b08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:58, skipping insertion in model container [2019-11-24 05:46:58,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:55" (2/3) ... [2019-11-24 05:46:58,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d8b08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:58, skipping insertion in model container [2019-11-24 05:46:58,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:58" (3/3) ... [2019-11-24 05:46:58,504 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-24 05:46:58,514 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:46:58,522 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-24 05:46:58,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-24 05:46:58,563 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:46:58,564 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:46:58,564 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:46:58,564 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:46:58,564 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:46:58,564 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:46:58,564 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:46:58,565 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:46:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states. [2019-11-24 05:46:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 05:46:58,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:58,605 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] [2019-11-24 05:46:58,606 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash 296688961, now seen corresponding path program 1 times [2019-11-24 05:46:58,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:58,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471917813] [2019-11-24 05:46:58,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:58,961 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:58,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471917813] [2019-11-24 05:46:58,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:58,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:58,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934275168] [2019-11-24 05:46:58,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:58,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:58,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:58,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:58,989 INFO L87 Difference]: Start difference. First operand 411 states. Second operand 3 states. [2019-11-24 05:46:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:59,133 INFO L93 Difference]: Finished difference Result 603 states and 1066 transitions. [2019-11-24 05:46:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:59,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-24 05:46:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:59,159 INFO L225 Difference]: With dead ends: 603 [2019-11-24 05:46:59,159 INFO L226 Difference]: Without dead ends: 490 [2019-11-24 05:46:59,165 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:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-24 05:46:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 484. [2019-11-24 05:46:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-24 05:46:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 624 transitions. [2019-11-24 05:46:59,276 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 624 transitions. Word has length 48 [2019-11-24 05:46:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:59,277 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 624 transitions. [2019-11-24 05:46:59,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 624 transitions. [2019-11-24 05:46:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 05:46:59,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:59,285 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] [2019-11-24 05:46:59,286 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash 152491643, now seen corresponding path program 1 times [2019-11-24 05:46:59,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:59,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842958735] [2019-11-24 05:46:59,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:59,414 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:59,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842958735] [2019-11-24 05:46:59,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:59,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:59,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582283689] [2019-11-24 05:46:59,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:59,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:59,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:59,418 INFO L87 Difference]: Start difference. First operand 484 states and 624 transitions. Second operand 3 states. [2019-11-24 05:46:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:59,487 INFO L93 Difference]: Finished difference Result 799 states and 1064 transitions. [2019-11-24 05:46:59,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:59,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-24 05:46:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:59,493 INFO L225 Difference]: With dead ends: 799 [2019-11-24 05:46:59,493 INFO L226 Difference]: Without dead ends: 612 [2019-11-24 05:46:59,496 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:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-11-24 05:46:59,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 606. [2019-11-24 05:46:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-11-24 05:46:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 793 transitions. [2019-11-24 05:46:59,525 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 793 transitions. Word has length 48 [2019-11-24 05:46:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:59,526 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 793 transitions. [2019-11-24 05:46:59,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 793 transitions. [2019-11-24 05:46:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 05:46:59,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:59,561 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] [2019-11-24 05:46:59,561 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:59,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash -283473766, now seen corresponding path program 1 times [2019-11-24 05:46:59,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:59,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288808219] [2019-11-24 05:46:59,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:59,625 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:59,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288808219] [2019-11-24 05:46:59,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:59,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:59,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771756411] [2019-11-24 05:46:59,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:59,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:59,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:59,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:59,628 INFO L87 Difference]: Start difference. First operand 606 states and 793 transitions. Second operand 3 states. [2019-11-24 05:46:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:59,720 INFO L93 Difference]: Finished difference Result 1070 states and 1428 transitions. [2019-11-24 05:46:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:59,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-24 05:46:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:59,731 INFO L225 Difference]: With dead ends: 1070 [2019-11-24 05:46:59,731 INFO L226 Difference]: Without dead ends: 841 [2019-11-24 05:46:59,735 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:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-11-24 05:46:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 834. [2019-11-24 05:46:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-11-24 05:46:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1099 transitions. [2019-11-24 05:46:59,768 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1099 transitions. Word has length 48 [2019-11-24 05:46:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:59,769 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1099 transitions. [2019-11-24 05:46:59,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1099 transitions. [2019-11-24 05:46:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 05:46:59,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:59,771 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] [2019-11-24 05:46:59,771 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash -427757648, now seen corresponding path program 1 times [2019-11-24 05:46:59,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:59,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595050783] [2019-11-24 05:46:59,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:59,919 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:59,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595050783] [2019-11-24 05:46:59,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:59,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:46:59,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617624393] [2019-11-24 05:46:59,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:46:59,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:46:59,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:46:59,922 INFO L87 Difference]: Start difference. First operand 834 states and 1099 transitions. Second operand 11 states. [2019-11-24 05:47:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:02,357 INFO L93 Difference]: Finished difference Result 2522 states and 3410 transitions. [2019-11-24 05:47:02,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-24 05:47:02,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-11-24 05:47:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:02,371 INFO L225 Difference]: With dead ends: 2522 [2019-11-24 05:47:02,371 INFO L226 Difference]: Without dead ends: 2383 [2019-11-24 05:47:02,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-11-24 05:47:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-11-24 05:47:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 845. [2019-11-24 05:47:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-11-24 05:47:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1113 transitions. [2019-11-24 05:47:02,451 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1113 transitions. Word has length 48 [2019-11-24 05:47:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:02,452 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1113 transitions. [2019-11-24 05:47:02,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:47:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1113 transitions. [2019-11-24 05:47:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:47:02,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:02,454 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] [2019-11-24 05:47:02,454 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:02,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:02,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2032962725, now seen corresponding path program 1 times [2019-11-24 05:47:02,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:02,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428743282] [2019-11-24 05:47:02,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:02,619 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,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428743282] [2019-11-24 05:47:02,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:02,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:47:02,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746535845] [2019-11-24 05:47:02,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:47:02,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:02,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:47:02,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:47:02,622 INFO L87 Difference]: Start difference. First operand 845 states and 1113 transitions. Second operand 11 states. [2019-11-24 05:47:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:05,394 INFO L93 Difference]: Finished difference Result 2525 states and 3444 transitions. [2019-11-24 05:47:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-24 05:47:05,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-11-24 05:47:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:05,406 INFO L225 Difference]: With dead ends: 2525 [2019-11-24 05:47:05,407 INFO L226 Difference]: Without dead ends: 2403 [2019-11-24 05:47:05,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2019-11-24 05:47:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-11-24 05:47:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 861. [2019-11-24 05:47:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-11-24 05:47:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1136 transitions. [2019-11-24 05:47:05,524 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1136 transitions. Word has length 49 [2019-11-24 05:47:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:05,524 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1136 transitions. [2019-11-24 05:47:05,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:47:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1136 transitions. [2019-11-24 05:47:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:47:05,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:05,527 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] [2019-11-24 05:47:05,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash 46462349, now seen corresponding path program 1 times [2019-11-24 05:47:05,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:05,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449493937] [2019-11-24 05:47:05,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:05,802 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:05,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449493937] [2019-11-24 05:47:05,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:05,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:47:05,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562159394] [2019-11-24 05:47:05,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:47:05,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:47:05,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:47:05,805 INFO L87 Difference]: Start difference. First operand 861 states and 1136 transitions. Second operand 12 states. [2019-11-24 05:47:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:11,462 INFO L93 Difference]: Finished difference Result 4332 states and 5928 transitions. [2019-11-24 05:47:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-24 05:47:11,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-11-24 05:47:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:11,516 INFO L225 Difference]: With dead ends: 4332 [2019-11-24 05:47:11,516 INFO L226 Difference]: Without dead ends: 4141 [2019-11-24 05:47:11,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=537, Invalid=1443, Unknown=0, NotChecked=0, Total=1980 [2019-11-24 05:47:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2019-11-24 05:47:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 882. [2019-11-24 05:47:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-11-24 05:47:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1163 transitions. [2019-11-24 05:47:11,641 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1163 transitions. Word has length 49 [2019-11-24 05:47:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:11,641 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1163 transitions. [2019-11-24 05:47:11,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:47:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1163 transitions. [2019-11-24 05:47:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:47:11,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:11,644 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] [2019-11-24 05:47:11,644 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:11,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1596997316, now seen corresponding path program 1 times [2019-11-24 05:47:11,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:11,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219791292] [2019-11-24 05:47:11,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:11,816 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:11,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219791292] [2019-11-24 05:47:11,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:11,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:47:11,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411529034] [2019-11-24 05:47:11,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:47:11,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:47:11,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:47:11,818 INFO L87 Difference]: Start difference. First operand 882 states and 1163 transitions. Second operand 11 states. [2019-11-24 05:47:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:18,321 INFO L93 Difference]: Finished difference Result 11350 states and 15978 transitions. [2019-11-24 05:47:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-24 05:47:18,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-11-24 05:47:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:18,365 INFO L225 Difference]: With dead ends: 11350 [2019-11-24 05:47:18,365 INFO L226 Difference]: Without dead ends: 10809 [2019-11-24 05:47:18,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=983, Invalid=3307, Unknown=0, NotChecked=0, Total=4290 [2019-11-24 05:47:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10809 states. [2019-11-24 05:47:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10809 to 3205. [2019-11-24 05:47:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2019-11-24 05:47:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 4411 transitions. [2019-11-24 05:47:19,047 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 4411 transitions. Word has length 49 [2019-11-24 05:47:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:19,047 INFO L462 AbstractCegarLoop]: Abstraction has 3205 states and 4411 transitions. [2019-11-24 05:47:19,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:47:19,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 4411 transitions. [2019-11-24 05:47:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:47:19,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:19,052 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] [2019-11-24 05:47:19,052 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:19,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:19,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1695508102, now seen corresponding path program 1 times [2019-11-24 05:47:19,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:19,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673769605] [2019-11-24 05:47:19,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:19,155 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:19,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673769605] [2019-11-24 05:47:19,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:19,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 05:47:19,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750697147] [2019-11-24 05:47:19,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 05:47:19,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:19,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 05:47:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:47:19,158 INFO L87 Difference]: Start difference. First operand 3205 states and 4411 transitions. Second operand 9 states. [2019-11-24 05:47:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:20,839 INFO L93 Difference]: Finished difference Result 4196 states and 5767 transitions. [2019-11-24 05:47:20,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:47:20,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-24 05:47:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:20,856 INFO L225 Difference]: With dead ends: 4196 [2019-11-24 05:47:20,856 INFO L226 Difference]: Without dead ends: 4057 [2019-11-24 05:47:20,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:47:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2019-11-24 05:47:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 3205. [2019-11-24 05:47:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2019-11-24 05:47:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 4411 transitions. [2019-11-24 05:47:21,336 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 4411 transitions. Word has length 49 [2019-11-24 05:47:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:21,336 INFO L462 AbstractCegarLoop]: Abstraction has 3205 states and 4411 transitions. [2019-11-24 05:47:21,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 05:47:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 4411 transitions. [2019-11-24 05:47:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:47:21,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:21,341 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] [2019-11-24 05:47:21,341 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1738555640, now seen corresponding path program 1 times [2019-11-24 05:47:21,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:21,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055542730] [2019-11-24 05:47:21,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:21,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:47:21,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055542730] [2019-11-24 05:47:21,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:21,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 05:47:21,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330806711] [2019-11-24 05:47:21,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 05:47:21,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:21,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 05:47:21,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:47:21,423 INFO L87 Difference]: Start difference. First operand 3205 states and 4411 transitions. Second operand 9 states. [2019-11-24 05:47:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:23,933 INFO L93 Difference]: Finished difference Result 6434 states and 8888 transitions. [2019-11-24 05:47:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-24 05:47:23,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-24 05:47:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:23,955 INFO L225 Difference]: With dead ends: 6434 [2019-11-24 05:47:23,956 INFO L226 Difference]: Without dead ends: 6287 [2019-11-24 05:47:23,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2019-11-24 05:47:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6287 states. [2019-11-24 05:47:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6287 to 3216. [2019-11-24 05:47:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3216 states. [2019-11-24 05:47:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 4425 transitions. [2019-11-24 05:47:24,478 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 4425 transitions. Word has length 49 [2019-11-24 05:47:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:24,478 INFO L462 AbstractCegarLoop]: Abstraction has 3216 states and 4425 transitions. [2019-11-24 05:47:24,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 05:47:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 4425 transitions. [2019-11-24 05:47:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:24,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:24,482 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:47:24,482 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1888638097, now seen corresponding path program 1 times [2019-11-24 05:47:24,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:24,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368826649] [2019-11-24 05:47:24,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:24,573 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:24,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368826649] [2019-11-24 05:47:24,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:24,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 05:47:24,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622185779] [2019-11-24 05:47:24,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:47:24,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:24,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:47:24,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:47:24,575 INFO L87 Difference]: Start difference. First operand 3216 states and 4425 transitions. Second operand 10 states. [2019-11-24 05:47:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:28,964 INFO L93 Difference]: Finished difference Result 11588 states and 16140 transitions. [2019-11-24 05:47:28,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-24 05:47:28,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-24 05:47:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:28,986 INFO L225 Difference]: With dead ends: 11588 [2019-11-24 05:47:28,987 INFO L226 Difference]: Without dead ends: 10861 [2019-11-24 05:47:28,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-11-24 05:47:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-11-24 05:47:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 3216. [2019-11-24 05:47:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3216 states. [2019-11-24 05:47:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 4425 transitions. [2019-11-24 05:47:29,563 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 4425 transitions. Word has length 50 [2019-11-24 05:47:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:29,563 INFO L462 AbstractCegarLoop]: Abstraction has 3216 states and 4425 transitions. [2019-11-24 05:47:29,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:47:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 4425 transitions. [2019-11-24 05:47:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:29,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:29,568 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:47:29,568 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:29,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:29,569 INFO L82 PathProgramCache]: Analyzing trace with hash 711542153, now seen corresponding path program 1 times [2019-11-24 05:47:29,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:29,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725089842] [2019-11-24 05:47:29,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:29,653 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:29,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725089842] [2019-11-24 05:47:29,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:29,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:29,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783455352] [2019-11-24 05:47:29,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:29,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:29,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:29,656 INFO L87 Difference]: Start difference. First operand 3216 states and 4425 transitions. Second operand 8 states. [2019-11-24 05:47:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:32,204 INFO L93 Difference]: Finished difference Result 8076 states and 11303 transitions. [2019-11-24 05:47:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:47:32,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-24 05:47:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:32,214 INFO L225 Difference]: With dead ends: 8076 [2019-11-24 05:47:32,215 INFO L226 Difference]: Without dead ends: 5896 [2019-11-24 05:47:32,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:47:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2019-11-24 05:47:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 2097. [2019-11-24 05:47:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-11-24 05:47:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2865 transitions. [2019-11-24 05:47:32,780 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2865 transitions. Word has length 50 [2019-11-24 05:47:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:32,781 INFO L462 AbstractCegarLoop]: Abstraction has 2097 states and 2865 transitions. [2019-11-24 05:47:32,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2865 transitions. [2019-11-24 05:47:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:32,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:32,783 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:47:32,784 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1699896368, now seen corresponding path program 1 times [2019-11-24 05:47:32,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:32,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864744500] [2019-11-24 05:47:32,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:32,874 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:32,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864744500] [2019-11-24 05:47:32,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:32,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 05:47:32,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643951079] [2019-11-24 05:47:32,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 05:47:32,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 05:47:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:47:32,876 INFO L87 Difference]: Start difference. First operand 2097 states and 2865 transitions. Second operand 9 states. [2019-11-24 05:47:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:36,344 INFO L93 Difference]: Finished difference Result 7081 states and 9718 transitions. [2019-11-24 05:47:36,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-24 05:47:36,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-11-24 05:47:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:36,357 INFO L225 Difference]: With dead ends: 7081 [2019-11-24 05:47:36,358 INFO L226 Difference]: Without dead ends: 6478 [2019-11-24 05:47:36,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-11-24 05:47:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6478 states. [2019-11-24 05:47:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6478 to 2111. [2019-11-24 05:47:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-11-24 05:47:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 2883 transitions. [2019-11-24 05:47:36,899 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 2883 transitions. Word has length 50 [2019-11-24 05:47:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:36,900 INFO L462 AbstractCegarLoop]: Abstraction has 2111 states and 2883 transitions. [2019-11-24 05:47:36,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 05:47:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2883 transitions. [2019-11-24 05:47:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:36,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:36,902 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:47:36,902 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:36,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash -149361401, now seen corresponding path program 1 times [2019-11-24 05:47:36,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:36,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021636407] [2019-11-24 05:47:36,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:36,981 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:36,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021636407] [2019-11-24 05:47:36,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:36,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:36,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587576270] [2019-11-24 05:47:36,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:36,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:36,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:36,987 INFO L87 Difference]: Start difference. First operand 2111 states and 2883 transitions. Second operand 8 states. [2019-11-24 05:47:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:40,615 INFO L93 Difference]: Finished difference Result 9595 states and 13409 transitions. [2019-11-24 05:47:40,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:47:40,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-24 05:47:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:40,627 INFO L225 Difference]: With dead ends: 9595 [2019-11-24 05:47:40,627 INFO L226 Difference]: Without dead ends: 8004 [2019-11-24 05:47:40,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:47:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8004 states. [2019-11-24 05:47:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8004 to 4539. [2019-11-24 05:47:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4539 states. [2019-11-24 05:47:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 6265 transitions. [2019-11-24 05:47:42,137 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 6265 transitions. Word has length 50 [2019-11-24 05:47:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:42,138 INFO L462 AbstractCegarLoop]: Abstraction has 4539 states and 6265 transitions. [2019-11-24 05:47:42,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 6265 transitions. [2019-11-24 05:47:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:42,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:42,141 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:47:42,141 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash -683624236, now seen corresponding path program 1 times [2019-11-24 05:47:42,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:42,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434576634] [2019-11-24 05:47:42,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:42,230 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:42,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434576634] [2019-11-24 05:47:42,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:42,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:42,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293666441] [2019-11-24 05:47:42,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:42,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:42,232 INFO L87 Difference]: Start difference. First operand 4539 states and 6265 transitions. Second operand 8 states. [2019-11-24 05:47:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:45,859 INFO L93 Difference]: Finished difference Result 9796 states and 13655 transitions. [2019-11-24 05:47:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:47:45,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-24 05:47:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:45,869 INFO L225 Difference]: With dead ends: 9796 [2019-11-24 05:47:45,870 INFO L226 Difference]: Without dead ends: 8218 [2019-11-24 05:47:45,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:47:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2019-11-24 05:47:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 4561. [2019-11-24 05:47:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4561 states. [2019-11-24 05:47:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 6296 transitions. [2019-11-24 05:47:47,212 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 6296 transitions. Word has length 50 [2019-11-24 05:47:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:47,213 INFO L462 AbstractCegarLoop]: Abstraction has 4561 states and 6296 transitions. [2019-11-24 05:47:47,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 6296 transitions. [2019-11-24 05:47:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:47,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:47,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] [2019-11-24 05:47:47,216 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash 503025738, now seen corresponding path program 1 times [2019-11-24 05:47:47,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:47,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985476468] [2019-11-24 05:47:47,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:47,311 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:47,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985476468] [2019-11-24 05:47:47,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:47,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 05:47:47,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17457419] [2019-11-24 05:47:47,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:47:47,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:47,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:47:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:47:47,313 INFO L87 Difference]: Start difference. First operand 4561 states and 6296 transitions. Second operand 10 states. [2019-11-24 05:47:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:53,498 INFO L93 Difference]: Finished difference Result 13743 states and 18960 transitions. [2019-11-24 05:47:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 05:47:53,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-24 05:47:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:53,508 INFO L225 Difference]: With dead ends: 13743 [2019-11-24 05:47:53,508 INFO L226 Difference]: Without dead ends: 12032 [2019-11-24 05:47:53,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-11-24 05:47:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2019-11-24 05:47:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 4582. [2019-11-24 05:47:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4582 states. [2019-11-24 05:47:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 6323 transitions. [2019-11-24 05:47:54,779 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 6323 transitions. Word has length 50 [2019-11-24 05:47:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:54,779 INFO L462 AbstractCegarLoop]: Abstraction has 4582 states and 6323 transitions. [2019-11-24 05:47:54,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:47:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 6323 transitions. [2019-11-24 05:47:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:47:54,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:54,782 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:47:54,782 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2053560705, now seen corresponding path program 1 times [2019-11-24 05:47:54,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:54,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279875725] [2019-11-24 05:47:54,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:54,854 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:54,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279875725] [2019-11-24 05:47:54,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:54,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:54,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737392520] [2019-11-24 05:47:54,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:54,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:54,857 INFO L87 Difference]: Start difference. First operand 4582 states and 6323 transitions. Second operand 8 states. [2019-11-24 05:48:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:01,514 INFO L93 Difference]: Finished difference Result 18733 states and 26382 transitions. [2019-11-24 05:48:01,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:48:01,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-24 05:48:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:01,529 INFO L225 Difference]: With dead ends: 18733 [2019-11-24 05:48:01,530 INFO L226 Difference]: Without dead ends: 15444 [2019-11-24 05:48:01,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:48:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15444 states. [2019-11-24 05:48:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15444 to 9928. [2019-11-24 05:48:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9928 states. [2019-11-24 05:48:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9928 states to 9928 states and 13873 transitions. [2019-11-24 05:48:04,724 INFO L78 Accepts]: Start accepts. Automaton has 9928 states and 13873 transitions. Word has length 50 [2019-11-24 05:48:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:04,725 INFO L462 AbstractCegarLoop]: Abstraction has 9928 states and 13873 transitions. [2019-11-24 05:48:04,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:48:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9928 states and 13873 transitions. [2019-11-24 05:48:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:48:04,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:04,728 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:48:04,728 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash -949513779, now seen corresponding path program 1 times [2019-11-24 05:48:04,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:04,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357577366] [2019-11-24 05:48:04,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:04,785 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:48:04,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357577366] [2019-11-24 05:48:04,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:04,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:48:04,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17022926] [2019-11-24 05:48:04,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:48:04,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:04,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:48:04,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:04,788 INFO L87 Difference]: Start difference. First operand 9928 states and 13873 transitions. Second operand 7 states. [2019-11-24 05:48:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:16,019 INFO L93 Difference]: Finished difference Result 29505 states and 41344 transitions. [2019-11-24 05:48:16,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:48:16,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-24 05:48:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:16,049 INFO L225 Difference]: With dead ends: 29505 [2019-11-24 05:48:16,049 INFO L226 Difference]: Without dead ends: 28882 [2019-11-24 05:48:16,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:48:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28882 states. [2019-11-24 05:48:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28882 to 9929. [2019-11-24 05:48:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9929 states. [2019-11-24 05:48:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9929 states to 9929 states and 13875 transitions. [2019-11-24 05:48:19,965 INFO L78 Accepts]: Start accepts. Automaton has 9929 states and 13875 transitions. Word has length 50 [2019-11-24 05:48:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:19,965 INFO L462 AbstractCegarLoop]: Abstraction has 9929 states and 13875 transitions. [2019-11-24 05:48:19,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:48:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 9929 states and 13875 transitions. [2019-11-24 05:48:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:48:20,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:20,003 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:48:20,003 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1801309825, now seen corresponding path program 1 times [2019-11-24 05:48:20,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:20,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754399476] [2019-11-24 05:48:20,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:20,071 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:48:20,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754399476] [2019-11-24 05:48:20,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:20,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:20,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95084914] [2019-11-24 05:48:20,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:20,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:20,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:20,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:20,073 INFO L87 Difference]: Start difference. First operand 9929 states and 13875 transitions. Second operand 5 states. [2019-11-24 05:48:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:21,996 INFO L93 Difference]: Finished difference Result 13644 states and 19127 transitions. [2019-11-24 05:48:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:21,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-24 05:48:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:22,002 INFO L225 Difference]: With dead ends: 13644 [2019-11-24 05:48:22,002 INFO L226 Difference]: Without dead ends: 5815 [2019-11-24 05:48:22,009 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:48:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5815 states. [2019-11-24 05:48:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5815 to 3214. [2019-11-24 05:48:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2019-11-24 05:48:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4397 transitions. [2019-11-24 05:48:22,954 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4397 transitions. Word has length 51 [2019-11-24 05:48:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:22,955 INFO L462 AbstractCegarLoop]: Abstraction has 3214 states and 4397 transitions. [2019-11-24 05:48:22,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4397 transitions. [2019-11-24 05:48:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:48:22,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:22,956 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:48:22,957 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:22,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:22,957 INFO L82 PathProgramCache]: Analyzing trace with hash 780000725, now seen corresponding path program 1 times [2019-11-24 05:48:22,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:22,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845923437] [2019-11-24 05:48:22,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:23,092 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:48:23,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845923437] [2019-11-24 05:48:23,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:23,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:48:23,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873281837] [2019-11-24 05:48:23,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:48:23,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:48:23,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:23,096 INFO L87 Difference]: Start difference. First operand 3214 states and 4397 transitions. Second operand 7 states.