java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:18,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:18,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:18,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:18,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:18,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:18,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:18,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:18,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:18,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:18,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:18,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:18,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:18,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:18,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:18,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:18,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:18,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:18,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:18,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:18,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:18,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:18,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:18,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:18,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:18,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:18,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:18,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:18,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:18,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:18,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:18,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:18,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:18,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:18,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:18,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:18,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:18,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:18,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:18,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:18,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:18,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:26:18,533 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:18,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:18,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:18,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:18,536 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:18,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:18,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:18,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:18,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:18,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:18,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:18,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:18,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:18,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:18,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:18,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:18,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:18,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:18,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:18,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:18,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:18,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:18,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:18,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:18,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:18,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:18,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:18,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:18,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:26:18,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:18,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:18,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:18,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:18,855 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:18,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:18,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad61bded/17db4d55e3ba428e8658df1a770e1d41/FLAGa168e5ae8 [2019-10-15 03:26:19,699 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:19,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:19,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad61bded/17db4d55e3ba428e8658df1a770e1d41/FLAGa168e5ae8 [2019-10-15 03:26:19,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad61bded/17db4d55e3ba428e8658df1a770e1d41 [2019-10-15 03:26:19,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:19,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:19,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:19,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:19,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:19,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:19" (1/1) ... [2019-10-15 03:26:19,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5228e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:19, skipping insertion in model container [2019-10-15 03:26:19,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:19" (1/1) ... [2019-10-15 03:26:19,796 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:19,949 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:20,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:20,939 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:21,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:21,350 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:21,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21 WrapperNode [2019-10-15 03:26:21,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:21,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:21,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:21,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:21,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:21,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:21,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:21,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:21,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:21,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:21,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:21,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:21,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:21,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:21,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:21,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 03:26:21,689 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:26,291 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:26,291 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:26,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:26 BoogieIcfgContainer [2019-10-15 03:26:26,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:26,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:26,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:26,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:26,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:19" (1/3) ... [2019-10-15 03:26:26,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc51e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:26, skipping insertion in model container [2019-10-15 03:26:26,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21" (2/3) ... [2019-10-15 03:26:26,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc51e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:26, skipping insertion in model container [2019-10-15 03:26:26,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:26" (3/3) ... [2019-10-15 03:26:26,310 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 03:26:26,323 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:26,337 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 03:26:26,349 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 03:26:26,397 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:26,398 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:26,398 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:26,398 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:26,398 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:26,399 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:26,399 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:26,399 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states. [2019-10-15 03:26:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:26,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:26,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:26,483 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1364126483, now seen corresponding path program 1 times [2019-10-15 03:26:26,499 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:26,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145108031] [2019-10-15 03:26:26,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:27,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145108031] [2019-10-15 03:26:27,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:27,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:27,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801543084] [2019-10-15 03:26:27,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:27,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:27,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:27,075 INFO L87 Difference]: Start difference. First operand 1182 states. Second operand 5 states. [2019-10-15 03:26:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:29,217 INFO L93 Difference]: Finished difference Result 2278 states and 3982 transitions. [2019-10-15 03:26:29,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:29,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-15 03:26:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:29,245 INFO L225 Difference]: With dead ends: 2278 [2019-10-15 03:26:29,246 INFO L226 Difference]: Without dead ends: 1426 [2019-10-15 03:26:29,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-10-15 03:26:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1420. [2019-10-15 03:26:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2019-10-15 03:26:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1862 transitions. [2019-10-15 03:26:29,405 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1862 transitions. Word has length 54 [2019-10-15 03:26:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:29,406 INFO L462 AbstractCegarLoop]: Abstraction has 1420 states and 1862 transitions. [2019-10-15 03:26:29,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1862 transitions. [2019-10-15 03:26:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:29,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:29,411 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:29,411 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash -672874759, now seen corresponding path program 1 times [2019-10-15 03:26:29,412 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:29,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540436625] [2019-10-15 03:26:29,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:29,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:29,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:29,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540436625] [2019-10-15 03:26:29,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:29,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:29,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780685458] [2019-10-15 03:26:29,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:29,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:29,666 INFO L87 Difference]: Start difference. First operand 1420 states and 1862 transitions. Second operand 6 states. [2019-10-15 03:26:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:31,071 INFO L93 Difference]: Finished difference Result 2953 states and 3915 transitions. [2019-10-15 03:26:31,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:31,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 03:26:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:31,083 INFO L225 Difference]: With dead ends: 2953 [2019-10-15 03:26:31,083 INFO L226 Difference]: Without dead ends: 1982 [2019-10-15 03:26:31,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-10-15 03:26:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1966. [2019-10-15 03:26:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-10-15 03:26:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2586 transitions. [2019-10-15 03:26:31,193 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2586 transitions. Word has length 55 [2019-10-15 03:26:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:31,194 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 2586 transitions. [2019-10-15 03:26:31,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2586 transitions. [2019-10-15 03:26:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:31,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:31,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:31,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1781940792, now seen corresponding path program 1 times [2019-10-15 03:26:31,207 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:31,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792425959] [2019-10-15 03:26:31,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:31,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:31,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:31,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792425959] [2019-10-15 03:26:31,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:31,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:31,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920124523] [2019-10-15 03:26:31,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:31,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:31,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:31,464 INFO L87 Difference]: Start difference. First operand 1966 states and 2586 transitions. Second operand 6 states. [2019-10-15 03:26:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:32,776 INFO L93 Difference]: Finished difference Result 4903 states and 6449 transitions. [2019-10-15 03:26:32,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:32,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 03:26:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:32,797 INFO L225 Difference]: With dead ends: 4903 [2019-10-15 03:26:32,798 INFO L226 Difference]: Without dead ends: 3594 [2019-10-15 03:26:32,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-10-15 03:26:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3574. [2019-10-15 03:26:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-15 03:26:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4699 transitions. [2019-10-15 03:26:32,975 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4699 transitions. Word has length 55 [2019-10-15 03:26:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:32,975 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4699 transitions. [2019-10-15 03:26:32,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4699 transitions. [2019-10-15 03:26:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:32,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:32,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:32,981 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1568068960, now seen corresponding path program 1 times [2019-10-15 03:26:32,981 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:32,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673832129] [2019-10-15 03:26:32,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:33,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673832129] [2019-10-15 03:26:33,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:33,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:33,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266217919] [2019-10-15 03:26:33,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:33,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:33,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:33,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:33,270 INFO L87 Difference]: Start difference. First operand 3574 states and 4699 transitions. Second operand 9 states. [2019-10-15 03:26:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:36,788 INFO L93 Difference]: Finished difference Result 5337 states and 7152 transitions. [2019-10-15 03:26:36,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:26:36,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 03:26:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:36,816 INFO L225 Difference]: With dead ends: 5337 [2019-10-15 03:26:36,817 INFO L226 Difference]: Without dead ends: 5332 [2019-10-15 03:26:36,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-15 03:26:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2019-10-15 03:26:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 3574. [2019-10-15 03:26:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-15 03:26:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4698 transitions. [2019-10-15 03:26:37,132 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4698 transitions. Word has length 56 [2019-10-15 03:26:37,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:37,133 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4698 transitions. [2019-10-15 03:26:37,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4698 transitions. [2019-10-15 03:26:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:37,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:37,138 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:37,139 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash -634470005, now seen corresponding path program 1 times [2019-10-15 03:26:37,140 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:37,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32015756] [2019-10-15 03:26:37,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:37,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32015756] [2019-10-15 03:26:37,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:37,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:37,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806332655] [2019-10-15 03:26:37,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:37,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:37,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:37,302 INFO L87 Difference]: Start difference. First operand 3574 states and 4698 transitions. Second operand 9 states. [2019-10-15 03:26:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:40,997 INFO L93 Difference]: Finished difference Result 8465 states and 11375 transitions. [2019-10-15 03:26:40,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:26:40,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 03:26:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:41,039 INFO L225 Difference]: With dead ends: 8465 [2019-10-15 03:26:41,040 INFO L226 Difference]: Without dead ends: 8171 [2019-10-15 03:26:41,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2019-10-15 03:26:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 3574. [2019-10-15 03:26:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-15 03:26:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4697 transitions. [2019-10-15 03:26:41,319 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4697 transitions. Word has length 56 [2019-10-15 03:26:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:41,319 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4697 transitions. [2019-10-15 03:26:41,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4697 transitions. [2019-10-15 03:26:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:41,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:41,326 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:41,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2025706282, now seen corresponding path program 1 times [2019-10-15 03:26:41,327 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:41,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977223715] [2019-10-15 03:26:41,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:41,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:41,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:41,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977223715] [2019-10-15 03:26:41,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:41,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:26:41,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290842655] [2019-10-15 03:26:41,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:26:41,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:41,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:26:41,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:41,680 INFO L87 Difference]: Start difference. First operand 3574 states and 4697 transitions. Second operand 8 states. [2019-10-15 03:26:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:44,298 INFO L93 Difference]: Finished difference Result 7606 states and 10513 transitions. [2019-10-15 03:26:44,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:26:44,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-15 03:26:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:44,327 INFO L225 Difference]: With dead ends: 7606 [2019-10-15 03:26:44,328 INFO L226 Difference]: Without dead ends: 6706 [2019-10-15 03:26:44,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:26:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2019-10-15 03:26:44,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 3574. [2019-10-15 03:26:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-15 03:26:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4696 transitions. [2019-10-15 03:26:44,590 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4696 transitions. Word has length 56 [2019-10-15 03:26:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:44,590 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4696 transitions. [2019-10-15 03:26:44,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:26:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4696 transitions. [2019-10-15 03:26:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:44,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:44,595 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:44,595 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1601603689, now seen corresponding path program 1 times [2019-10-15 03:26:44,596 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:44,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259429099] [2019-10-15 03:26:44,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:44,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259429099] [2019-10-15 03:26:44,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:44,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:44,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712017235] [2019-10-15 03:26:44,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:44,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:44,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:44,678 INFO L87 Difference]: Start difference. First operand 3574 states and 4696 transitions. Second operand 3 states. [2019-10-15 03:26:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:45,172 INFO L93 Difference]: Finished difference Result 6645 states and 8841 transitions. [2019-10-15 03:26:45,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:45,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:26:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:45,195 INFO L225 Difference]: With dead ends: 6645 [2019-10-15 03:26:45,196 INFO L226 Difference]: Without dead ends: 4648 [2019-10-15 03:26:45,201 INFO L600 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-10-15 03:26:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2019-10-15 03:26:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 4642. [2019-10-15 03:26:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2019-10-15 03:26:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 5984 transitions. [2019-10-15 03:26:45,555 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 5984 transitions. Word has length 57 [2019-10-15 03:26:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:45,556 INFO L462 AbstractCegarLoop]: Abstraction has 4642 states and 5984 transitions. [2019-10-15 03:26:45,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 5984 transitions. [2019-10-15 03:26:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:45,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:45,562 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:45,562 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -466438381, now seen corresponding path program 1 times [2019-10-15 03:26:45,563 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:45,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509303289] [2019-10-15 03:26:45,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:45,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:45,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509303289] [2019-10-15 03:26:45,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:45,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:45,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635102281] [2019-10-15 03:26:45,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:45,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:45,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:45,632 INFO L87 Difference]: Start difference. First operand 4642 states and 5984 transitions. Second operand 3 states. [2019-10-15 03:26:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:45,927 INFO L93 Difference]: Finished difference Result 6703 states and 8942 transitions. [2019-10-15 03:26:45,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:45,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:26:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:45,938 INFO L225 Difference]: With dead ends: 6703 [2019-10-15 03:26:45,938 INFO L226 Difference]: Without dead ends: 5172 [2019-10-15 03:26:45,943 INFO L600 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-10-15 03:26:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-10-15 03:26:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 4832. [2019-10-15 03:26:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2019-10-15 03:26:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 6302 transitions. [2019-10-15 03:26:46,309 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 6302 transitions. Word has length 57 [2019-10-15 03:26:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:46,310 INFO L462 AbstractCegarLoop]: Abstraction has 4832 states and 6302 transitions. [2019-10-15 03:26:46,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 6302 transitions. [2019-10-15 03:26:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:46,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:46,316 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:46,316 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:46,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:46,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1782949341, now seen corresponding path program 1 times [2019-10-15 03:26:46,317 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:46,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342310213] [2019-10-15 03:26:46,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:46,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342310213] [2019-10-15 03:26:46,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:46,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:46,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110001279] [2019-10-15 03:26:46,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:46,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:46,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:46,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:46,381 INFO L87 Difference]: Start difference. First operand 4832 states and 6302 transitions. Second operand 3 states. [2019-10-15 03:26:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:46,866 INFO L93 Difference]: Finished difference Result 7920 states and 10691 transitions. [2019-10-15 03:26:46,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:46,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:26:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:46,879 INFO L225 Difference]: With dead ends: 7920 [2019-10-15 03:26:46,880 INFO L226 Difference]: Without dead ends: 5800 [2019-10-15 03:26:46,885 INFO L600 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-10-15 03:26:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5800 states. [2019-10-15 03:26:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5800 to 5300. [2019-10-15 03:26:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5300 states. [2019-10-15 03:26:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 6966 transitions. [2019-10-15 03:26:47,277 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 6966 transitions. Word has length 57 [2019-10-15 03:26:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:47,278 INFO L462 AbstractCegarLoop]: Abstraction has 5300 states and 6966 transitions. [2019-10-15 03:26:47,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 6966 transitions. [2019-10-15 03:26:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:47,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:47,283 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:47,283 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash -794875623, now seen corresponding path program 1 times [2019-10-15 03:26:47,284 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:47,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81664891] [2019-10-15 03:26:47,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:47,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81664891] [2019-10-15 03:26:47,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:47,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:47,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035916058] [2019-10-15 03:26:47,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:47,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:47,346 INFO L87 Difference]: Start difference. First operand 5300 states and 6966 transitions. Second operand 3 states. [2019-10-15 03:26:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:48,083 INFO L93 Difference]: Finished difference Result 9159 states and 12034 transitions. [2019-10-15 03:26:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:48,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:26:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:48,091 INFO L225 Difference]: With dead ends: 9159 [2019-10-15 03:26:48,092 INFO L226 Difference]: Without dead ends: 4419 [2019-10-15 03:26:48,101 INFO L600 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-10-15 03:26:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2019-10-15 03:26:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 3526. [2019-10-15 03:26:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2019-10-15 03:26:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4545 transitions. [2019-10-15 03:26:48,473 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4545 transitions. Word has length 58 [2019-10-15 03:26:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:48,473 INFO L462 AbstractCegarLoop]: Abstraction has 3526 states and 4545 transitions. [2019-10-15 03:26:48,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4545 transitions. [2019-10-15 03:26:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:48,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:48,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:48,476 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1917578780, now seen corresponding path program 1 times [2019-10-15 03:26:48,476 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:48,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828919119] [2019-10-15 03:26:48,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:48,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828919119] [2019-10-15 03:26:48,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:48,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:48,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281789647] [2019-10-15 03:26:48,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:48,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:48,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:48,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:48,537 INFO L87 Difference]: Start difference. First operand 3526 states and 4545 transitions. Second operand 3 states. [2019-10-15 03:26:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:49,066 INFO L93 Difference]: Finished difference Result 5836 states and 7671 transitions. [2019-10-15 03:26:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:49,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:26:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:49,072 INFO L225 Difference]: With dead ends: 5836 [2019-10-15 03:26:49,072 INFO L226 Difference]: Without dead ends: 3278 [2019-10-15 03:26:49,077 INFO L600 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-10-15 03:26:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2019-10-15 03:26:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 2660. [2019-10-15 03:26:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-10-15 03:26:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3401 transitions. [2019-10-15 03:26:49,377 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3401 transitions. Word has length 58 [2019-10-15 03:26:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:49,377 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3401 transitions. [2019-10-15 03:26:49,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3401 transitions. [2019-10-15 03:26:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:49,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:49,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:49,380 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1724765725, now seen corresponding path program 1 times [2019-10-15 03:26:49,381 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:49,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000455118] [2019-10-15 03:26:49,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:49,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:49,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:49,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000455118] [2019-10-15 03:26:49,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:49,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:49,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374719575] [2019-10-15 03:26:49,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:49,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:49,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:49,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:49,441 INFO L87 Difference]: Start difference. First operand 2660 states and 3401 transitions. Second operand 3 states. [2019-10-15 03:26:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:49,807 INFO L93 Difference]: Finished difference Result 5481 states and 7239 transitions. [2019-10-15 03:26:49,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:49,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:26:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:49,811 INFO L225 Difference]: With dead ends: 5481 [2019-10-15 03:26:49,811 INFO L226 Difference]: Without dead ends: 3482 [2019-10-15 03:26:49,816 INFO L600 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-10-15 03:26:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2019-10-15 03:26:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 2838. [2019-10-15 03:26:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2019-10-15 03:26:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3720 transitions. [2019-10-15 03:26:50,127 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3720 transitions. Word has length 58 [2019-10-15 03:26:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:50,128 INFO L462 AbstractCegarLoop]: Abstraction has 2838 states and 3720 transitions. [2019-10-15 03:26:50,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3720 transitions. [2019-10-15 03:26:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:26:50,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:50,129 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:50,130 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash 377672324, now seen corresponding path program 1 times [2019-10-15 03:26:50,130 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:50,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999984185] [2019-10-15 03:26:50,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:50,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999984185] [2019-10-15 03:26:50,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:50,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-15 03:26:50,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325229593] [2019-10-15 03:26:50,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 03:26:50,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:50,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 03:26:50,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:26:50,902 INFO L87 Difference]: Start difference. First operand 2838 states and 3720 transitions. Second operand 19 states.