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_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:50,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:50,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:50,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:50,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:50,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:50,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:50,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:50,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:50,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:50,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:50,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:50,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:50,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:50,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:50,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:50,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:50,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:50,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:50,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:50,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:50,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:50,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:50,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:50,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:50,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:50,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:50,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:50,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:50,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:50,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:50,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:50,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:50,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:50,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:50,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:50,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:50,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:50,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:50,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:50,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:50,155 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-13 21:23:50,189 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:50,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:50,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:50,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:50,194 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:50,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:50,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:50,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:50,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:50,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:50,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:50,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:50,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:50,196 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:50,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:50,196 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:50,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:50,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:50,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:50,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:50,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:50,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:50,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:50,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:50,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:50,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:50,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:50,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:50,199 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-13 21:23:50,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:50,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:50,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:50,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:50,510 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:50,510 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:23:50,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05ee1ea74/586091a647df464e82c9ae9b5d02b6de/FLAG937dcd10e [2019-10-13 21:23:51,142 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:51,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:23:51,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05ee1ea74/586091a647df464e82c9ae9b5d02b6de/FLAG937dcd10e [2019-10-13 21:23:51,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05ee1ea74/586091a647df464e82c9ae9b5d02b6de [2019-10-13 21:23:51,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:51,402 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:51,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:51,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:51,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:51,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:51" (1/1) ... [2019-10-13 21:23:51,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1118f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:51, skipping insertion in model container [2019-10-13 21:23:51,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:51" (1/1) ... [2019-10-13 21:23:51,420 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:51,498 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:52,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:52,205 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:52,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:52,370 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:52,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52 WrapperNode [2019-10-13 21:23:52,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:52,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:52,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:52,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:52,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (1/1) ... [2019-10-13 21:23:52,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (1/1) ... [2019-10-13 21:23:52,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (1/1) ... [2019-10-13 21:23:52,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (1/1) ... [2019-10-13 21:23:52,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (1/1) ... [2019-10-13 21:23:52,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (1/1) ... [2019-10-13 21:23:52,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (1/1) ... [2019-10-13 21:23:52,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:52,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:52,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:52,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:52,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (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-13 21:23:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:52,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:52,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:23:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:54,013 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:54,014 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:54,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:54 BoogieIcfgContainer [2019-10-13 21:23:54,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:54,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:54,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:54,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:54,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:51" (1/3) ... [2019-10-13 21:23:54,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d72641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:54, skipping insertion in model container [2019-10-13 21:23:54,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:52" (2/3) ... [2019-10-13 21:23:54,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d72641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:54, skipping insertion in model container [2019-10-13 21:23:54,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:54" (3/3) ... [2019-10-13 21:23:54,024 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:23:54,035 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:54,044 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:54,056 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:54,088 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:54,088 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:54,088 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:54,088 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:54,089 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:54,089 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:54,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:54,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states. [2019-10-13 21:23:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:54,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:54,133 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, 1, 1, 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-13 21:23:54,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:54,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1464169863, now seen corresponding path program 1 times [2019-10-13 21:23:54,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:54,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970756191] [2019-10-13 21:23:54,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:54,815 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-13 21:23:54,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970756191] [2019-10-13 21:23:54,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:54,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:54,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979537414] [2019-10-13 21:23:54,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:54,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:54,844 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 3 states. [2019-10-13 21:23:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:55,094 INFO L93 Difference]: Finished difference Result 619 states and 1086 transitions. [2019-10-13 21:23:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:55,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-13 21:23:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:55,115 INFO L225 Difference]: With dead ends: 619 [2019-10-13 21:23:55,115 INFO L226 Difference]: Without dead ends: 492 [2019-10-13 21:23:55,120 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-13 21:23:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-13 21:23:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2019-10-13 21:23:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-13 21:23:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 727 transitions. [2019-10-13 21:23:55,221 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 727 transitions. Word has length 147 [2019-10-13 21:23:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:55,222 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 727 transitions. [2019-10-13 21:23:55,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 727 transitions. [2019-10-13 21:23:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:55,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:55,227 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, 1, 1, 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-13 21:23:55,227 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 558735771, now seen corresponding path program 1 times [2019-10-13 21:23:55,228 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:55,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286545384] [2019-10-13 21:23:55,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:55,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286545384] [2019-10-13 21:23:55,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:55,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:55,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601762903] [2019-10-13 21:23:55,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:55,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:55,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:55,430 INFO L87 Difference]: Start difference. First operand 490 states and 727 transitions. Second operand 3 states. [2019-10-13 21:23:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:55,545 INFO L93 Difference]: Finished difference Result 1032 states and 1578 transitions. [2019-10-13 21:23:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:55,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-13 21:23:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:55,551 INFO L225 Difference]: With dead ends: 1032 [2019-10-13 21:23:55,552 INFO L226 Difference]: Without dead ends: 840 [2019-10-13 21:23:55,554 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-13 21:23:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-10-13 21:23:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2019-10-13 21:23:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-13 21:23:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1255 transitions. [2019-10-13 21:23:55,624 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1255 transitions. Word has length 147 [2019-10-13 21:23:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:55,625 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1255 transitions. [2019-10-13 21:23:55,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1255 transitions. [2019-10-13 21:23:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:55,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:55,641 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, 1, 1, 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-13 21:23:55,641 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:55,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1754446721, now seen corresponding path program 1 times [2019-10-13 21:23:55,642 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:55,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124764819] [2019-10-13 21:23:55,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:56,109 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-13 21:23:56,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124764819] [2019-10-13 21:23:56,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:56,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:56,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712204011] [2019-10-13 21:23:56,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:56,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:56,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:56,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:56,123 INFO L87 Difference]: Start difference. First operand 838 states and 1255 transitions. Second operand 4 states. [2019-10-13 21:23:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:56,336 INFO L93 Difference]: Finished difference Result 2461 states and 3682 transitions. [2019-10-13 21:23:56,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:56,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 21:23:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,352 INFO L225 Difference]: With dead ends: 2461 [2019-10-13 21:23:56,352 INFO L226 Difference]: Without dead ends: 1636 [2019-10-13 21:23:56,360 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-13 21:23:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-10-13 21:23:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1634. [2019-10-13 21:23:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-10-13 21:23:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2428 transitions. [2019-10-13 21:23:56,470 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2428 transitions. Word has length 147 [2019-10-13 21:23:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:56,471 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 2428 transitions. [2019-10-13 21:23:56,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2428 transitions. [2019-10-13 21:23:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:23:56,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:56,479 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, 1, 1, 1, 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-13 21:23:56,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,480 INFO L82 PathProgramCache]: Analyzing trace with hash 818598479, now seen corresponding path program 1 times [2019-10-13 21:23:56,480 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656010648] [2019-10-13 21:23:56,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:56,589 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-13 21:23:56,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656010648] [2019-10-13 21:23:56,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:56,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:56,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557423621] [2019-10-13 21:23:56,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:56,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:56,592 INFO L87 Difference]: Start difference. First operand 1634 states and 2428 transitions. Second operand 3 states. [2019-10-13 21:23:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:56,743 INFO L93 Difference]: Finished difference Result 4856 states and 7214 transitions. [2019-10-13 21:23:56,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:56,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-13 21:23:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,762 INFO L225 Difference]: With dead ends: 4856 [2019-10-13 21:23:56,762 INFO L226 Difference]: Without dead ends: 3254 [2019-10-13 21:23:56,767 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-13 21:23:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-10-13 21:23:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 1636. [2019-10-13 21:23:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-10-13 21:23:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2430 transitions. [2019-10-13 21:23:56,880 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2430 transitions. Word has length 148 [2019-10-13 21:23:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:56,880 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 2430 transitions. [2019-10-13 21:23:56,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2430 transitions. [2019-10-13 21:23:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:23:56,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:56,884 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, 1, 1, 1, 1, 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-13 21:23:56,885 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash -77658400, now seen corresponding path program 1 times [2019-10-13 21:23:56,885 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898402032] [2019-10-13 21:23:56,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,106 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-13 21:23:57,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898402032] [2019-10-13 21:23:57,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:57,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406217103] [2019-10-13 21:23:57,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:57,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:57,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:57,109 INFO L87 Difference]: Start difference. First operand 1636 states and 2430 transitions. Second operand 4 states. [2019-10-13 21:23:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,229 INFO L93 Difference]: Finished difference Result 3258 states and 4842 transitions. [2019-10-13 21:23:57,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:57,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-13 21:23:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,238 INFO L225 Difference]: With dead ends: 3258 [2019-10-13 21:23:57,239 INFO L226 Difference]: Without dead ends: 1634 [2019-10-13 21:23:57,243 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-13 21:23:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-10-13 21:23:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2019-10-13 21:23:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-10-13 21:23:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2426 transitions. [2019-10-13 21:23:57,365 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2426 transitions. Word has length 149 [2019-10-13 21:23:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,366 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 2426 transitions. [2019-10-13 21:23:57,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2426 transitions. [2019-10-13 21:23:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:23:57,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,370 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, 1, 1, 1, 1, 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-13 21:23:57,371 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash -381277494, now seen corresponding path program 1 times [2019-10-13 21:23:57,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426805154] [2019-10-13 21:23:57,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,485 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-13 21:23:57,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426805154] [2019-10-13 21:23:57,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:57,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539440156] [2019-10-13 21:23:57,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:57,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:57,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:57,487 INFO L87 Difference]: Start difference. First operand 1634 states and 2426 transitions. Second operand 3 states. [2019-10-13 21:23:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,666 INFO L93 Difference]: Finished difference Result 3870 states and 5761 transitions. [2019-10-13 21:23:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:57,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:23:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,685 INFO L225 Difference]: With dead ends: 3870 [2019-10-13 21:23:57,686 INFO L226 Difference]: Without dead ends: 2414 [2019-10-13 21:23:57,690 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-13 21:23:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-10-13 21:23:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2019-10-13 21:23:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-10-13 21:23:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3535 transitions. [2019-10-13 21:23:57,846 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3535 transitions. Word has length 149 [2019-10-13 21:23:57,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,846 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3535 transitions. [2019-10-13 21:23:57,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3535 transitions. [2019-10-13 21:23:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:23:57,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,853 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, 1, 1, 1, 1, 1, 1, 1, 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-13 21:23:57,853 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1397721559, now seen corresponding path program 1 times [2019-10-13 21:23:57,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143861904] [2019-10-13 21:23:57,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:58,151 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-13 21:23:58,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143861904] [2019-10-13 21:23:58,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:58,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:23:58,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224551686] [2019-10-13 21:23:58,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:23:58,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:23:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:58,154 INFO L87 Difference]: Start difference. First operand 2412 states and 3535 transitions. Second operand 5 states. [2019-10-13 21:23:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:58,627 INFO L93 Difference]: Finished difference Result 4658 states and 6855 transitions. [2019-10-13 21:23:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:23:58,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-13 21:23:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:58,641 INFO L225 Difference]: With dead ends: 4658 [2019-10-13 21:23:58,641 INFO L226 Difference]: Without dead ends: 2414 [2019-10-13 21:23:58,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:23:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-10-13 21:23:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2019-10-13 21:23:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-10-13 21:23:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3520 transitions. [2019-10-13 21:23:58,796 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3520 transitions. Word has length 152 [2019-10-13 21:23:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:58,797 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3520 transitions. [2019-10-13 21:23:58,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:23:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3520 transitions. [2019-10-13 21:23:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:23:58,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:58,802 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, 1, 1, 1, 1, 1, 1, 1, 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-13 21:23:58,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1633318332, now seen corresponding path program 1 times [2019-10-13 21:23:58,803 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:58,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072550924] [2019-10-13 21:23:58,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:59,055 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-13 21:23:59,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072550924] [2019-10-13 21:23:59,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:59,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:59,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810109688] [2019-10-13 21:23:59,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:59,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:59,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:59,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:59,058 INFO L87 Difference]: Start difference. First operand 2412 states and 3520 transitions. Second operand 4 states. [2019-10-13 21:23:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:59,364 INFO L93 Difference]: Finished difference Result 6242 states and 9103 transitions. [2019-10-13 21:23:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:59,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-13 21:23:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:59,390 INFO L225 Difference]: With dead ends: 6242 [2019-10-13 21:23:59,391 INFO L226 Difference]: Without dead ends: 3853 [2019-10-13 21:23:59,402 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-13 21:23:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-10-13 21:23:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2019-10-13 21:23:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3851 states. [2019-10-13 21:23:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5567 transitions. [2019-10-13 21:23:59,753 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5567 transitions. Word has length 152 [2019-10-13 21:23:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:59,753 INFO L462 AbstractCegarLoop]: Abstraction has 3851 states and 5567 transitions. [2019-10-13 21:23:59,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:59,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5567 transitions. [2019-10-13 21:23:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:23:59,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:59,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:23:59,761 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:59,761 INFO L82 PathProgramCache]: Analyzing trace with hash -83620211, now seen corresponding path program 1 times [2019-10-13 21:23:59,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:59,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229056109] [2019-10-13 21:23:59,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:59,875 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-13 21:23:59,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229056109] [2019-10-13 21:23:59,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:59,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:59,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065485561] [2019-10-13 21:23:59,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:59,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:59,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:59,881 INFO L87 Difference]: Start difference. First operand 3851 states and 5567 transitions. Second operand 3 states. [2019-10-13 21:24:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:00,282 INFO L93 Difference]: Finished difference Result 10239 states and 14831 transitions. [2019-10-13 21:24:00,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:00,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-13 21:24:00,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:00,321 INFO L225 Difference]: With dead ends: 10239 [2019-10-13 21:24:00,321 INFO L226 Difference]: Without dead ends: 6731 [2019-10-13 21:24:00,330 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-13 21:24:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6731 states. [2019-10-13 21:24:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6731 to 6729. [2019-10-13 21:24:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2019-10-13 21:24:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 9603 transitions. [2019-10-13 21:24:00,935 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 9603 transitions. Word has length 154 [2019-10-13 21:24:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:00,935 INFO L462 AbstractCegarLoop]: Abstraction has 6729 states and 9603 transitions. [2019-10-13 21:24:00,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 9603 transitions. [2019-10-13 21:24:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:00,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:00,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:24:00,946 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash 423811114, now seen corresponding path program 1 times [2019-10-13 21:24:00,946 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:00,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078769384] [2019-10-13 21:24:00,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:01,081 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-13 21:24:01,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078769384] [2019-10-13 21:24:01,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:01,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:01,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105646763] [2019-10-13 21:24:01,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:01,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:01,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:01,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:01,084 INFO L87 Difference]: Start difference. First operand 6729 states and 9603 transitions. Second operand 4 states. [2019-10-13 21:24:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:01,482 INFO L93 Difference]: Finished difference Result 11002 states and 15732 transitions. [2019-10-13 21:24:01,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:01,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-13 21:24:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:01,509 INFO L225 Difference]: With dead ends: 11002 [2019-10-13 21:24:01,510 INFO L226 Difference]: Without dead ends: 5964 [2019-10-13 21:24:01,521 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-13 21:24:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-10-13 21:24:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5964. [2019-10-13 21:24:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2019-10-13 21:24:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 8508 transitions. [2019-10-13 21:24:01,885 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 8508 transitions. Word has length 154 [2019-10-13 21:24:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:01,885 INFO L462 AbstractCegarLoop]: Abstraction has 5964 states and 8508 transitions. [2019-10-13 21:24:01,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 8508 transitions. [2019-10-13 21:24:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:24:01,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:01,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:24:01,895 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash 923876710, now seen corresponding path program 1 times [2019-10-13 21:24:01,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:01,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838040025] [2019-10-13 21:24:01,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:01,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:01,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:02,073 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-13 21:24:02,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838040025] [2019-10-13 21:24:02,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:02,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:02,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044012844] [2019-10-13 21:24:02,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:02,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:02,077 INFO L87 Difference]: Start difference. First operand 5964 states and 8508 transitions. Second operand 4 states. [2019-10-13 21:24:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:02,708 INFO L93 Difference]: Finished difference Result 17410 states and 24777 transitions. [2019-10-13 21:24:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:02,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-13 21:24:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:02,740 INFO L225 Difference]: With dead ends: 17410 [2019-10-13 21:24:02,740 INFO L226 Difference]: Without dead ends: 11489 [2019-10-13 21:24:02,753 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-13 21:24:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2019-10-13 21:24:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 11487. [2019-10-13 21:24:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11487 states. [2019-10-13 21:24:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 16184 transitions. [2019-10-13 21:24:03,475 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 16184 transitions. Word has length 157 [2019-10-13 21:24:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:03,476 INFO L462 AbstractCegarLoop]: Abstraction has 11487 states and 16184 transitions. [2019-10-13 21:24:03,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 16184 transitions. [2019-10-13 21:24:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:24:03,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:03,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:24:03,499 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:03,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:03,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2109819854, now seen corresponding path program 1 times [2019-10-13 21:24:03,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:03,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843216902] [2019-10-13 21:24:03,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:03,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843216902] [2019-10-13 21:24:03,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:03,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:03,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649518823] [2019-10-13 21:24:03,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:03,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:03,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:03,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:03,576 INFO L87 Difference]: Start difference. First operand 11487 states and 16184 transitions. Second operand 3 states. [2019-10-13 21:24:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:04,547 INFO L93 Difference]: Finished difference Result 34269 states and 48305 transitions. [2019-10-13 21:24:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:04,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-13 21:24:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:04,595 INFO L225 Difference]: With dead ends: 34269 [2019-10-13 21:24:04,595 INFO L226 Difference]: Without dead ends: 22887 [2019-10-13 21:24:04,620 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-13 21:24:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22887 states. [2019-10-13 21:24:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22887 to 11493. [2019-10-13 21:24:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11493 states. [2019-10-13 21:24:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11493 states to 11493 states and 16190 transitions. [2019-10-13 21:24:05,278 INFO L78 Accepts]: Start accepts. Automaton has 11493 states and 16190 transitions. Word has length 158 [2019-10-13 21:24:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:05,278 INFO L462 AbstractCegarLoop]: Abstraction has 11493 states and 16190 transitions. [2019-10-13 21:24:05,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 11493 states and 16190 transitions. [2019-10-13 21:24:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:24:05,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:05,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:24:05,297 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:05,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1177749259, now seen corresponding path program 1 times [2019-10-13 21:24:05,297 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:05,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6806612] [2019-10-13 21:24:05,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:05,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:05,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:05,527 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-13 21:24:05,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6806612] [2019-10-13 21:24:05,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:05,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:05,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853005111] [2019-10-13 21:24:05,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:05,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:05,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:05,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:05,530 INFO L87 Difference]: Start difference. First operand 11493 states and 16190 transitions. Second operand 3 states. [2019-10-13 21:24:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:06,633 INFO L93 Difference]: Finished difference Result 30661 states and 43120 transitions. [2019-10-13 21:24:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:06,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-13 21:24:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:06,692 INFO L225 Difference]: With dead ends: 30661 [2019-10-13 21:24:06,693 INFO L226 Difference]: Without dead ends: 19849 [2019-10-13 21:24:06,729 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-13 21:24:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19849 states. [2019-10-13 21:24:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19849 to 19847. [2019-10-13 21:24:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19847 states. [2019-10-13 21:24:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19847 states to 19847 states and 27468 transitions. [2019-10-13 21:24:08,289 INFO L78 Accepts]: Start accepts. Automaton has 19847 states and 27468 transitions. Word has length 159 [2019-10-13 21:24:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:08,289 INFO L462 AbstractCegarLoop]: Abstraction has 19847 states and 27468 transitions. [2019-10-13 21:24:08,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19847 states and 27468 transitions. [2019-10-13 21:24:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:24:08,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:08,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:24:08,311 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash -220529586, now seen corresponding path program 1 times [2019-10-13 21:24:08,312 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:08,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012958658] [2019-10-13 21:24:08,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:08,462 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-13 21:24:08,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012958658] [2019-10-13 21:24:08,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:08,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:08,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049155752] [2019-10-13 21:24:08,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:08,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:08,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:08,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:08,464 INFO L87 Difference]: Start difference. First operand 19847 states and 27468 transitions. Second operand 4 states. [2019-10-13 21:24:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:09,096 INFO L93 Difference]: Finished difference Result 36277 states and 50352 transitions. [2019-10-13 21:24:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:09,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-13 21:24:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:09,134 INFO L225 Difference]: With dead ends: 36277 [2019-10-13 21:24:09,134 INFO L226 Difference]: Without dead ends: 17049 [2019-10-13 21:24:09,174 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-13 21:24:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17049 states. [2019-10-13 21:24:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17049 to 17049. [2019-10-13 21:24:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17049 states. [2019-10-13 21:24:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17049 states to 17049 states and 23607 transitions. [2019-10-13 21:24:10,097 INFO L78 Accepts]: Start accepts. Automaton has 17049 states and 23607 transitions. Word has length 159 [2019-10-13 21:24:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:10,097 INFO L462 AbstractCegarLoop]: Abstraction has 17049 states and 23607 transitions. [2019-10-13 21:24:10,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 17049 states and 23607 transitions. [2019-10-13 21:24:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:24:10,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:10,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:24:10,112 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash -888345886, now seen corresponding path program 1 times [2019-10-13 21:24:10,113 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:10,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578789180] [2019-10-13 21:24:10,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:10,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:10,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:10,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-13 21:24:10,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578789180] [2019-10-13 21:24:10,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:10,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:10,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810633070] [2019-10-13 21:24:10,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:10,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:10,284 INFO L87 Difference]: Start difference. First operand 17049 states and 23607 transitions. Second operand 5 states. [2019-10-13 21:24:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:12,407 INFO L93 Difference]: Finished difference Result 47742 states and 66753 transitions. [2019-10-13 21:24:12,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:12,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-13 21:24:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:12,464 INFO L225 Difference]: With dead ends: 47742 [2019-10-13 21:24:12,464 INFO L226 Difference]: Without dead ends: 32329 [2019-10-13 21:24:12,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32329 states. [2019-10-13 21:24:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32329 to 32327. [2019-10-13 21:24:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32327 states. [2019-10-13 21:24:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32327 states to 32327 states and 44631 transitions. [2019-10-13 21:24:13,975 INFO L78 Accepts]: Start accepts. Automaton has 32327 states and 44631 transitions. Word has length 165 [2019-10-13 21:24:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:13,976 INFO L462 AbstractCegarLoop]: Abstraction has 32327 states and 44631 transitions. [2019-10-13 21:24:13,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32327 states and 44631 transitions. [2019-10-13 21:24:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:24:13,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:13,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:24:13,998 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:13,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:13,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1990153662, now seen corresponding path program 1 times [2019-10-13 21:24:13,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:13,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497598476] [2019-10-13 21:24:13,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:13,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:13,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:14,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497598476] [2019-10-13 21:24:14,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:14,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:14,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984773173] [2019-10-13 21:24:14,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:14,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:14,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:14,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:14,204 INFO L87 Difference]: Start difference. First operand 32327 states and 44631 transitions. Second operand 6 states. [2019-10-13 21:24:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:17,928 INFO L93 Difference]: Finished difference Result 74095 states and 110339 transitions. [2019-10-13 21:24:17,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:17,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-10-13 21:24:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:18,041 INFO L225 Difference]: With dead ends: 74095 [2019-10-13 21:24:18,041 INFO L226 Difference]: Without dead ends: 60045 [2019-10-13 21:24:18,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60045 states. [2019-10-13 21:24:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60045 to 59751. [2019-10-13 21:24:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59751 states. [2019-10-13 21:24:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59751 states to 59751 states and 87443 transitions. [2019-10-13 21:24:21,298 INFO L78 Accepts]: Start accepts. Automaton has 59751 states and 87443 transitions. Word has length 165 [2019-10-13 21:24:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:21,299 INFO L462 AbstractCegarLoop]: Abstraction has 59751 states and 87443 transitions. [2019-10-13 21:24:21,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 59751 states and 87443 transitions. [2019-10-13 21:24:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:24:21,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:21,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:24:21,312 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash -794442712, now seen corresponding path program 1 times [2019-10-13 21:24:21,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:21,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602212585] [2019-10-13 21:24:21,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:21,548 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-13 21:24:21,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602212585] [2019-10-13 21:24:21,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:21,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:21,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655503107] [2019-10-13 21:24:21,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:21,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:21,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:21,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:21,551 INFO L87 Difference]: Start difference. First operand 59751 states and 87443 transitions. Second operand 4 states.