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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:52:39,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:52:39,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:52:39,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:52:39,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:52:39,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:52:39,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:52:39,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:52:39,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:52:39,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:52:39,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:52:39,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:52:39,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:52:39,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:52:39,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:52:39,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:52:39,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:52:39,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:52:39,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:52:39,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:52:39,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:52:39,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:52:39,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:52:39,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:52:39,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:52:39,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:52:39,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:52:39,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:52:39,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:52:39,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:52:39,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:52:39,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:52:39,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:52:39,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:52:39,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:52:39,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:52:39,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:52:39,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:52:39,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:52:39,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:52:39,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:52:39,133 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-07 15:52:39,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:52:39,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:52:39,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:52:39,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:52:39,159 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:52:39,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:52:39,159 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:52:39,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:52:39,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:52:39,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:52:39,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:52:39,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:52:39,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:52:39,161 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:52:39,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:52:39,162 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:52:39,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:52:39,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:52:39,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:52:39,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:52:39,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:52:39,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:52:39,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:52:39,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:52:39,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:52:39,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:52:39,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:52:39,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:52:39,165 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-07 15:52:39,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:52:39,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:52:39,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:52:39,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:52:39,436 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:52:39,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-07 15:52:39,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df676655a/ef986d42f26c480cb66051aff368b216/FLAG7dc2e90b5 [2019-10-07 15:52:40,108 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:52:40,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-07 15:52:40,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df676655a/ef986d42f26c480cb66051aff368b216/FLAG7dc2e90b5 [2019-10-07 15:52:40,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df676655a/ef986d42f26c480cb66051aff368b216 [2019-10-07 15:52:40,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:52:40,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:52:40,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:52:40,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:52:40,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:52:40,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:52:40" (1/1) ... [2019-10-07 15:52:40,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315746f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:40, skipping insertion in model container [2019-10-07 15:52:40,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:52:40" (1/1) ... [2019-10-07 15:52:40,342 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:52:40,429 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:52:41,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:52:41,187 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:52:41,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:52:41,683 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:52:41,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41 WrapperNode [2019-10-07 15:52:41,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:52:41,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:52:41,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:52:41,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:52:41,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (1/1) ... [2019-10-07 15:52:41,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (1/1) ... [2019-10-07 15:52:41,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (1/1) ... [2019-10-07 15:52:41,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (1/1) ... [2019-10-07 15:52:41,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (1/1) ... [2019-10-07 15:52:41,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (1/1) ... [2019-10-07 15:52:41,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (1/1) ... [2019-10-07 15:52:41,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:52:41,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:52:41,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:52:41,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:52:41,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (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-07 15:52:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:52:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:52:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:52:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:52:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 15:52:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-07 15:52:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 15:52:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-07 15:52:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 15:52:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 15:52:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-07 15:52:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-07 15:52:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-07 15:52:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-07 15:52:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 15:52:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 15:52:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:52:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:52:41,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:52:44,871 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:52:44,872 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 15:52:44,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:52:44 BoogieIcfgContainer [2019-10-07 15:52:44,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:52:44,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:52:44,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:52:44,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:52:44,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:52:40" (1/3) ... [2019-10-07 15:52:44,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711a588b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:52:44, skipping insertion in model container [2019-10-07 15:52:44,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:52:41" (2/3) ... [2019-10-07 15:52:44,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711a588b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:52:44, skipping insertion in model container [2019-10-07 15:52:44,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:52:44" (3/3) ... [2019-10-07 15:52:44,882 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-07 15:52:44,891 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:52:44,899 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-07 15:52:44,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-07 15:52:44,938 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:52:44,939 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:52:44,939 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:52:44,939 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:52:44,939 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:52:44,939 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:52:44,939 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:52:44,940 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:52:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states. [2019-10-07 15:52:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-07 15:52:44,980 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:44,981 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:44,983 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:44,989 INFO L82 PathProgramCache]: Analyzing trace with hash -88145364, now seen corresponding path program 1 times [2019-10-07 15:52:44,998 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:44,998 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:44,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:44,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:44,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:46,196 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-07 15:52:46,197 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:46,198 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:46,199 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 15:52:46,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 15:52:46,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 15:52:46,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-07 15:52:46,231 INFO L87 Difference]: Start difference. First operand 320 states. Second operand 6 states. [2019-10-07 15:52:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:46,577 INFO L93 Difference]: Finished difference Result 834 states and 1461 transitions. [2019-10-07 15:52:46,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:52:46,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-07 15:52:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:46,609 INFO L225 Difference]: With dead ends: 834 [2019-10-07 15:52:46,609 INFO L226 Difference]: Without dead ends: 567 [2019-10-07 15:52:46,620 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-07 15:52:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-07 15:52:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 545. [2019-10-07 15:52:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-07 15:52:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 723 transitions. [2019-10-07 15:52:46,726 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 723 transitions. Word has length 123 [2019-10-07 15:52:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:46,727 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 723 transitions. [2019-10-07 15:52:46,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 15:52:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 723 transitions. [2019-10-07 15:52:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-07 15:52:46,734 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:46,734 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:46,735 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1796124794, now seen corresponding path program 1 times [2019-10-07 15:52:46,736 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:46,736 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:46,737 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:46,737 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:52:46,857 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:46,857 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:46,857 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:52:46,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:52:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:52:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:52:46,860 INFO L87 Difference]: Start difference. First operand 545 states and 723 transitions. Second operand 3 states. [2019-10-07 15:52:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:46,947 INFO L93 Difference]: Finished difference Result 1238 states and 1691 transitions. [2019-10-07 15:52:46,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:52:46,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-07 15:52:46,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:46,952 INFO L225 Difference]: With dead ends: 1238 [2019-10-07 15:52:46,952 INFO L226 Difference]: Without dead ends: 737 [2019-10-07 15:52:46,954 INFO L606 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-07 15:52:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-07 15:52:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 652. [2019-10-07 15:52:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-10-07 15:52:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 896 transitions. [2019-10-07 15:52:46,985 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 896 transitions. Word has length 125 [2019-10-07 15:52:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:46,986 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 896 transitions. [2019-10-07 15:52:46,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:52:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 896 transitions. [2019-10-07 15:52:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-07 15:52:46,988 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:46,989 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:46,989 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -254745606, now seen corresponding path program 1 times [2019-10-07 15:52:46,990 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:46,990 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:46,990 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:46,990 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:47,072 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-07 15:52:47,073 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:47,073 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:47,073 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:52:47,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:52:47,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:52:47,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:52:47,075 INFO L87 Difference]: Start difference. First operand 652 states and 896 transitions. Second operand 3 states. [2019-10-07 15:52:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:47,194 INFO L93 Difference]: Finished difference Result 1509 states and 2134 transitions. [2019-10-07 15:52:47,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:52:47,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-07 15:52:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:47,200 INFO L225 Difference]: With dead ends: 1509 [2019-10-07 15:52:47,201 INFO L226 Difference]: Without dead ends: 925 [2019-10-07 15:52:47,203 INFO L606 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-07 15:52:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-10-07 15:52:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 853. [2019-10-07 15:52:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-10-07 15:52:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1221 transitions. [2019-10-07 15:52:47,310 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1221 transitions. Word has length 125 [2019-10-07 15:52:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:47,310 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1221 transitions. [2019-10-07 15:52:47,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:52:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1221 transitions. [2019-10-07 15:52:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-07 15:52:47,314 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:47,314 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:47,314 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:47,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1233192348, now seen corresponding path program 1 times [2019-10-07 15:52:47,315 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:47,316 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:47,316 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:47,316 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:47,504 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-07 15:52:47,505 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:47,505 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:47,505 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 15:52:47,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 15:52:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 15:52:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 15:52:47,507 INFO L87 Difference]: Start difference. First operand 853 states and 1221 transitions. Second operand 6 states. [2019-10-07 15:52:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:47,948 INFO L93 Difference]: Finished difference Result 2178 states and 3205 transitions. [2019-10-07 15:52:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:52:47,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-07 15:52:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:47,956 INFO L225 Difference]: With dead ends: 2178 [2019-10-07 15:52:47,956 INFO L226 Difference]: Without dead ends: 1367 [2019-10-07 15:52:47,958 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:52:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-10-07 15:52:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1275. [2019-10-07 15:52:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-10-07 15:52:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1897 transitions. [2019-10-07 15:52:48,043 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1897 transitions. Word has length 128 [2019-10-07 15:52:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:48,045 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1897 transitions. [2019-10-07 15:52:48,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 15:52:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1897 transitions. [2019-10-07 15:52:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-07 15:52:48,047 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:48,047 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:48,048 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1281543543, now seen corresponding path program 1 times [2019-10-07 15:52:48,048 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:48,049 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:48,049 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:48,049 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:48,254 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-07 15:52:48,254 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:48,255 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:48,255 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:52:48,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:52:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:52:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:52:48,256 INFO L87 Difference]: Start difference. First operand 1275 states and 1897 transitions. Second operand 3 states. [2019-10-07 15:52:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:48,384 INFO L93 Difference]: Finished difference Result 2434 states and 3639 transitions. [2019-10-07 15:52:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:52:48,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-07 15:52:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:48,396 INFO L225 Difference]: With dead ends: 2434 [2019-10-07 15:52:48,396 INFO L226 Difference]: Without dead ends: 1876 [2019-10-07 15:52:48,398 INFO L606 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-07 15:52:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-10-07 15:52:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1854. [2019-10-07 15:52:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-10-07 15:52:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2754 transitions. [2019-10-07 15:52:48,506 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2754 transitions. Word has length 128 [2019-10-07 15:52:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:48,506 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 2754 transitions. [2019-10-07 15:52:48,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:52:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2754 transitions. [2019-10-07 15:52:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-07 15:52:48,509 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:48,509 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:48,509 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash -333562049, now seen corresponding path program 1 times [2019-10-07 15:52:48,510 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:48,510 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:48,510 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:48,510 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:48,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:48,911 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-07 15:52:48,912 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:48,912 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:48,912 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:52:48,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:52:48,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:52:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:48,913 INFO L87 Difference]: Start difference. First operand 1854 states and 2754 transitions. Second operand 5 states. [2019-10-07 15:52:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:49,254 INFO L93 Difference]: Finished difference Result 5295 states and 7912 transitions. [2019-10-07 15:52:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:52:49,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-07 15:52:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:49,272 INFO L225 Difference]: With dead ends: 5295 [2019-10-07 15:52:49,273 INFO L226 Difference]: Without dead ends: 3548 [2019-10-07 15:52:49,277 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-10-07 15:52:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3526. [2019-10-07 15:52:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2019-10-07 15:52:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5217 transitions. [2019-10-07 15:52:49,487 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5217 transitions. Word has length 128 [2019-10-07 15:52:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:49,488 INFO L462 AbstractCegarLoop]: Abstraction has 3526 states and 5217 transitions. [2019-10-07 15:52:49,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:52:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5217 transitions. [2019-10-07 15:52:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-07 15:52:49,491 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:49,492 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:49,492 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:49,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1525850627, now seen corresponding path program 1 times [2019-10-07 15:52:49,493 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:49,493 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:49,493 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:49,493 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:49,581 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-07 15:52:49,582 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:49,582 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:49,582 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:52:49,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:52:49,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:52:49,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:52:49,584 INFO L87 Difference]: Start difference. First operand 3526 states and 5217 transitions. Second operand 3 states. [2019-10-07 15:52:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:50,034 INFO L93 Difference]: Finished difference Result 9122 states and 13744 transitions. [2019-10-07 15:52:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:52:50,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-07 15:52:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:50,061 INFO L225 Difference]: With dead ends: 9122 [2019-10-07 15:52:50,061 INFO L226 Difference]: Without dead ends: 5742 [2019-10-07 15:52:50,070 INFO L606 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-07 15:52:50,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-10-07 15:52:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5558. [2019-10-07 15:52:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-07 15:52:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8399 transitions. [2019-10-07 15:52:50,415 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8399 transitions. Word has length 130 [2019-10-07 15:52:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:50,415 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8399 transitions. [2019-10-07 15:52:50,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:52:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8399 transitions. [2019-10-07 15:52:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-07 15:52:50,500 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:50,501 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:50,501 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2057522103, now seen corresponding path program 1 times [2019-10-07 15:52:50,502 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:50,502 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:50,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:50,502 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:50,678 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-07 15:52:50,678 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:50,678 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:50,678 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:52:50,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:52:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:52:50,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:50,680 INFO L87 Difference]: Start difference. First operand 5558 states and 8399 transitions. Second operand 5 states. [2019-10-07 15:52:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:51,169 INFO L93 Difference]: Finished difference Result 10982 states and 16629 transitions. [2019-10-07 15:52:51,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:52:51,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-07 15:52:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:51,196 INFO L225 Difference]: With dead ends: 10982 [2019-10-07 15:52:51,196 INFO L226 Difference]: Without dead ends: 5558 [2019-10-07 15:52:51,210 INFO L606 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-07 15:52:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2019-10-07 15:52:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 5558. [2019-10-07 15:52:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-07 15:52:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8279 transitions. [2019-10-07 15:52:51,697 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8279 transitions. Word has length 133 [2019-10-07 15:52:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:51,698 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8279 transitions. [2019-10-07 15:52:51,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:52:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8279 transitions. [2019-10-07 15:52:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-07 15:52:51,701 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:51,702 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:51,702 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:51,703 INFO L82 PathProgramCache]: Analyzing trace with hash 100294532, now seen corresponding path program 1 times [2019-10-07 15:52:51,703 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:51,703 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:51,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:51,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:51,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:52,080 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-07 15:52:52,081 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:52,081 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:52,081 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:52:52,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:52:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:52:52,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:52,083 INFO L87 Difference]: Start difference. First operand 5558 states and 8279 transitions. Second operand 5 states. [2019-10-07 15:52:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:52,471 INFO L93 Difference]: Finished difference Result 6461 states and 9604 transitions. [2019-10-07 15:52:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:52:52,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-07 15:52:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:52,494 INFO L225 Difference]: With dead ends: 6461 [2019-10-07 15:52:52,495 INFO L226 Difference]: Without dead ends: 4735 [2019-10-07 15:52:52,499 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-10-07 15:52:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 4696. [2019-10-07 15:52:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2019-10-07 15:52:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 7003 transitions. [2019-10-07 15:52:52,782 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 7003 transitions. Word has length 133 [2019-10-07 15:52:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:52,783 INFO L462 AbstractCegarLoop]: Abstraction has 4696 states and 7003 transitions. [2019-10-07 15:52:52,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:52:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 7003 transitions. [2019-10-07 15:52:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-07 15:52:52,786 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:52,786 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:52,787 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1643558573, now seen corresponding path program 1 times [2019-10-07 15:52:52,787 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:52,788 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:52,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:52,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:53,078 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-07 15:52:53,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:53,078 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:53,079 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:52:53,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:52:53,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:52:53,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:53,080 INFO L87 Difference]: Start difference. First operand 4696 states and 7003 transitions. Second operand 5 states. [2019-10-07 15:52:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:53,706 INFO L93 Difference]: Finished difference Result 13582 states and 20369 transitions. [2019-10-07 15:52:53,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:52:53,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-07 15:52:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:53,731 INFO L225 Difference]: With dead ends: 13582 [2019-10-07 15:52:53,731 INFO L226 Difference]: Without dead ends: 9053 [2019-10-07 15:52:53,741 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2019-10-07 15:52:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 9031. [2019-10-07 15:52:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9031 states. [2019-10-07 15:52:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 13457 transitions. [2019-10-07 15:52:54,246 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 13457 transitions. Word has length 133 [2019-10-07 15:52:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:54,247 INFO L462 AbstractCegarLoop]: Abstraction has 9031 states and 13457 transitions. [2019-10-07 15:52:54,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:52:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 13457 transitions. [2019-10-07 15:52:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:52:54,252 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:54,252 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:54,252 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash -640634061, now seen corresponding path program 1 times [2019-10-07 15:52:54,253 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:54,253 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:54,253 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:54,253 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:54,426 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-07 15:52:54,426 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:54,427 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:54,427 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:52:54,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:52:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:52:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:52:54,428 INFO L87 Difference]: Start difference. First operand 9031 states and 13457 transitions. Second operand 3 states. [2019-10-07 15:52:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:55,142 INFO L93 Difference]: Finished difference Result 16931 states and 25211 transitions. [2019-10-07 15:52:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:52:55,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-10-07 15:52:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:55,174 INFO L225 Difference]: With dead ends: 16931 [2019-10-07 15:52:55,175 INFO L226 Difference]: Without dead ends: 12631 [2019-10-07 15:52:55,187 INFO L606 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-07 15:52:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12631 states. [2019-10-07 15:52:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12631 to 12609. [2019-10-07 15:52:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12609 states. [2019-10-07 15:52:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 18567 transitions. [2019-10-07 15:52:56,060 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 18567 transitions. Word has length 138 [2019-10-07 15:52:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:56,061 INFO L462 AbstractCegarLoop]: Abstraction has 12609 states and 18567 transitions. [2019-10-07 15:52:56,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:52:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 18567 transitions. [2019-10-07 15:52:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:52:56,068 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:56,068 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:56,069 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1935605800, now seen corresponding path program 1 times [2019-10-07 15:52:56,069 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:56,069 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:56,070 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:56,070 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:56,491 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-07 15:52:56,491 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:56,492 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:52:56,492 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:52:56,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:52:56,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:52:56,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:56,493 INFO L87 Difference]: Start difference. First operand 12609 states and 18567 transitions. Second operand 5 states. [2019-10-07 15:52:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:52:57,302 INFO L93 Difference]: Finished difference Result 20979 states and 31100 transitions. [2019-10-07 15:52:57,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:52:57,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-07 15:52:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:52:57,333 INFO L225 Difference]: With dead ends: 20979 [2019-10-07 15:52:57,333 INFO L226 Difference]: Without dead ends: 12688 [2019-10-07 15:52:57,350 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:52:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12688 states. [2019-10-07 15:52:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12688 to 12612. [2019-10-07 15:52:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12612 states. [2019-10-07 15:52:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12612 states to 12612 states and 18570 transitions. [2019-10-07 15:52:58,572 INFO L78 Accepts]: Start accepts. Automaton has 12612 states and 18570 transitions. Word has length 138 [2019-10-07 15:52:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:52:58,572 INFO L462 AbstractCegarLoop]: Abstraction has 12612 states and 18570 transitions. [2019-10-07 15:52:58,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:52:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 12612 states and 18570 transitions. [2019-10-07 15:52:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:52:58,577 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:52:58,577 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:52:58,578 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:52:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:52:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 407147818, now seen corresponding path program 1 times [2019-10-07 15:52:58,578 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:52:58,578 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:52:58,578 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:58,579 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:52:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:52:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:52:59,964 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-07 15:53:00,134 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-07 15:53:00,315 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-07 15:53:00,527 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-07 15:53:00,690 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-07 15:53:00,848 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-07 15:53:01,032 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-07 15:53:01,187 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-07 15:53:01,374 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-07 15:53:01,523 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-07 15:53:01,829 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-07 15:53:02,451 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-07 15:53:02,965 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-10-07 15:53:03,203 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-10-07 15:53:03,421 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-10-07 15:53:04,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-07 15:53:04,047 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:53:04,048 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:53:04,048 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-10-07 15:53:04,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-07 15:53:04,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-07 15:53:04,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 15:53:04,049 INFO L87 Difference]: Start difference. First operand 12612 states and 18570 transitions. Second operand 34 states. [2019-10-07 15:53:04,595 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 87 [2019-10-07 15:53:05,139 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-10-07 15:53:05,829 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-07 15:53:06,011 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-07 15:53:06,198 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-07 15:53:06,511 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-10-07 15:53:06,828 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-10-07 15:53:07,197 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-10-07 15:53:07,754 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-10-07 15:53:08,341 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-10-07 15:53:08,941 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-10-07 15:53:09,582 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2019-10-07 15:53:10,462 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2019-10-07 15:53:11,067 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2019-10-07 15:53:11,724 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 83 [2019-10-07 15:53:12,251 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 81 [2019-10-07 15:53:13,094 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 84 [2019-10-07 15:53:13,842 WARN L191 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 93 [2019-10-07 15:53:14,577 WARN L191 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 98 [2019-10-07 15:53:15,325 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 102 [2019-10-07 15:53:15,880 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2019-10-07 15:53:16,372 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-10-07 15:53:17,244 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-07 15:53:20,207 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-10-07 15:53:20,663 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-10-07 15:53:21,875 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-10-07 15:53:22,565 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-10-07 15:53:24,502 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-10-07 15:53:25,209 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-07 15:53:26,128 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2019-10-07 15:53:27,840 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 84 [2019-10-07 15:53:28,461 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-10-07 15:53:29,339 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 89 [2019-10-07 15:53:30,365 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 85 [2019-10-07 15:53:31,349 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2019-10-07 15:53:32,557 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 83 [2019-10-07 15:53:33,647 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 76 [2019-10-07 15:53:34,856 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-10-07 15:53:35,773 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 82 [2019-10-07 15:53:37,334 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-10-07 15:53:37,533 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-10-07 15:53:38,357 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 65 [2019-10-07 15:53:39,022 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 81 [2019-10-07 15:53:39,467 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2019-10-07 15:53:40,271 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 86 [2019-10-07 15:53:41,121 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2019-10-07 15:53:41,911 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 87 [2019-10-07 15:53:43,032 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-10-07 15:53:43,674 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2019-10-07 15:53:44,062 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2019-10-07 15:53:44,256 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-07 15:53:45,051 WARN L191 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 69 [2019-10-07 15:53:45,496 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2019-10-07 15:53:46,153 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 91 [2019-10-07 15:53:46,686 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 83 [2019-10-07 15:53:47,005 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-10-07 15:53:47,377 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-10-07 15:53:47,842 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2019-10-07 15:53:48,416 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 87 [2019-10-07 15:53:48,895 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-10-07 15:53:49,075 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-10-07 15:53:49,468 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2019-10-07 15:53:49,973 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2019-10-07 15:53:50,340 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-10-07 15:53:50,623 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-10-07 15:53:50,917 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-07 15:53:51,392 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2019-10-07 15:53:51,771 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-10-07 15:53:52,026 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-10-07 15:53:52,329 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2019-10-07 15:53:52,508 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-10-07 15:53:52,909 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2019-10-07 15:53:53,368 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-10-07 15:53:53,920 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-10-07 15:53:54,422 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 83 [2019-10-07 15:53:54,738 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-10-07 15:53:55,363 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 92 [2019-10-07 15:53:55,758 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 77 [2019-10-07 15:53:56,291 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 88 [2019-10-07 15:53:56,626 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2019-10-07 15:53:57,032 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 69 [2019-10-07 15:53:57,536 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 87 [2019-10-07 15:53:57,795 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-10-07 15:53:58,239 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2019-10-07 15:53:58,598 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 79 [2019-10-07 15:53:59,071 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 83 [2019-10-07 15:53:59,370 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-10-07 15:53:59,852 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-10-07 15:54:00,309 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 88 [2019-10-07 15:54:00,781 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-10-07 15:54:01,209 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2019-10-07 15:54:01,704 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 84 [2019-10-07 15:54:02,023 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-10-07 15:54:02,253 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-10-07 15:54:02,583 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-10-07 15:54:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:02,627 INFO L93 Difference]: Finished difference Result 92759 states and 138627 transitions. [2019-10-07 15:54:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-07 15:54:02,628 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 138 [2019-10-07 15:54:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:02,786 INFO L225 Difference]: With dead ends: 92759 [2019-10-07 15:54:02,787 INFO L226 Difference]: Without dead ends: 88570 [2019-10-07 15:54:02,816 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6106 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=3692, Invalid=16330, Unknown=0, NotChecked=0, Total=20022 [2019-10-07 15:54:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88570 states. [2019-10-07 15:54:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88570 to 16949. [2019-10-07 15:54:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16949 states. [2019-10-07 15:54:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16949 states to 16949 states and 25051 transitions. [2019-10-07 15:54:05,406 INFO L78 Accepts]: Start accepts. Automaton has 16949 states and 25051 transitions. Word has length 138 [2019-10-07 15:54:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:05,406 INFO L462 AbstractCegarLoop]: Abstraction has 16949 states and 25051 transitions. [2019-10-07 15:54:05,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-07 15:54:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 16949 states and 25051 transitions. [2019-10-07 15:54:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:54:05,412 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:05,412 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:05,412 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:05,413 INFO L82 PathProgramCache]: Analyzing trace with hash 25952941, now seen corresponding path program 1 times [2019-10-07 15:54:05,413 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:05,413 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:05,413 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:05,413 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:05,985 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-07 15:54:05,986 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:05,986 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:05,986 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 15:54:05,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 15:54:05,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 15:54:05,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-10-07 15:54:05,987 INFO L87 Difference]: Start difference. First operand 16949 states and 25051 transitions. Second operand 13 states. [2019-10-07 15:54:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:16,695 INFO L93 Difference]: Finished difference Result 74564 states and 112682 transitions. [2019-10-07 15:54:16,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 15:54:16,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-10-07 15:54:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:16,773 INFO L225 Difference]: With dead ends: 74564 [2019-10-07 15:54:16,773 INFO L226 Difference]: Without dead ends: 63921 [2019-10-07 15:54:16,800 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-10-07 15:54:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63921 states. [2019-10-07 15:54:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63921 to 35999. [2019-10-07 15:54:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35999 states. [2019-10-07 15:54:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35999 states to 35999 states and 53780 transitions. [2019-10-07 15:54:21,703 INFO L78 Accepts]: Start accepts. Automaton has 35999 states and 53780 transitions. Word has length 138 [2019-10-07 15:54:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:21,703 INFO L462 AbstractCegarLoop]: Abstraction has 35999 states and 53780 transitions. [2019-10-07 15:54:21,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 15:54:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 35999 states and 53780 transitions. [2019-10-07 15:54:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:54:21,707 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:21,708 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:21,708 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 175883930, now seen corresponding path program 1 times [2019-10-07 15:54:21,709 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:21,709 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,709 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,709 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:22,804 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-07 15:54:22,972 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-07 15:54:23,146 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-07 15:54:23,690 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-10-07 15:54:23,846 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-10-07 15:54:24,127 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2019-10-07 15:54:24,410 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-07 15:54:24,642 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-07 15:54:24,846 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-07 15:54:25,063 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-07 15:54:26,469 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-07 15:54:26,469 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,469 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:26,469 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-10-07 15:54:26,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-07 15:54:26,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-07 15:54:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2019-10-07 15:54:26,470 INFO L87 Difference]: Start difference. First operand 35999 states and 53780 transitions. Second operand 32 states. [2019-10-07 15:54:26,708 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-07 15:54:27,610 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-10-07 15:54:27,881 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-07 15:54:28,304 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-10-07 15:54:28,682 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-10-07 15:54:29,113 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-10-07 15:54:29,548 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-07 15:54:30,182 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2019-10-07 15:54:30,664 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-10-07 15:54:31,393 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-10-07 15:54:31,943 WARN L191 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2019-10-07 15:54:32,436 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2019-10-07 15:54:33,378 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 101 [2019-10-07 15:54:34,102 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 116 [2019-10-07 15:54:34,895 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 125 [2019-10-07 15:54:35,662 WARN L191 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 117 [2019-10-07 15:54:36,094 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-10-07 15:54:36,538 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-07 15:54:37,244 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-07 15:54:39,730 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-10-07 15:54:40,032 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-07 15:54:43,511 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-07 15:54:44,184 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-10-07 15:54:44,832 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-07 15:54:46,149 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-07 15:54:49,830 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-07 15:54:50,058 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-10-07 15:54:50,746 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-10-07 15:54:51,049 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-07 15:54:52,020 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-07 15:54:54,004 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-10-07 15:54:54,901 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-10-07 15:54:55,414 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-10-07 15:54:55,965 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-07 15:54:57,010 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-07 15:54:57,597 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-10-07 15:54:58,218 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-10-07 15:54:58,897 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-07 15:54:59,118 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-10-07 15:54:59,606 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-07 15:55:00,559 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-10-07 15:55:01,628 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-10-07 15:55:02,179 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-07 15:55:02,554 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-10-07 15:55:03,963 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-07 15:55:04,310 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-07 15:55:04,680 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 51 [2019-10-07 15:55:05,360 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-10-07 15:55:06,065 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-10-07 15:55:06,438 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-07 15:55:06,818 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-10-07 15:55:07,257 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-10-07 15:55:07,621 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-10-07 15:55:07,934 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-10-07 15:55:08,312 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-10-07 15:55:08,789 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-10-07 15:55:09,186 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-07 15:55:09,721 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-10-07 15:55:10,076 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-10-07 15:55:10,628 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-10-07 15:55:11,344 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2019-10-07 15:55:11,828 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-10-07 15:55:12,375 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-07 15:55:12,651 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-07 15:55:13,243 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-10-07 15:55:13,781 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-07 15:55:14,047 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-10-07 15:55:14,424 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2019-10-07 15:55:14,743 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-10-07 15:55:15,139 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-10-07 15:55:15,420 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-10-07 15:55:15,932 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2019-10-07 15:55:16,256 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-10-07 15:55:16,966 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-10-07 15:55:17,478 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-10-07 15:55:17,907 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-10-07 15:55:18,143 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-07 15:55:18,367 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2019-10-07 15:55:18,940 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-10-07 15:55:19,454 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-10-07 15:55:19,655 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2019-10-07 15:55:20,115 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-10-07 15:55:20,469 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-10-07 15:55:20,939 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-10-07 15:55:21,245 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 55 [2019-10-07 15:55:21,691 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-10-07 15:55:21,935 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-07 15:55:22,402 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-10-07 15:55:22,728 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-10-07 15:55:23,370 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-10-07 15:55:24,052 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2019-10-07 15:55:24,423 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2019-10-07 15:55:24,882 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 64 [2019-10-07 15:55:25,379 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2019-10-07 15:55:25,891 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2019-10-07 15:55:26,447 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 69 [2019-10-07 15:55:27,302 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-10-07 15:55:27,692 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-10-07 15:55:28,235 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 61 [2019-10-07 15:55:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:55:28,508 INFO L93 Difference]: Finished difference Result 89209 states and 133041 transitions. [2019-10-07 15:55:28,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-10-07 15:55:28,509 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 138 [2019-10-07 15:55:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:55:28,602 INFO L225 Difference]: With dead ends: 89209 [2019-10-07 15:55:28,603 INFO L226 Difference]: Without dead ends: 75148 [2019-10-07 15:55:28,633 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7702 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=4187, Invalid=19993, Unknown=0, NotChecked=0, Total=24180 [2019-10-07 15:55:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75148 states. [2019-10-07 15:55:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75148 to 43675. [2019-10-07 15:55:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43675 states. [2019-10-07 15:55:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43675 states to 43675 states and 65319 transitions. [2019-10-07 15:55:35,007 INFO L78 Accepts]: Start accepts. Automaton has 43675 states and 65319 transitions. Word has length 138 [2019-10-07 15:55:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:55:35,007 INFO L462 AbstractCegarLoop]: Abstraction has 43675 states and 65319 transitions. [2019-10-07 15:55:35,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-07 15:55:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 43675 states and 65319 transitions. [2019-10-07 15:55:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:55:35,012 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:55:35,012 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:55:35,012 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:55:35,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:55:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1697766843, now seen corresponding path program 1 times [2019-10-07 15:55:35,013 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:55:35,013 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:55:35,013 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:55:35,013 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:55:35,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:55:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:55:35,115 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-07 15:55:35,115 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:55:35,117 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:55:35,117 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:55:35,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:55:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:55:35,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:55:35,119 INFO L87 Difference]: Start difference. First operand 43675 states and 65319 transitions. Second operand 5 states. [2019-10-07 15:55:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:55:42,114 INFO L93 Difference]: Finished difference Result 84730 states and 126877 transitions. [2019-10-07 15:55:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:55:42,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-07 15:55:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:55:42,167 INFO L225 Difference]: With dead ends: 84730 [2019-10-07 15:55:42,167 INFO L226 Difference]: Without dead ends: 43619 [2019-10-07 15:55:42,195 INFO L606 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-07 15:55:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43619 states. [2019-10-07 15:55:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43619 to 43619. [2019-10-07 15:55:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43619 states. [2019-10-07 15:55:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43619 states to 43619 states and 64799 transitions. [2019-10-07 15:55:49,792 INFO L78 Accepts]: Start accepts. Automaton has 43619 states and 64799 transitions. Word has length 138 [2019-10-07 15:55:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:55:49,793 INFO L462 AbstractCegarLoop]: Abstraction has 43619 states and 64799 transitions. [2019-10-07 15:55:49,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:55:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 43619 states and 64799 transitions. [2019-10-07 15:55:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:55:49,797 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:55:49,797 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:55:49,797 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:55:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:55:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1586469530, now seen corresponding path program 1 times [2019-10-07 15:55:49,798 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:55:49,799 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:55:49,800 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:55:49,800 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:55:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:55:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:55:50,914 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-07 15:55:51,126 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-07 15:55:51,294 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-07 15:55:51,447 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-07 15:55:51,610 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-10-07 15:55:51,801 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-10-07 15:55:51,985 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-10-07 15:55:52,172 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-10-07 15:55:52,744 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 92 [2019-10-07 15:55:53,040 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-10-07 15:55:53,344 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 93 [2019-10-07 15:55:53,737 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 99 [2019-10-07 15:55:54,083 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2019-10-07 15:55:54,410 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2019-10-07 15:55:54,736 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-10-07 15:55:55,055 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-10-07 15:55:55,365 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-10-07 15:55:55,622 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-10-07 15:55:55,874 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-10-07 15:55:56,144 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-10-07 15:55:56,434 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-10-07 15:55:56,744 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-10-07 15:55:57,062 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 87 [2019-10-07 15:55:57,376 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-10-07 15:55:57,711 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-10-07 15:55:57,926 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-10-07 15:55:58,133 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-10-07 15:55:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:55:58,857 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:55:58,858 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:55:58,858 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-10-07 15:55:58,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 15:55:58,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 15:55:58,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 15:55:58,859 INFO L87 Difference]: Start difference. First operand 43619 states and 64799 transitions. Second operand 35 states. [2019-10-07 15:55:59,593 WARN L191 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 101 [2019-10-07 15:56:00,277 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 98 [2019-10-07 15:56:01,047 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-07 15:56:01,348 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-07 15:56:01,686 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-07 15:56:02,012 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-10-07 15:56:02,367 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-10-07 15:56:02,818 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 83 [2019-10-07 15:56:03,296 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 75 [2019-10-07 15:56:03,731 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-10-07 15:56:04,498 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 86 [2019-10-07 15:56:05,703 WARN L191 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 102 [2019-10-07 15:56:06,814 WARN L191 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 121 [2019-10-07 15:56:07,912 WARN L191 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 132 [2019-10-07 15:56:08,976 WARN L191 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 125 [2019-10-07 15:56:09,912 WARN L191 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 117 [2019-10-07 15:56:11,050 WARN L191 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 115 [2019-10-07 15:56:11,927 WARN L191 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 105 [2019-10-07 15:56:13,079 WARN L191 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 126 [2019-10-07 15:56:14,372 WARN L191 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 136 [2019-10-07 15:56:14,977 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 92 [2019-10-07 15:56:15,584 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-10-07 15:56:17,241 WARN L191 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 152 [2019-10-07 15:56:18,236 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 99 [2019-10-07 15:56:19,483 WARN L191 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 138 [2019-10-07 15:56:20,043 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-10-07 15:56:22,547 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2019-10-07 15:56:23,312 WARN L191 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 121 [2019-10-07 15:56:24,176 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 110 [2019-10-07 15:56:24,947 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 93 [2019-10-07 15:56:25,354 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-10-07 15:56:25,815 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2019-10-07 15:56:28,141 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 60 [2019-10-07 15:56:29,122 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 43 [2019-10-07 15:56:29,895 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 73 [2019-10-07 15:56:32,211 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 65 [2019-10-07 15:56:34,219 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-10-07 15:56:38,197 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 37 [2019-10-07 15:57:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:57:12,720 INFO L93 Difference]: Finished difference Result 220160 states and 331579 transitions. [2019-10-07 15:57:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-07 15:57:12,720 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2019-10-07 15:57:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:57:13,016 INFO L225 Difference]: With dead ends: 220160 [2019-10-07 15:57:13,016 INFO L226 Difference]: Without dead ends: 209932 [2019-10-07 15:57:13,068 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=1084, Invalid=5888, Unknown=0, NotChecked=0, Total=6972 [2019-10-07 15:57:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209932 states. [2019-10-07 15:57:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209932 to 71896. [2019-10-07 15:57:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71896 states. [2019-10-07 15:57:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71896 states to 71896 states and 108148 transitions. [2019-10-07 15:57:30,503 INFO L78 Accepts]: Start accepts. Automaton has 71896 states and 108148 transitions. Word has length 138 [2019-10-07 15:57:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:57:30,503 INFO L462 AbstractCegarLoop]: Abstraction has 71896 states and 108148 transitions. [2019-10-07 15:57:30,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 15:57:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 71896 states and 108148 transitions. [2019-10-07 15:57:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:57:30,506 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:57:30,507 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:57:30,507 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:57:30,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:57:30,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1205274653, now seen corresponding path program 1 times [2019-10-07 15:57:30,507 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:57:30,508 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:57:30,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:57:30,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:57:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:57:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:57:31,013 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-07 15:57:31,013 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:57:31,014 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:57:31,014 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 15:57:31,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 15:57:31,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 15:57:31,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-10-07 15:57:31,015 INFO L87 Difference]: Start difference. First operand 71896 states and 108148 transitions. Second operand 13 states. [2019-10-07 15:58:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:58:33,866 INFO L93 Difference]: Finished difference Result 299647 states and 452664 transitions. [2019-10-07 15:58:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 15:58:33,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-10-07 15:58:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:58:34,342 INFO L225 Difference]: With dead ends: 299647 [2019-10-07 15:58:34,342 INFO L226 Difference]: Without dead ends: 277502 [2019-10-07 15:58:34,406 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=541, Unknown=0, NotChecked=0, Total=812 [2019-10-07 15:58:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277502 states. [2019-10-07 15:59:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277502 to 149191. [2019-10-07 15:59:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149191 states. [2019-10-07 15:59:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149191 states to 149191 states and 226910 transitions. [2019-10-07 15:59:10,471 INFO L78 Accepts]: Start accepts. Automaton has 149191 states and 226910 transitions. Word has length 138 [2019-10-07 15:59:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:59:10,471 INFO L462 AbstractCegarLoop]: Abstraction has 149191 states and 226910 transitions. [2019-10-07 15:59:10,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 15:59:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 149191 states and 226910 transitions. [2019-10-07 15:59:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:59:10,475 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:59:10,476 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:59:10,476 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:59:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:59:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1355205642, now seen corresponding path program 1 times [2019-10-07 15:59:10,476 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:59:10,476 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:59:10,476 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:59:10,477 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:59:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:59:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:59:11,534 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-10-07 15:59:12,223 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-07 15:59:12,358 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-07 15:59:12,512 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-07 15:59:12,668 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-07 15:59:13,331 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-10-07 15:59:14,488 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-07 15:59:14,488 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:59:14,488 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:59:14,488 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-10-07 15:59:14,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-07 15:59:14,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-07 15:59:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-10-07 15:59:14,490 INFO L87 Difference]: Start difference. First operand 149191 states and 226910 transitions. Second operand 31 states. [2019-10-07 15:59:14,723 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-10-07 15:59:15,817 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-07 15:59:16,111 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-10-07 15:59:16,442 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-10-07 15:59:16,851 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-10-07 15:59:17,265 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2019-10-07 15:59:17,865 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 86 [2019-10-07 15:59:18,548 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 102 [2019-10-07 15:59:19,267 WARN L191 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 117 [2019-10-07 15:59:19,965 WARN L191 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 121 [2019-10-07 15:59:20,686 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 131 [2019-10-07 15:59:21,328 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 119 [2019-10-07 15:59:22,289 WARN L191 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-10-07 15:59:23,152 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 128 [2019-10-07 15:59:23,538 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2019-10-07 15:59:23,940 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-07 16:00:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 16:00:04,841 INFO L93 Difference]: Finished difference Result 199513 states and 303960 transitions. [2019-10-07 16:00:04,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-07 16:00:04,842 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 138 [2019-10-07 16:00:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 16:00:05,052 INFO L225 Difference]: With dead ends: 199513 [2019-10-07 16:00:05,052 INFO L226 Difference]: Without dead ends: 157173 [2019-10-07 16:00:05,096 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=602, Invalid=2938, Unknown=0, NotChecked=0, Total=3540 [2019-10-07 16:00:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157173 states. [2019-10-07 16:00:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157173 to 154044. [2019-10-07 16:00:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154044 states. [2019-10-07 16:00:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154044 states to 154044 states and 234275 transitions. [2019-10-07 16:00:38,597 INFO L78 Accepts]: Start accepts. Automaton has 154044 states and 234275 transitions. Word has length 138 [2019-10-07 16:00:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 16:00:38,597 INFO L462 AbstractCegarLoop]: Abstraction has 154044 states and 234275 transitions. [2019-10-07 16:00:38,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-07 16:00:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 154044 states and 234275 transitions. [2019-10-07 16:00:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 16:00:38,601 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 16:00:38,601 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 16:00:38,602 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 16:00:38,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 16:00:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash -93762948, now seen corresponding path program 1 times [2019-10-07 16:00:38,602 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 16:00:38,602 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:00:38,602 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:00:38,603 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:00:38,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 16:00:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 16:00:38,964 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-07 16:00:38,965 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:00:38,965 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 16:00:38,965 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 16:00:38,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 16:00:38,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 16:00:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 16:00:38,967 INFO L87 Difference]: Start difference. First operand 154044 states and 234275 transitions. Second operand 5 states. [2019-10-07 16:01:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 16:01:12,594 INFO L93 Difference]: Finished difference Result 192954 states and 293089 transitions. [2019-10-07 16:01:12,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 16:01:12,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-07 16:01:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 16:01:12,793 INFO L225 Difference]: With dead ends: 192954 [2019-10-07 16:01:12,793 INFO L226 Difference]: Without dead ends: 134873 [2019-10-07 16:01:12,844 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-07 16:01:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134873 states. [2019-10-07 16:01:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134873 to 134847. [2019-10-07 16:01:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134847 states. [2019-10-07 16:01:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134847 states to 134847 states and 204769 transitions. [2019-10-07 16:01:46,608 INFO L78 Accepts]: Start accepts. Automaton has 134847 states and 204769 transitions. Word has length 138 [2019-10-07 16:01:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 16:01:46,608 INFO L462 AbstractCegarLoop]: Abstraction has 134847 states and 204769 transitions. [2019-10-07 16:01:46,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 16:01:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 134847 states and 204769 transitions. [2019-10-07 16:01:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-07 16:01:46,612 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 16:01:46,612 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 16:01:46,613 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 16:01:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 16:01:46,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1622921872, now seen corresponding path program 1 times [2019-10-07 16:01:46,613 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 16:01:46,613 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:01:46,613 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:01:46,614 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:01:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 16:01:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 16:01:46,679 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-07 16:01:46,680 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:01:46,680 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 16:01:46,680 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 16:01:46,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 16:01:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 16:01:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 16:01:46,681 INFO L87 Difference]: Start difference. First operand 134847 states and 204769 transitions. Second operand 3 states. [2019-10-07 16:02:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 16:02:23,856 INFO L93 Difference]: Finished difference Result 247372 states and 372751 transitions. [2019-10-07 16:02:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 16:02:23,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-07 16:02:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 16:02:24,103 INFO L225 Difference]: With dead ends: 247372 [2019-10-07 16:02:24,103 INFO L226 Difference]: Without dead ends: 152587 [2019-10-07 16:02:24,178 INFO L606 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-07 16:02:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152587 states. [2019-10-07 16:02:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152587 to 134363. [2019-10-07 16:02:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134363 states. [2019-10-07 16:02:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134363 states to 134363 states and 203879 transitions. [2019-10-07 16:02:58,901 INFO L78 Accepts]: Start accepts. Automaton has 134363 states and 203879 transitions. Word has length 139 [2019-10-07 16:02:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 16:02:58,901 INFO L462 AbstractCegarLoop]: Abstraction has 134363 states and 203879 transitions. [2019-10-07 16:02:58,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 16:02:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 134363 states and 203879 transitions. [2019-10-07 16:02:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-07 16:02:58,905 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 16:02:58,905 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 16:02:58,906 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 16:02:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 16:02:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash 958249224, now seen corresponding path program 1 times [2019-10-07 16:02:58,906 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 16:02:58,906 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:02:58,906 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:02:58,906 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:02:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 16:02:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 16:02:58,995 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-07 16:02:58,996 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:02:58,996 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 16:02:58,996 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 16:02:58,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 16:02:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 16:02:58,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 16:02:58,997 INFO L87 Difference]: Start difference. First operand 134363 states and 203879 transitions. Second operand 3 states. [2019-10-07 16:03:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 16:03:31,829 INFO L93 Difference]: Finished difference Result 268989 states and 407394 transitions. [2019-10-07 16:03:31,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 16:03:31,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-07 16:03:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 16:03:32,024 INFO L225 Difference]: With dead ends: 268989 [2019-10-07 16:03:32,025 INFO L226 Difference]: Without dead ends: 136848 [2019-10-07 16:03:32,104 INFO L606 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-07 16:03:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136848 states. [2019-10-07 16:04:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136848 to 133178. [2019-10-07 16:04:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133178 states. [2019-10-07 16:04:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133178 states to 133178 states and 201616 transitions. [2019-10-07 16:04:05,713 INFO L78 Accepts]: Start accepts. Automaton has 133178 states and 201616 transitions. Word has length 139 [2019-10-07 16:04:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 16:04:05,713 INFO L462 AbstractCegarLoop]: Abstraction has 133178 states and 201616 transitions. [2019-10-07 16:04:05,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 16:04:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 133178 states and 201616 transitions. [2019-10-07 16:04:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-07 16:04:05,716 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 16:04:05,717 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 16:04:05,717 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 16:04:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 16:04:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash -770002137, now seen corresponding path program 1 times [2019-10-07 16:04:05,717 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 16:04:05,717 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:04:05,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:04:05,718 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:04:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 16:04:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 16:04:05,779 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-07 16:04:05,779 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:04:05,779 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 16:04:05,780 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 16:04:05,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 16:04:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 16:04:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 16:04:05,782 INFO L87 Difference]: Start difference. First operand 133178 states and 201616 transitions. Second operand 3 states. [2019-10-07 16:04:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 16:04:39,858 INFO L93 Difference]: Finished difference Result 231902 states and 348760 transitions. [2019-10-07 16:04:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 16:04:39,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-07 16:04:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 16:04:40,054 INFO L225 Difference]: With dead ends: 231902 [2019-10-07 16:04:40,055 INFO L226 Difference]: Without dead ends: 142378 [2019-10-07 16:04:40,121 INFO L606 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-07 16:04:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142378 states. [2019-10-07 16:05:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142378 to 132189. [2019-10-07 16:05:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132189 states. [2019-10-07 16:05:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132189 states to 132189 states and 199694 transitions. [2019-10-07 16:05:13,265 INFO L78 Accepts]: Start accepts. Automaton has 132189 states and 199694 transitions. Word has length 139 [2019-10-07 16:05:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 16:05:13,266 INFO L462 AbstractCegarLoop]: Abstraction has 132189 states and 199694 transitions. [2019-10-07 16:05:13,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 16:05:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 132189 states and 199694 transitions. [2019-10-07 16:05:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-07 16:05:13,269 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 16:05:13,269 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 16:05:13,269 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 16:05:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 16:05:13,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1777824315, now seen corresponding path program 1 times [2019-10-07 16:05:13,270 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 16:05:13,270 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:05:13,270 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:05:13,270 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 16:05:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 16:05:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 16:05:13,638 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-07 16:05:13,638 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 16:05:13,639 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 16:05:13,639 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 16:05:13,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 16:05:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 16:05:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 16:05:13,640 INFO L87 Difference]: Start difference. First operand 132189 states and 199694 transitions. Second operand 3 states. [2019-10-07 16:05:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 16:05:49,406 INFO L93 Difference]: Finished difference Result 230932 states and 347023 transitions. [2019-10-07 16:05:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 16:05:49,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-07 16:05:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 16:05:49,607 INFO L225 Difference]: With dead ends: 230932 [2019-10-07 16:05:49,607 INFO L226 Difference]: Without dead ends: 147707 [2019-10-07 16:05:49,665 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 16:05:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147707 states.