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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:38,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:38,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:38,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:38,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:38,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:38,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:38,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:38,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:38,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:38,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:38,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:38,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:38,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:38,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:38,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:38,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:38,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:38,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:38,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:38,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:38,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:38,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:38,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:38,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:38,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:38,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:38,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:38,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:38,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:38,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:38,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:38,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:38,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:38,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:38,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:38,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:38,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:38,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:38,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:38,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:38,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:38,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:38,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:38,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:38,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:38,993 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:38,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:38,993 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:38,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:38,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:38,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:38,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:38,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:38,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:38,994 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:38,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:38,995 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:38,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:38,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:38,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:38,995 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:38,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:38,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:38,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:38,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:38,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:38,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:38,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:38,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:38,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:39,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:39,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:39,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:39,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:39,282 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:39,282 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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:39,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0c0fe84/7b9dbfb698274c6da4afecea71ca2e57/FLAG9f38e5645 [2019-10-15 01:23:39,961 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:39,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:39,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0c0fe84/7b9dbfb698274c6da4afecea71ca2e57/FLAG9f38e5645 [2019-10-15 01:23:40,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c0c0fe84/7b9dbfb698274c6da4afecea71ca2e57 [2019-10-15 01:23:40,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:40,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:40,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:40,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:40,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:40,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:40" (1/1) ... [2019-10-15 01:23:40,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e9c6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:40, skipping insertion in model container [2019-10-15 01:23:40,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:40" (1/1) ... [2019-10-15 01:23:40,225 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:40,295 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:40,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:40,825 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:40,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:41,012 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:41,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41 WrapperNode [2019-10-15 01:23:41,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:41,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:41,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:41,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:41,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41" (1/1) ... [2019-10-15 01:23:41,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41" (1/1) ... [2019-10-15 01:23:41,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41" (1/1) ... [2019-10-15 01:23:41,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41" (1/1) ... [2019-10-15 01:23:41,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41" (1/1) ... [2019-10-15 01:23:41,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41" (1/1) ... [2019-10-15 01:23:41,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41" (1/1) ... [2019-10-15 01:23:41,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:41,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:41,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:41,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:41,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23: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-15 01:23:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:42,501 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:42,501 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:42,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:42 BoogieIcfgContainer [2019-10-15 01:23:42,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:42,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:42,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:42,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:42,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:40" (1/3) ... [2019-10-15 01:23:42,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f0a9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:42, skipping insertion in model container [2019-10-15 01:23:42,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:41" (2/3) ... [2019-10-15 01:23:42,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f0a9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:42, skipping insertion in model container [2019-10-15 01:23:42,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:42" (3/3) ... [2019-10-15 01:23:42,512 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:42,523 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:42,548 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-15 01:23:42,566 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-15 01:23:42,591 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:42,591 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:42,591 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:42,591 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:42,592 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:42,592 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:42,592 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:42,592 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2019-10-15 01:23:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:23:42,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:42,630 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:42,632 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:42,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:42,636 INFO L82 PathProgramCache]: Analyzing trace with hash -907914047, now seen corresponding path program 1 times [2019-10-15 01:23:42,643 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:42,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630221701] [2019-10-15 01:23:42,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:43,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630221701] [2019-10-15 01:23:43,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:43,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:43,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529672100] [2019-10-15 01:23:43,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:43,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:43,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:43,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:43,394 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 4 states. [2019-10-15 01:23:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:43,679 INFO L93 Difference]: Finished difference Result 789 states and 1385 transitions. [2019-10-15 01:23:43,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:43,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-15 01:23:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:43,716 INFO L225 Difference]: With dead ends: 789 [2019-10-15 01:23:43,717 INFO L226 Difference]: Without dead ends: 519 [2019-10-15 01:23:43,728 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-10-15 01:23:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 496. [2019-10-15 01:23:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-15 01:23:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 722 transitions. [2019-10-15 01:23:43,879 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 722 transitions. Word has length 102 [2019-10-15 01:23:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:43,880 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 722 transitions. [2019-10-15 01:23:43,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 722 transitions. [2019-10-15 01:23:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:23:43,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:43,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:43,894 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:43,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1093362695, now seen corresponding path program 1 times [2019-10-15 01:23:43,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:43,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134957710] [2019-10-15 01:23:43,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:44,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134957710] [2019-10-15 01:23:44,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:44,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:44,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894441532] [2019-10-15 01:23:44,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:44,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:44,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:44,070 INFO L87 Difference]: Start difference. First operand 496 states and 722 transitions. Second operand 3 states. [2019-10-15 01:23:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:44,131 INFO L93 Difference]: Finished difference Result 1442 states and 2096 transitions. [2019-10-15 01:23:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:44,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-15 01:23:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:44,138 INFO L225 Difference]: With dead ends: 1442 [2019-10-15 01:23:44,138 INFO L226 Difference]: Without dead ends: 978 [2019-10-15 01:23:44,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-15 01:23:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 498. [2019-10-15 01:23:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-15 01:23:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 724 transitions. [2019-10-15 01:23:44,171 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 724 transitions. Word has length 103 [2019-10-15 01:23:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:44,172 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 724 transitions. [2019-10-15 01:23:44,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 724 transitions. [2019-10-15 01:23:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:23:44,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:44,174 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:44,174 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:44,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:44,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1521321784, now seen corresponding path program 1 times [2019-10-15 01:23:44,175 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:44,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539108395] [2019-10-15 01:23:44,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:44,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539108395] [2019-10-15 01:23:44,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:44,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:44,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58354549] [2019-10-15 01:23:44,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:44,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:44,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:44,284 INFO L87 Difference]: Start difference. First operand 498 states and 724 transitions. Second operand 3 states. [2019-10-15 01:23:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:44,350 INFO L93 Difference]: Finished difference Result 1029 states and 1554 transitions. [2019-10-15 01:23:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:44,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-15 01:23:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:44,355 INFO L225 Difference]: With dead ends: 1029 [2019-10-15 01:23:44,356 INFO L226 Difference]: Without dead ends: 662 [2019-10-15 01:23:44,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-15 01:23:44,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 646. [2019-10-15 01:23:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-15 01:23:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 968 transitions. [2019-10-15 01:23:44,394 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 968 transitions. Word has length 104 [2019-10-15 01:23:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:44,395 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 968 transitions. [2019-10-15 01:23:44,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 968 transitions. [2019-10-15 01:23:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:23:44,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:44,398 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:44,398 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash 60289518, now seen corresponding path program 1 times [2019-10-15 01:23:44,399 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:44,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853613912] [2019-10-15 01:23:44,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:44,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853613912] [2019-10-15 01:23:44,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:44,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:44,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524761254] [2019-10-15 01:23:44,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:44,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:44,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:44,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:44,571 INFO L87 Difference]: Start difference. First operand 646 states and 968 transitions. Second operand 3 states. [2019-10-15 01:23:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:44,690 INFO L93 Difference]: Finished difference Result 1690 states and 2556 transitions. [2019-10-15 01:23:44,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:44,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-15 01:23:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:44,697 INFO L225 Difference]: With dead ends: 1690 [2019-10-15 01:23:44,698 INFO L226 Difference]: Without dead ends: 1241 [2019-10-15 01:23:44,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-10-15 01:23:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1220. [2019-10-15 01:23:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-10-15 01:23:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1820 transitions. [2019-10-15 01:23:44,761 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1820 transitions. Word has length 104 [2019-10-15 01:23:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:44,762 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 1820 transitions. [2019-10-15 01:23:44,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1820 transitions. [2019-10-15 01:23:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:23:44,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:44,765 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:44,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1524807285, now seen corresponding path program 1 times [2019-10-15 01:23:44,766 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:44,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490264650] [2019-10-15 01:23:44,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:44,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490264650] [2019-10-15 01:23:44,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:44,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:44,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127167702] [2019-10-15 01:23:44,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:44,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:44,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:44,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:44,933 INFO L87 Difference]: Start difference. First operand 1220 states and 1820 transitions. Second operand 4 states. [2019-10-15 01:23:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:45,023 INFO L93 Difference]: Finished difference Result 1973 states and 2965 transitions. [2019-10-15 01:23:45,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:45,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-15 01:23:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:45,029 INFO L225 Difference]: With dead ends: 1973 [2019-10-15 01:23:45,030 INFO L226 Difference]: Without dead ends: 938 [2019-10-15 01:23:45,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-10-15 01:23:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2019-10-15 01:23:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-10-15 01:23:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1391 transitions. [2019-10-15 01:23:45,084 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1391 transitions. Word has length 104 [2019-10-15 01:23:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:45,085 INFO L462 AbstractCegarLoop]: Abstraction has 938 states and 1391 transitions. [2019-10-15 01:23:45,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1391 transitions. [2019-10-15 01:23:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:23:45,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:45,087 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:45,087 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash 431033542, now seen corresponding path program 1 times [2019-10-15 01:23:45,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:45,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196056617] [2019-10-15 01:23:45,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:45,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:45,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:45,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196056617] [2019-10-15 01:23:45,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:45,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:45,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096452394] [2019-10-15 01:23:45,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:45,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:45,189 INFO L87 Difference]: Start difference. First operand 938 states and 1391 transitions. Second operand 3 states. [2019-10-15 01:23:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:45,314 INFO L93 Difference]: Finished difference Result 2034 states and 3133 transitions. [2019-10-15 01:23:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:45,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-15 01:23:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:45,332 INFO L225 Difference]: With dead ends: 2034 [2019-10-15 01:23:45,333 INFO L226 Difference]: Without dead ends: 1366 [2019-10-15 01:23:45,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-10-15 01:23:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1322. [2019-10-15 01:23:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-15 01:23:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2014 transitions. [2019-10-15 01:23:45,445 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2014 transitions. Word has length 106 [2019-10-15 01:23:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:45,446 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 2014 transitions. [2019-10-15 01:23:45,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2014 transitions. [2019-10-15 01:23:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:23:45,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:45,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:45,449 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1740408399, now seen corresponding path program 1 times [2019-10-15 01:23:45,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:45,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382408251] [2019-10-15 01:23:45,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:45,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:45,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:45,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382408251] [2019-10-15 01:23:45,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:45,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:45,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345807515] [2019-10-15 01:23:45,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:45,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:45,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:45,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:45,737 INFO L87 Difference]: Start difference. First operand 1322 states and 2014 transitions. Second operand 4 states. [2019-10-15 01:23:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:45,978 INFO L93 Difference]: Finished difference Result 3366 states and 5138 transitions. [2019-10-15 01:23:45,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:45,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-15 01:23:45,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:45,989 INFO L225 Difference]: With dead ends: 3366 [2019-10-15 01:23:45,989 INFO L226 Difference]: Without dead ends: 2067 [2019-10-15 01:23:45,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-10-15 01:23:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2052. [2019-10-15 01:23:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-10-15 01:23:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3114 transitions. [2019-10-15 01:23:46,122 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3114 transitions. Word has length 107 [2019-10-15 01:23:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:46,122 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3114 transitions. [2019-10-15 01:23:46,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3114 transitions. [2019-10-15 01:23:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:23:46,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:46,125 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:46,125 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash -481916784, now seen corresponding path program 1 times [2019-10-15 01:23:46,126 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:46,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512200879] [2019-10-15 01:23:46,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:46,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512200879] [2019-10-15 01:23:46,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:46,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:46,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879940527] [2019-10-15 01:23:46,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:46,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:46,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:46,219 INFO L87 Difference]: Start difference. First operand 2052 states and 3114 transitions. Second operand 3 states. [2019-10-15 01:23:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:46,457 INFO L93 Difference]: Finished difference Result 5515 states and 8477 transitions. [2019-10-15 01:23:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:46,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-15 01:23:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:46,477 INFO L225 Difference]: With dead ends: 5515 [2019-10-15 01:23:46,478 INFO L226 Difference]: Without dead ends: 3822 [2019-10-15 01:23:46,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2019-10-15 01:23:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3809. [2019-10-15 01:23:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2019-10-15 01:23:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 5773 transitions. [2019-10-15 01:23:46,833 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 5773 transitions. Word has length 109 [2019-10-15 01:23:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:46,834 INFO L462 AbstractCegarLoop]: Abstraction has 3809 states and 5773 transitions. [2019-10-15 01:23:46,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 5773 transitions. [2019-10-15 01:23:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:23:46,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:46,840 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:46,840 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:46,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:46,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1064644563, now seen corresponding path program 1 times [2019-10-15 01:23:46,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:46,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437329447] [2019-10-15 01:23:46,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:47,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437329447] [2019-10-15 01:23:47,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:47,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:47,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657914815] [2019-10-15 01:23:47,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:47,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:47,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:47,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:47,029 INFO L87 Difference]: Start difference. First operand 3809 states and 5773 transitions. Second operand 4 states. [2019-10-15 01:23:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:47,233 INFO L93 Difference]: Finished difference Result 5943 states and 9044 transitions. [2019-10-15 01:23:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:47,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-15 01:23:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:47,250 INFO L225 Difference]: With dead ends: 5943 [2019-10-15 01:23:47,250 INFO L226 Difference]: Without dead ends: 3112 [2019-10-15 01:23:47,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2019-10-15 01:23:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2019-10-15 01:23:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2019-10-15 01:23:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4697 transitions. [2019-10-15 01:23:47,495 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4697 transitions. Word has length 109 [2019-10-15 01:23:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:47,496 INFO L462 AbstractCegarLoop]: Abstraction has 3112 states and 4697 transitions. [2019-10-15 01:23:47,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4697 transitions. [2019-10-15 01:23:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:23:47,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:47,499 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:47,499 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash 894991708, now seen corresponding path program 1 times [2019-10-15 01:23:47,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:47,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719084993] [2019-10-15 01:23:47,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:47,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719084993] [2019-10-15 01:23:47,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:47,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:47,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606498977] [2019-10-15 01:23:47,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:47,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:47,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:47,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:47,577 INFO L87 Difference]: Start difference. First operand 3112 states and 4697 transitions. Second operand 3 states. [2019-10-15 01:23:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:47,910 INFO L93 Difference]: Finished difference Result 7812 states and 12106 transitions. [2019-10-15 01:23:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:47,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-15 01:23:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:47,939 INFO L225 Difference]: With dead ends: 7812 [2019-10-15 01:23:47,939 INFO L226 Difference]: Without dead ends: 5036 [2019-10-15 01:23:47,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-10-15 01:23:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4830. [2019-10-15 01:23:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4830 states. [2019-10-15 01:23:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 7460 transitions. [2019-10-15 01:23:48,315 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 7460 transitions. Word has length 111 [2019-10-15 01:23:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:48,315 INFO L462 AbstractCegarLoop]: Abstraction has 4830 states and 7460 transitions. [2019-10-15 01:23:48,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 7460 transitions. [2019-10-15 01:23:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:23:48,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:48,318 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:48,319 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1533697134, now seen corresponding path program 1 times [2019-10-15 01:23:48,319 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:48,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730750410] [2019-10-15 01:23:48,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:48,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730750410] [2019-10-15 01:23:48,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:48,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:48,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661140544] [2019-10-15 01:23:48,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:48,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:48,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:48,387 INFO L87 Difference]: Start difference. First operand 4830 states and 7460 transitions. Second operand 3 states. [2019-10-15 01:23:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:49,057 INFO L93 Difference]: Finished difference Result 13617 states and 21279 transitions. [2019-10-15 01:23:49,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:49,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-15 01:23:49,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:49,107 INFO L225 Difference]: With dead ends: 13617 [2019-10-15 01:23:49,107 INFO L226 Difference]: Without dead ends: 9347 [2019-10-15 01:23:49,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9347 states. [2019-10-15 01:23:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9347 to 9275. [2019-10-15 01:23:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9275 states. [2019-10-15 01:23:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 14366 transitions. [2019-10-15 01:23:49,663 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 14366 transitions. Word has length 112 [2019-10-15 01:23:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:49,663 INFO L462 AbstractCegarLoop]: Abstraction has 9275 states and 14366 transitions. [2019-10-15 01:23:49,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 14366 transitions. [2019-10-15 01:23:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:23:49,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:49,670 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:49,670 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:49,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1051932183, now seen corresponding path program 1 times [2019-10-15 01:23:49,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:49,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162810376] [2019-10-15 01:23:49,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:49,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162810376] [2019-10-15 01:23:49,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:49,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:49,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218282770] [2019-10-15 01:23:49,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:49,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:49,823 INFO L87 Difference]: Start difference. First operand 9275 states and 14366 transitions. Second operand 4 states. [2019-10-15 01:23:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:50,895 INFO L93 Difference]: Finished difference Result 25948 states and 40113 transitions. [2019-10-15 01:23:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:50,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:23:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:50,939 INFO L225 Difference]: With dead ends: 25948 [2019-10-15 01:23:50,939 INFO L226 Difference]: Without dead ends: 16716 [2019-10-15 01:23:50,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16716 states. [2019-10-15 01:23:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16716 to 16644. [2019-10-15 01:23:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16644 states. [2019-10-15 01:23:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16644 states to 16644 states and 25497 transitions. [2019-10-15 01:23:51,948 INFO L78 Accepts]: Start accepts. Automaton has 16644 states and 25497 transitions. Word has length 112 [2019-10-15 01:23:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:51,949 INFO L462 AbstractCegarLoop]: Abstraction has 16644 states and 25497 transitions. [2019-10-15 01:23:51,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 16644 states and 25497 transitions. [2019-10-15 01:23:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:23:51,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:51,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:51,958 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1424445537, now seen corresponding path program 1 times [2019-10-15 01:23:51,959 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:51,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054917042] [2019-10-15 01:23:51,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:52,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054917042] [2019-10-15 01:23:52,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:52,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602711653] [2019-10-15 01:23:52,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:52,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:52,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:52,021 INFO L87 Difference]: Start difference. First operand 16644 states and 25497 transitions. Second operand 3 states. [2019-10-15 01:23:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,805 INFO L93 Difference]: Finished difference Result 49726 states and 76228 transitions. [2019-10-15 01:23:53,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:53,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-15 01:23:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,905 INFO L225 Difference]: With dead ends: 49726 [2019-10-15 01:23:53,906 INFO L226 Difference]: Without dead ends: 33194 [2019-10-15 01:23:53,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-10-15 01:23:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 16650. [2019-10-15 01:23:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16650 states. [2019-10-15 01:23:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16650 states to 16650 states and 25503 transitions. [2019-10-15 01:23:55,026 INFO L78 Accepts]: Start accepts. Automaton has 16650 states and 25503 transitions. Word has length 113 [2019-10-15 01:23:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,026 INFO L462 AbstractCegarLoop]: Abstraction has 16650 states and 25503 transitions. [2019-10-15 01:23:55,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 16650 states and 25503 transitions. [2019-10-15 01:23:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:23:55,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,033 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:55,034 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,034 INFO L82 PathProgramCache]: Analyzing trace with hash 274337368, now seen corresponding path program 1 times [2019-10-15 01:23:55,035 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697176495] [2019-10-15 01:23:55,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:55,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697176495] [2019-10-15 01:23:55,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:55,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117855740] [2019-10-15 01:23:55,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:55,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:55,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:55,157 INFO L87 Difference]: Start difference. First operand 16650 states and 25503 transitions. Second operand 4 states. [2019-10-15 01:23:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:55,891 INFO L93 Difference]: Finished difference Result 33186 states and 50861 transitions. [2019-10-15 01:23:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:55,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:23:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,941 INFO L225 Difference]: With dead ends: 33186 [2019-10-15 01:23:55,941 INFO L226 Difference]: Without dead ends: 16650 [2019-10-15 01:23:55,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16650 states. [2019-10-15 01:23:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16650 to 16647. [2019-10-15 01:23:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16647 states. [2019-10-15 01:23:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16647 states to 16647 states and 25496 transitions. [2019-10-15 01:23:56,936 INFO L78 Accepts]: Start accepts. Automaton has 16647 states and 25496 transitions. Word has length 114 [2019-10-15 01:23:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:56,937 INFO L462 AbstractCegarLoop]: Abstraction has 16647 states and 25496 transitions. [2019-10-15 01:23:56,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 16647 states and 25496 transitions. [2019-10-15 01:23:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:23:56,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:56,944 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:56,944 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1558735045, now seen corresponding path program 1 times [2019-10-15 01:23:56,945 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:56,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913109946] [2019-10-15 01:23:56,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:57,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913109946] [2019-10-15 01:23:57,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:57,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129354306] [2019-10-15 01:23:57,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:57,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:57,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:57,063 INFO L87 Difference]: Start difference. First operand 16647 states and 25496 transitions. Second operand 4 states. [2019-10-15 01:23:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:57,792 INFO L93 Difference]: Finished difference Result 33251 states and 50933 transitions. [2019-10-15 01:23:57,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:57,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:23:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:57,835 INFO L225 Difference]: With dead ends: 33251 [2019-10-15 01:23:57,836 INFO L226 Difference]: Without dead ends: 16641 [2019-10-15 01:23:57,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16641 states. [2019-10-15 01:23:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16641 to 16641. [2019-10-15 01:23:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16641 states. [2019-10-15 01:23:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16641 states to 16641 states and 25484 transitions. [2019-10-15 01:23:58,599 INFO L78 Accepts]: Start accepts. Automaton has 16641 states and 25484 transitions. Word has length 114 [2019-10-15 01:23:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:58,599 INFO L462 AbstractCegarLoop]: Abstraction has 16641 states and 25484 transitions. [2019-10-15 01:23:58,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 16641 states and 25484 transitions. [2019-10-15 01:23:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:23:58,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:58,604 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:58,604 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:58,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash 63830760, now seen corresponding path program 1 times [2019-10-15 01:23:58,604 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:58,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282718352] [2019-10-15 01:23:58,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:58,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282718352] [2019-10-15 01:23:58,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:58,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:58,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389954074] [2019-10-15 01:23:58,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:58,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:58,701 INFO L87 Difference]: Start difference. First operand 16641 states and 25484 transitions. Second operand 3 states. [2019-10-15 01:23:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:59,992 INFO L93 Difference]: Finished difference Result 39717 states and 60974 transitions. [2019-10-15 01:23:59,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:59,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-15 01:23:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:00,039 INFO L225 Difference]: With dead ends: 39717 [2019-10-15 01:24:00,039 INFO L226 Difference]: Without dead ends: 24107 [2019-10-15 01:24:00,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24107 states. [2019-10-15 01:24:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24107 to 24035. [2019-10-15 01:24:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-10-15 01:24:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 36262 transitions. [2019-10-15 01:24:01,856 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 36262 transitions. Word has length 114 [2019-10-15 01:24:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:01,856 INFO L462 AbstractCegarLoop]: Abstraction has 24035 states and 36262 transitions. [2019-10-15 01:24:01,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 36262 transitions. [2019-10-15 01:24:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:24:01,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:01,864 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:01,864 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash 437096993, now seen corresponding path program 1 times [2019-10-15 01:24:01,865 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:01,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147221050] [2019-10-15 01:24:01,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:01,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147221050] [2019-10-15 01:24:01,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:01,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:01,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936313721] [2019-10-15 01:24:01,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:01,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:01,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:01,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:01,999 INFO L87 Difference]: Start difference. First operand 24035 states and 36262 transitions. Second operand 4 states. [2019-10-15 01:24:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:03,086 INFO L93 Difference]: Finished difference Result 39430 states and 59625 transitions. [2019-10-15 01:24:03,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:03,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-10-15 01:24:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:03,118 INFO L225 Difference]: With dead ends: 39430 [2019-10-15 01:24:03,118 INFO L226 Difference]: Without dead ends: 22327 [2019-10-15 01:24:03,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22327 states. [2019-10-15 01:24:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22327 to 22237. [2019-10-15 01:24:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22237 states. [2019-10-15 01:24:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22237 states to 22237 states and 33524 transitions. [2019-10-15 01:24:04,044 INFO L78 Accepts]: Start accepts. Automaton has 22237 states and 33524 transitions. Word has length 117 [2019-10-15 01:24:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:04,044 INFO L462 AbstractCegarLoop]: Abstraction has 22237 states and 33524 transitions. [2019-10-15 01:24:04,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 22237 states and 33524 transitions. [2019-10-15 01:24:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:24:04,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:04,051 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:04,052 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:04,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1129378256, now seen corresponding path program 1 times [2019-10-15 01:24:04,052 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:04,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929781144] [2019-10-15 01:24:04,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:04,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:04,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:04,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929781144] [2019-10-15 01:24:04,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:04,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:04,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358659790] [2019-10-15 01:24:04,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:04,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:04,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:04,209 INFO L87 Difference]: Start difference. First operand 22237 states and 33524 transitions. Second operand 4 states. [2019-10-15 01:24:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:05,539 INFO L93 Difference]: Finished difference Result 44667 states and 67298 transitions. [2019-10-15 01:24:05,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:05,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-10-15 01:24:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:05,567 INFO L225 Difference]: With dead ends: 44667 [2019-10-15 01:24:05,568 INFO L226 Difference]: Without dead ends: 22589 [2019-10-15 01:24:05,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22589 states. [2019-10-15 01:24:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22589 to 22397. [2019-10-15 01:24:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22397 states. [2019-10-15 01:24:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22397 states to 22397 states and 33699 transitions. [2019-10-15 01:24:06,534 INFO L78 Accepts]: Start accepts. Automaton has 22397 states and 33699 transitions. Word has length 119 [2019-10-15 01:24:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:06,534 INFO L462 AbstractCegarLoop]: Abstraction has 22397 states and 33699 transitions. [2019-10-15 01:24:06,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 22397 states and 33699 transitions. [2019-10-15 01:24:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:24:06,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:06,540 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:06,541 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash -586953148, now seen corresponding path program 1 times [2019-10-15 01:24:06,541 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:06,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130417185] [2019-10-15 01:24:06,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:06,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130417185] [2019-10-15 01:24:06,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:06,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:06,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820295490] [2019-10-15 01:24:06,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:06,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:06,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:06,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:06,592 INFO L87 Difference]: Start difference. First operand 22397 states and 33699 transitions. Second operand 3 states. [2019-10-15 01:24:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:08,352 INFO L93 Difference]: Finished difference Result 60771 states and 91685 transitions. [2019-10-15 01:24:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:08,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-15 01:24:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:08,418 INFO L225 Difference]: With dead ends: 60771 [2019-10-15 01:24:08,419 INFO L226 Difference]: Without dead ends: 44583 [2019-10-15 01:24:08,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44583 states. [2019-10-15 01:24:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44583 to 22407. [2019-10-15 01:24:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2019-10-15 01:24:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 33709 transitions. [2019-10-15 01:24:09,821 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 33709 transitions. Word has length 120 [2019-10-15 01:24:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:09,822 INFO L462 AbstractCegarLoop]: Abstraction has 22407 states and 33709 transitions. [2019-10-15 01:24:09,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 33709 transitions. [2019-10-15 01:24:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:24:09,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:09,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:09,827 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:09,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1913512932, now seen corresponding path program 1 times [2019-10-15 01:24:09,827 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:09,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699187006] [2019-10-15 01:24:09,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:09,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:09,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699187006] [2019-10-15 01:24:09,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:09,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:09,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614418795] [2019-10-15 01:24:09,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:09,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:09,935 INFO L87 Difference]: Start difference. First operand 22407 states and 33709 transitions. Second operand 5 states. [2019-10-15 01:24:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:11,969 INFO L93 Difference]: Finished difference Result 41465 states and 62854 transitions. [2019-10-15 01:24:11,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:11,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-15 01:24:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:11,999 INFO L225 Difference]: With dead ends: 41465 [2019-10-15 01:24:12,000 INFO L226 Difference]: Without dead ends: 22407 [2019-10-15 01:24:12,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22407 states. [2019-10-15 01:24:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22407 to 22407. [2019-10-15 01:24:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2019-10-15 01:24:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 33453 transitions. [2019-10-15 01:24:13,100 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 33453 transitions. Word has length 121 [2019-10-15 01:24:13,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:13,100 INFO L462 AbstractCegarLoop]: Abstraction has 22407 states and 33453 transitions. [2019-10-15 01:24:13,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 33453 transitions. [2019-10-15 01:24:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:24:13,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:13,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:13,105 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:13,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:13,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1756764407, now seen corresponding path program 1 times [2019-10-15 01:24:13,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:13,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932789901] [2019-10-15 01:24:13,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:13,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:13,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:13,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932789901] [2019-10-15 01:24:13,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:13,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:13,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888218316] [2019-10-15 01:24:13,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:13,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:13,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:13,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:13,251 INFO L87 Difference]: Start difference. First operand 22407 states and 33453 transitions. Second operand 4 states.