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.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:20,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:20,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:20,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:20,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:20,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:20,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:20,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:20,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:20,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:20,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:20,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:20,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:20,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:20,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:20,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:20,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:20,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:20,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:20,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:20,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:20,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:20,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:20,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:20,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:20,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:20,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:20,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:20,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:20,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:20,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:20,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:20,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:20,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:20,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:20,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:20,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:20,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:20,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:20,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:20,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:20,651 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:20,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:20,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:20,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:20,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:20,668 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:20,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:20,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:20,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:20,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:20,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:20,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:20,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:20,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:20,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:20,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:20,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:20,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:20,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:20,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:20,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:20,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:20,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:20,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:20,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:20,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:20,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:20,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:20,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:20,673 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:20,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:21,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:21,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:21,018 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:21,019 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:21,020 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.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 03:26:21,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a029545/39d727d703e34b9cb1dbe6c252104e46/FLAG4986b6507 [2019-10-15 03:26:21,831 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:21,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 03:26:21,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a029545/39d727d703e34b9cb1dbe6c252104e46/FLAG4986b6507 [2019-10-15 03:26:21,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a029545/39d727d703e34b9cb1dbe6c252104e46 [2019-10-15 03:26:21,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:21,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:21,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:21,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:21,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:21,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e46ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:21, skipping insertion in model container [2019-10-15 03:26:21,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:21" (1/1) ... [2019-10-15 03:26:21,995 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:22,108 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:23,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:23,025 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:23,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:23,254 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:23,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:23 WrapperNode [2019-10-15 03:26:23,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:23,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:23,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:23,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:23,271 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:23" (1/1) ... [2019-10-15 03:26:23,272 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:23" (1/1) ... [2019-10-15 03:26:23,314 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:23" (1/1) ... [2019-10-15 03:26:23,315 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:23" (1/1) ... [2019-10-15 03:26:23,384 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:23" (1/1) ... [2019-10-15 03:26:23,405 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:23" (1/1) ... [2019-10-15 03:26:23,416 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:23" (1/1) ... [2019-10-15 03:26:23,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:23,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:23,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:23,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:23,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:23" (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:23,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:23,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:23,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:23,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:23,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:23,515 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:23,517 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:23,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:23,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:23,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:26,092 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:26,093 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:26,095 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,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:26,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:26,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:26,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:26,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:21" (1/3) ... [2019-10-15 03:26:26,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11068607 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,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:23" (2/3) ... [2019-10-15 03:26:26,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11068607 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,103 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,112 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 03:26:26,121 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:26,130 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-15 03:26:26,142 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-15 03:26:26,172 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:26,172 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:26,172 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:26,172 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:26,172 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:26,172 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:26,173 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:26,173 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states. [2019-10-15 03:26:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:26,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:26,216 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] [2019-10-15 03:26:26,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:26,224 INFO L82 PathProgramCache]: Analyzing trace with hash 118183988, now seen corresponding path program 1 times [2019-10-15 03:26:26,233 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:26,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923827039] [2019-10-15 03:26:26,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:26,778 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:26,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923827039] [2019-10-15 03:26:26,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:26,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:26,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261792625] [2019-10-15 03:26:26,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:26,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:26,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:26,803 INFO L87 Difference]: Start difference. First operand 422 states. Second operand 3 states. [2019-10-15 03:26:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:26,963 INFO L93 Difference]: Finished difference Result 626 states and 1096 transitions. [2019-10-15 03:26:26,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:26,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-15 03:26:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:26,984 INFO L225 Difference]: With dead ends: 626 [2019-10-15 03:26:26,984 INFO L226 Difference]: Without dead ends: 503 [2019-10-15 03:26:26,989 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:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-10-15 03:26:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2019-10-15 03:26:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-15 03:26:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 637 transitions. [2019-10-15 03:26:27,079 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 637 transitions. Word has length 53 [2019-10-15 03:26:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:27,079 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 637 transitions. [2019-10-15 03:26:27,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 637 transitions. [2019-10-15 03:26:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:27,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:27,090 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] [2019-10-15 03:26:27,090 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash 986153255, now seen corresponding path program 1 times [2019-10-15 03:26:27,091 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:27,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515716431] [2019-10-15 03:26:27,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:27,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515716431] [2019-10-15 03:26:27,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:27,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:27,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964314241] [2019-10-15 03:26:27,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:27,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:27,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:27,323 INFO L87 Difference]: Start difference. First operand 497 states and 637 transitions. Second operand 3 states. [2019-10-15 03:26:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:27,385 INFO L93 Difference]: Finished difference Result 828 states and 1093 transitions. [2019-10-15 03:26:27,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:27,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-15 03:26:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:27,389 INFO L225 Difference]: With dead ends: 828 [2019-10-15 03:26:27,390 INFO L226 Difference]: Without dead ends: 633 [2019-10-15 03:26:27,392 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:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-15 03:26:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 627. [2019-10-15 03:26:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-15 03:26:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 814 transitions. [2019-10-15 03:26:27,423 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 814 transitions. Word has length 53 [2019-10-15 03:26:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:27,424 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 814 transitions. [2019-10-15 03:26:27,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 814 transitions. [2019-10-15 03:26:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:27,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:27,430 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] [2019-10-15 03:26:27,431 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1690641165, now seen corresponding path program 1 times [2019-10-15 03:26:27,432 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:27,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393505487] [2019-10-15 03:26:27,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:27,712 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,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393505487] [2019-10-15 03:26:27,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:27,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:27,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031145619] [2019-10-15 03:26:27,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:27,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:27,715 INFO L87 Difference]: Start difference. First operand 627 states and 814 transitions. Second operand 10 states. [2019-10-15 03:26:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:29,733 INFO L93 Difference]: Finished difference Result 1680 states and 2273 transitions. [2019-10-15 03:26:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:26:29,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-15 03:26:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:29,743 INFO L225 Difference]: With dead ends: 1680 [2019-10-15 03:26:29,744 INFO L226 Difference]: Without dead ends: 1584 [2019-10-15 03:26:29,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:26:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-10-15 03:26:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 638. [2019-10-15 03:26:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-15 03:26:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 828 transitions. [2019-10-15 03:26:29,791 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 828 transitions. Word has length 53 [2019-10-15 03:26:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:29,792 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 828 transitions. [2019-10-15 03:26:29,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 828 transitions. [2019-10-15 03:26:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:29,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:29,795 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:29,795 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash 826964088, now seen corresponding path program 1 times [2019-10-15 03:26:29,796 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:29,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633175454] [2019-10-15 03:26:29,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:29,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:29,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:29,888 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,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633175454] [2019-10-15 03:26:29,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:29,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:29,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109128975] [2019-10-15 03:26:29,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:29,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:29,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:29,891 INFO L87 Difference]: Start difference. First operand 638 states and 828 transitions. Second operand 3 states. [2019-10-15 03:26:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:30,038 INFO L93 Difference]: Finished difference Result 1145 states and 1509 transitions. [2019-10-15 03:26:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:30,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 03:26:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:30,044 INFO L225 Difference]: With dead ends: 1145 [2019-10-15 03:26:30,044 INFO L226 Difference]: Without dead ends: 900 [2019-10-15 03:26:30,045 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:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-10-15 03:26:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 893. [2019-10-15 03:26:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-10-15 03:26:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1164 transitions. [2019-10-15 03:26:30,100 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1164 transitions. Word has length 54 [2019-10-15 03:26:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:30,101 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1164 transitions. [2019-10-15 03:26:30,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1164 transitions. [2019-10-15 03:26:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:30,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:30,104 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:30,105 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 720923157, now seen corresponding path program 1 times [2019-10-15 03:26:30,106 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:30,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843922581] [2019-10-15 03:26:30,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:30,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:30,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:30,334 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:30,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843922581] [2019-10-15 03:26:30,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:30,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:26:30,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419816278] [2019-10-15 03:26:30,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:26:30,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:26:30,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:30,337 INFO L87 Difference]: Start difference. First operand 893 states and 1164 transitions. Second operand 12 states. [2019-10-15 03:26:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:33,412 INFO L93 Difference]: Finished difference Result 2772 states and 3661 transitions. [2019-10-15 03:26:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 03:26:33,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-15 03:26:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:33,431 INFO L225 Difference]: With dead ends: 2772 [2019-10-15 03:26:33,431 INFO L226 Difference]: Without dead ends: 2639 [2019-10-15 03:26:33,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-10-15 03:26:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-10-15 03:26:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 909. [2019-10-15 03:26:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-10-15 03:26:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1187 transitions. [2019-10-15 03:26:33,571 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1187 transitions. Word has length 54 [2019-10-15 03:26:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:33,571 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1187 transitions. [2019-10-15 03:26:33,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:26:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1187 transitions. [2019-10-15 03:26:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:33,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:33,574 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:33,575 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:33,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1425411067, now seen corresponding path program 1 times [2019-10-15 03:26:33,575 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:33,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133068964] [2019-10-15 03:26:33,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:33,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:33,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:33,773 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,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133068964] [2019-10-15 03:26:33,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:33,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:33,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867808150] [2019-10-15 03:26:33,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:33,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:33,776 INFO L87 Difference]: Start difference. First operand 909 states and 1187 transitions. Second operand 9 states. [2019-10-15 03:26:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:35,187 INFO L93 Difference]: Finished difference Result 3241 states and 4310 transitions. [2019-10-15 03:26:35,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:26:35,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-15 03:26:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:35,202 INFO L225 Difference]: With dead ends: 3241 [2019-10-15 03:26:35,202 INFO L226 Difference]: Without dead ends: 2641 [2019-10-15 03:26:35,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:26:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-10-15 03:26:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1900. [2019-10-15 03:26:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-10-15 03:26:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2528 transitions. [2019-10-15 03:26:35,510 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2528 transitions. Word has length 54 [2019-10-15 03:26:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:35,511 INFO L462 AbstractCegarLoop]: Abstraction has 1900 states and 2528 transitions. [2019-10-15 03:26:35,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2528 transitions. [2019-10-15 03:26:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:35,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:35,517 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:35,518 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:35,518 INFO L82 PathProgramCache]: Analyzing trace with hash 671280621, now seen corresponding path program 1 times [2019-10-15 03:26:35,519 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:35,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172709933] [2019-10-15 03:26:35,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:35,724 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:35,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172709933] [2019-10-15 03:26:35,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:35,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:35,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113014754] [2019-10-15 03:26:35,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:35,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:35,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:35,727 INFO L87 Difference]: Start difference. First operand 1900 states and 2528 transitions. Second operand 10 states. [2019-10-15 03:26:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:37,480 INFO L93 Difference]: Finished difference Result 4351 states and 5721 transitions. [2019-10-15 03:26:37,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:26:37,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-15 03:26:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:37,499 INFO L225 Difference]: With dead ends: 4351 [2019-10-15 03:26:37,499 INFO L226 Difference]: Without dead ends: 4092 [2019-10-15 03:26:37,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:26:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-10-15 03:26:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 1911. [2019-10-15 03:26:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2019-10-15 03:26:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2542 transitions. [2019-10-15 03:26:37,740 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2542 transitions. Word has length 54 [2019-10-15 03:26:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:37,740 INFO L462 AbstractCegarLoop]: Abstraction has 1911 states and 2542 transitions. [2019-10-15 03:26:37,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2542 transitions. [2019-10-15 03:26:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:37,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:37,744 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:37,744 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1263798090, now seen corresponding path program 1 times [2019-10-15 03:26:37,745 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:37,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836849286] [2019-10-15 03:26:37,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:37,882 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,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836849286] [2019-10-15 03:26:37,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:37,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:37,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777980965] [2019-10-15 03:26:37,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:37,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:37,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:37,885 INFO L87 Difference]: Start difference. First operand 1911 states and 2542 transitions. Second operand 9 states. [2019-10-15 03:26:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:39,366 INFO L93 Difference]: Finished difference Result 4351 states and 5791 transitions. [2019-10-15 03:26:39,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:26:39,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 03:26:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:39,382 INFO L225 Difference]: With dead ends: 4351 [2019-10-15 03:26:39,383 INFO L226 Difference]: Without dead ends: 3985 [2019-10-15 03:26:39,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:26:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2019-10-15 03:26:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 1926. [2019-10-15 03:26:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-10-15 03:26:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2564 transitions. [2019-10-15 03:26:39,630 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2564 transitions. Word has length 55 [2019-10-15 03:26:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:39,630 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 2564 transitions. [2019-10-15 03:26:39,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2564 transitions. [2019-10-15 03:26:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:39,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:39,633 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:39,634 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1901142492, now seen corresponding path program 1 times [2019-10-15 03:26:39,634 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:39,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731633413] [2019-10-15 03:26:39,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:39,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:39,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:39,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-10-15 03:26:39,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731633413] [2019-10-15 03:26:39,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:39,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:39,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279553825] [2019-10-15 03:26:39,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:39,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:39,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:39,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:39,807 INFO L87 Difference]: Start difference. First operand 1926 states and 2564 transitions. Second operand 6 states. [2019-10-15 03:26:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:40,409 INFO L93 Difference]: Finished difference Result 3137 states and 4192 transitions. [2019-10-15 03:26:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:40,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 03:26:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:40,415 INFO L225 Difference]: With dead ends: 3137 [2019-10-15 03:26:40,416 INFO L226 Difference]: Without dead ends: 1813 [2019-10-15 03:26:40,418 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:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-10-15 03:26:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1342. [2019-10-15 03:26:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-15 03:26:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1765 transitions. [2019-10-15 03:26:40,616 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1765 transitions. Word has length 55 [2019-10-15 03:26:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:40,618 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1765 transitions. [2019-10-15 03:26:40,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1765 transitions. [2019-10-15 03:26:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:40,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:40,624 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:40,625 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1734009014, now seen corresponding path program 1 times [2019-10-15 03:26:40,628 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:40,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124492520] [2019-10-15 03:26:40,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:40,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:40,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:40,775 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:40,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124492520] [2019-10-15 03:26:40,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:40,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:40,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997282733] [2019-10-15 03:26:40,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:40,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:40,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:40,778 INFO L87 Difference]: Start difference. First operand 1342 states and 1765 transitions. Second operand 10 states. [2019-10-15 03:26:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:43,883 INFO L93 Difference]: Finished difference Result 6178 states and 8352 transitions. [2019-10-15 03:26:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 03:26:43,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-15 03:26:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:43,901 INFO L225 Difference]: With dead ends: 6178 [2019-10-15 03:26:43,901 INFO L226 Difference]: Without dead ends: 5828 [2019-10-15 03:26:43,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-10-15 03:26:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2019-10-15 03:26:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 1342. [2019-10-15 03:26:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-15 03:26:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1765 transitions. [2019-10-15 03:26:44,107 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1765 transitions. Word has length 55 [2019-10-15 03:26:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:44,107 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1765 transitions. [2019-10-15 03:26:44,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1765 transitions. [2019-10-15 03:26:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:44,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:44,109 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:44,110 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -810802093, now seen corresponding path program 1 times [2019-10-15 03:26:44,110 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:44,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348179915] [2019-10-15 03:26:44,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:44,231 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,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348179915] [2019-10-15 03:26:44,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:44,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:44,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967241981] [2019-10-15 03:26:44,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:44,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:44,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:44,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:44,233 INFO L87 Difference]: Start difference. First operand 1342 states and 1765 transitions. Second operand 9 states. [2019-10-15 03:26:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:45,882 INFO L93 Difference]: Finished difference Result 5855 states and 7757 transitions. [2019-10-15 03:26:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:26:45,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 03:26:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:45,900 INFO L225 Difference]: With dead ends: 5855 [2019-10-15 03:26:45,900 INFO L226 Difference]: Without dead ends: 4755 [2019-10-15 03:26:45,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:26:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-10-15 03:26:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 3230. [2019-10-15 03:26:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2019-10-15 03:26:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 4279 transitions. [2019-10-15 03:26:46,375 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 4279 transitions. Word has length 55 [2019-10-15 03:26:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:46,375 INFO L462 AbstractCegarLoop]: Abstraction has 3230 states and 4279 transitions. [2019-10-15 03:26:46,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 4279 transitions. [2019-10-15 03:26:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:46,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:46,379 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:46,379 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:46,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash -890852479, now seen corresponding path program 1 times [2019-10-15 03:26:46,380 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:46,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560206147] [2019-10-15 03:26:46,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:46,522 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,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560206147] [2019-10-15 03:26:46,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:46,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:46,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829797714] [2019-10-15 03:26:46,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:46,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:46,525 INFO L87 Difference]: Start difference. First operand 3230 states and 4279 transitions. Second operand 9 states. [2019-10-15 03:26:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:50,861 INFO L93 Difference]: Finished difference Result 12907 states and 17014 transitions. [2019-10-15 03:26:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:26:50,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 03:26:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:50,886 INFO L225 Difference]: With dead ends: 12907 [2019-10-15 03:26:50,887 INFO L226 Difference]: Without dead ends: 11893 [2019-10-15 03:26:50,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2019-10-15 03:26:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 3244. [2019-10-15 03:26:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2019-10-15 03:26:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4297 transitions. [2019-10-15 03:26:51,517 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4297 transitions. Word has length 55 [2019-10-15 03:26:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:51,517 INFO L462 AbstractCegarLoop]: Abstraction has 3244 states and 4297 transitions. [2019-10-15 03:26:51,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4297 transitions. [2019-10-15 03:26:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:51,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:51,522 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:51,522 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash 154971769, now seen corresponding path program 1 times [2019-10-15 03:26:51,523 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:51,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376073525] [2019-10-15 03:26:51,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:51,615 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:51,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376073525] [2019-10-15 03:26:51,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:51,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:26:51,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747651374] [2019-10-15 03:26:51,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:26:51,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:51,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:26:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:51,618 INFO L87 Difference]: Start difference. First operand 3244 states and 4297 transitions. Second operand 7 states. [2019-10-15 03:26:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:54,031 INFO L93 Difference]: Finished difference Result 7810 states and 10405 transitions. [2019-10-15 03:26:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:26:54,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-15 03:26:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:54,047 INFO L225 Difference]: With dead ends: 7810 [2019-10-15 03:26:54,047 INFO L226 Difference]: Without dead ends: 7307 [2019-10-15 03:26:54,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 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-10-15 03:26:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2019-10-15 03:26:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 3262. [2019-10-15 03:26:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-10-15 03:26:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4321 transitions. [2019-10-15 03:26:54,856 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4321 transitions. Word has length 55 [2019-10-15 03:26:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:54,856 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 4321 transitions. [2019-10-15 03:26:54,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:26:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4321 transitions. [2019-10-15 03:26:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:54,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:54,860 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:54,860 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 377850356, now seen corresponding path program 1 times [2019-10-15 03:26:54,861 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:54,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970499707] [2019-10-15 03:26:54,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:54,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:54,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:54,952 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:54,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970499707] [2019-10-15 03:26:54,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:54,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:26:54,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343227024] [2019-10-15 03:26:54,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:26:54,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:26:54,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:54,954 INFO L87 Difference]: Start difference. First operand 3262 states and 4321 transitions. Second operand 7 states.