java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:31,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:31,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:31,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:31,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:31,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:31,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:31,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:31,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:31,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:31,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:31,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:31,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:31,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:31,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:31,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:31,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:31,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:31,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:31,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:31,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:31,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:31,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:31,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:31,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:31,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:31,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:31,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:31,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:31,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:31,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:31,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:31,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:31,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:31,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:31,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:31,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:31,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:31,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:31,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:31,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:31,186 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:24:31,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:31,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:31,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:31,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:31,213 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:31,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:31,214 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:31,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:31,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:31,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:31,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:31,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:31,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:31,216 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:31,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:31,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:31,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:31,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:31,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:31,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:31,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:31,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:31,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:31,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:31,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:31,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:31,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:31,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:31,219 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:24:31,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:31,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:31,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:31,548 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:31,549 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:31,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:31,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d836f4b2/840dd343b4dc40a8b6699beb92b312fa/FLAG02e4799c8 [2019-10-13 21:24:32,223 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:32,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:32,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d836f4b2/840dd343b4dc40a8b6699beb92b312fa/FLAG02e4799c8 [2019-10-13 21:24:32,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d836f4b2/840dd343b4dc40a8b6699beb92b312fa [2019-10-13 21:24:32,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:32,455 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:32,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:32,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:32,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:32,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:32" (1/1) ... [2019-10-13 21:24:32,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f2850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:32, skipping insertion in model container [2019-10-13 21:24:32,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:32" (1/1) ... [2019-10-13 21:24:32,473 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:32,540 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:33,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:33,063 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:33,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:33,217 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:33,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33 WrapperNode [2019-10-13 21:24:33,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:33,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:33,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:33,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:33,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (1/1) ... [2019-10-13 21:24:33,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (1/1) ... [2019-10-13 21:24:33,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (1/1) ... [2019-10-13 21:24:33,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (1/1) ... [2019-10-13 21:24:33,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (1/1) ... [2019-10-13 21:24:33,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (1/1) ... [2019-10-13 21:24:33,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (1/1) ... [2019-10-13 21:24:33,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:33,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:33,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:33,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:33,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (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:24:33,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:33,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:33,387 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:33,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:33,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:33,391 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:33,391 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:33,391 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:33,391 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:33,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:34,805 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:34,806 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:34,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:34 BoogieIcfgContainer [2019-10-13 21:24:34,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:34,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:34,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:34,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:34,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:32" (1/3) ... [2019-10-13 21:24:34,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5d723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:34, skipping insertion in model container [2019-10-13 21:24:34,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:33" (2/3) ... [2019-10-13 21:24:34,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5d723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:34, skipping insertion in model container [2019-10-13 21:24:34,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:34" (3/3) ... [2019-10-13 21:24:34,818 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:24:34,829 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:34,839 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:24:34,854 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:24:34,883 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:34,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:34,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:34,884 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:34,884 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:34,884 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:34,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:34,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2019-10-13 21:24:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:24:34,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:34,950 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:34,951 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:34,956 INFO L82 PathProgramCache]: Analyzing trace with hash -766456376, now seen corresponding path program 1 times [2019-10-13 21:24:34,963 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:34,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988752325] [2019-10-13 21:24:34,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:35,566 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:35,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988752325] [2019-10-13 21:24:35,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:35,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:35,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451714056] [2019-10-13 21:24:35,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:35,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:35,602 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 3 states. [2019-10-13 21:24:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:35,873 INFO L93 Difference]: Finished difference Result 489 states and 838 transitions. [2019-10-13 21:24:35,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:35,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-13 21:24:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:35,910 INFO L225 Difference]: With dead ends: 489 [2019-10-13 21:24:35,910 INFO L226 Difference]: Without dead ends: 362 [2019-10-13 21:24:35,918 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:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-13 21:24:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-13 21:24:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 21:24:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-10-13 21:24:36,045 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 104 [2019-10-13 21:24:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:36,046 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-10-13 21:24:36,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-10-13 21:24:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:24:36,049 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:36,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:36,050 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1314271708, now seen corresponding path program 1 times [2019-10-13 21:24:36,050 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:36,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201786961] [2019-10-13 21:24:36,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:36,405 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:36,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201786961] [2019-10-13 21:24:36,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:36,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:36,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081545641] [2019-10-13 21:24:36,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:36,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:36,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:36,410 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2019-10-13 21:24:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:36,538 INFO L93 Difference]: Finished difference Result 1038 states and 1576 transitions. [2019-10-13 21:24:36,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:36,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 21:24:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:36,544 INFO L225 Difference]: With dead ends: 1038 [2019-10-13 21:24:36,545 INFO L226 Difference]: Without dead ends: 691 [2019-10-13 21:24:36,548 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:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-13 21:24:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2019-10-13 21:24:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-10-13 21:24:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1038 transitions. [2019-10-13 21:24:36,602 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1038 transitions. Word has length 104 [2019-10-13 21:24:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:36,605 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1038 transitions. [2019-10-13 21:24:36,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1038 transitions. [2019-10-13 21:24:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:24:36,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:36,616 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] [2019-10-13 21:24:36,617 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:36,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2074994812, now seen corresponding path program 1 times [2019-10-13 21:24:36,618 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:36,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785482229] [2019-10-13 21:24:36,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:36,723 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:36,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785482229] [2019-10-13 21:24:36,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:36,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:36,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993911349] [2019-10-13 21:24:36,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:36,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:36,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:36,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:36,732 INFO L87 Difference]: Start difference. First operand 689 states and 1038 transitions. Second operand 3 states. [2019-10-13 21:24:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:36,800 INFO L93 Difference]: Finished difference Result 2021 states and 3044 transitions. [2019-10-13 21:24:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:36,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-13 21:24:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:36,808 INFO L225 Difference]: With dead ends: 2021 [2019-10-13 21:24:36,808 INFO L226 Difference]: Without dead ends: 1364 [2019-10-13 21:24:36,811 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:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-10-13 21:24:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 691. [2019-10-13 21:24:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-10-13 21:24:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1040 transitions. [2019-10-13 21:24:36,865 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1040 transitions. Word has length 105 [2019-10-13 21:24:36,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:36,865 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1040 transitions. [2019-10-13 21:24:36,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1040 transitions. [2019-10-13 21:24:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:24:36,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:36,868 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:36,868 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:36,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1322406660, now seen corresponding path program 1 times [2019-10-13 21:24:36,869 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:36,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682574931] [2019-10-13 21:24:36,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:36,979 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:36,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682574931] [2019-10-13 21:24:36,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:36,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:36,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519238349] [2019-10-13 21:24:36,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:36,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:36,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:36,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:36,982 INFO L87 Difference]: Start difference. First operand 691 states and 1040 transitions. Second operand 3 states. [2019-10-13 21:24:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:37,109 INFO L93 Difference]: Finished difference Result 1822 states and 2765 transitions. [2019-10-13 21:24:37,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:37,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-13 21:24:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:37,119 INFO L225 Difference]: With dead ends: 1822 [2019-10-13 21:24:37,119 INFO L226 Difference]: Without dead ends: 1330 [2019-10-13 21:24:37,121 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:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-10-13 21:24:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2019-10-13 21:24:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-10-13 21:24:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1983 transitions. [2019-10-13 21:24:37,200 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1983 transitions. Word has length 106 [2019-10-13 21:24:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:37,200 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 1983 transitions. [2019-10-13 21:24:37,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1983 transitions. [2019-10-13 21:24:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:24:37,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:37,203 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:37,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1537198239, now seen corresponding path program 1 times [2019-10-13 21:24:37,204 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:37,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520878537] [2019-10-13 21:24:37,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:37,389 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:37,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520878537] [2019-10-13 21:24:37,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:37,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:37,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340834570] [2019-10-13 21:24:37,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:37,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:37,392 INFO L87 Difference]: Start difference. First operand 1328 states and 1983 transitions. Second operand 4 states. [2019-10-13 21:24:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:37,494 INFO L93 Difference]: Finished difference Result 2157 states and 3243 transitions. [2019-10-13 21:24:37,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:37,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 21:24:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:37,500 INFO L225 Difference]: With dead ends: 2157 [2019-10-13 21:24:37,501 INFO L226 Difference]: Without dead ends: 1016 [2019-10-13 21:24:37,504 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:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-13 21:24:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2019-10-13 21:24:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-10-13 21:24:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1511 transitions. [2019-10-13 21:24:37,576 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1511 transitions. Word has length 106 [2019-10-13 21:24:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:37,577 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 1511 transitions. [2019-10-13 21:24:37,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1511 transitions. [2019-10-13 21:24:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:24:37,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:37,579 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:37,580 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1464646849, now seen corresponding path program 1 times [2019-10-13 21:24:37,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:37,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624154996] [2019-10-13 21:24:37,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:37,700 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:37,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624154996] [2019-10-13 21:24:37,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:37,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:37,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966800553] [2019-10-13 21:24:37,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:37,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:37,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:37,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:37,704 INFO L87 Difference]: Start difference. First operand 1016 states and 1511 transitions. Second operand 3 states. [2019-10-13 21:24:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:37,811 INFO L93 Difference]: Finished difference Result 2291 states and 3531 transitions. [2019-10-13 21:24:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:37,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-13 21:24:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:37,828 INFO L225 Difference]: With dead ends: 2291 [2019-10-13 21:24:37,828 INFO L226 Difference]: Without dead ends: 1464 [2019-10-13 21:24:37,832 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:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-10-13 21:24:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1432. [2019-10-13 21:24:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-10-13 21:24:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2190 transitions. [2019-10-13 21:24:37,974 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2190 transitions. Word has length 106 [2019-10-13 21:24:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:37,975 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 2190 transitions. [2019-10-13 21:24:37,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2190 transitions. [2019-10-13 21:24:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 21:24:37,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:37,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,980 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1043553758, now seen corresponding path program 1 times [2019-10-13 21:24:37,981 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:37,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478967801] [2019-10-13 21:24:37,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:38,127 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:38,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478967801] [2019-10-13 21:24:38,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:38,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:38,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742534805] [2019-10-13 21:24:38,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:38,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:38,131 INFO L87 Difference]: Start difference. First operand 1432 states and 2190 transitions. Second operand 3 states. [2019-10-13 21:24:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:38,338 INFO L93 Difference]: Finished difference Result 3397 states and 5357 transitions. [2019-10-13 21:24:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:38,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-13 21:24:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:38,353 INFO L225 Difference]: With dead ends: 3397 [2019-10-13 21:24:38,353 INFO L226 Difference]: Without dead ends: 2238 [2019-10-13 21:24:38,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-10-13 21:24:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2176. [2019-10-13 21:24:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-10-13 21:24:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3396 transitions. [2019-10-13 21:24:38,544 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3396 transitions. Word has length 108 [2019-10-13 21:24:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:38,545 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3396 transitions. [2019-10-13 21:24:38,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3396 transitions. [2019-10-13 21:24:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:24:38,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:38,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:38,548 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:38,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1020043605, now seen corresponding path program 1 times [2019-10-13 21:24:38,549 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:38,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947296299] [2019-10-13 21:24:38,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:38,730 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:38,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947296299] [2019-10-13 21:24:38,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:38,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:38,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281816789] [2019-10-13 21:24:38,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:38,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:38,733 INFO L87 Difference]: Start difference. First operand 2176 states and 3396 transitions. Second operand 5 states. [2019-10-13 21:24:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:39,111 INFO L93 Difference]: Finished difference Result 4171 states and 6562 transitions. [2019-10-13 21:24:39,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:39,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 21:24:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:39,125 INFO L225 Difference]: With dead ends: 4171 [2019-10-13 21:24:39,126 INFO L226 Difference]: Without dead ends: 2178 [2019-10-13 21:24:39,132 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:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-10-13 21:24:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2176. [2019-10-13 21:24:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-10-13 21:24:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3381 transitions. [2019-10-13 21:24:39,341 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3381 transitions. Word has length 109 [2019-10-13 21:24:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:39,341 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3381 transitions. [2019-10-13 21:24:39,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3381 transitions. [2019-10-13 21:24:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:24:39,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:39,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:39,345 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash 802679046, now seen corresponding path program 1 times [2019-10-13 21:24:39,346 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:39,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851726516] [2019-10-13 21:24:39,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:39,531 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:39,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851726516] [2019-10-13 21:24:39,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:39,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:39,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123365525] [2019-10-13 21:24:39,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:39,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:39,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:39,536 INFO L87 Difference]: Start difference. First operand 2176 states and 3381 transitions. Second operand 4 states. [2019-10-13 21:24:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:39,792 INFO L93 Difference]: Finished difference Result 5611 states and 8738 transitions. [2019-10-13 21:24:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:39,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-13 21:24:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:39,809 INFO L225 Difference]: With dead ends: 5611 [2019-10-13 21:24:39,810 INFO L226 Difference]: Without dead ends: 3458 [2019-10-13 21:24:39,815 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:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-10-13 21:24:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3456. [2019-10-13 21:24:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-10-13 21:24:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 5341 transitions. [2019-10-13 21:24:40,076 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 5341 transitions. Word has length 109 [2019-10-13 21:24:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,077 INFO L462 AbstractCegarLoop]: Abstraction has 3456 states and 5341 transitions. [2019-10-13 21:24:40,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 5341 transitions. [2019-10-13 21:24:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:24:40,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,080 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:40,080 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2079942452, now seen corresponding path program 1 times [2019-10-13 21:24:40,081 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610433743] [2019-10-13 21:24:40,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:40,175 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:40,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610433743] [2019-10-13 21:24:40,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:40,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:40,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541947427] [2019-10-13 21:24:40,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:40,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:40,177 INFO L87 Difference]: Start difference. First operand 3456 states and 5341 transitions. Second operand 3 states. [2019-10-13 21:24:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:40,620 INFO L93 Difference]: Finished difference Result 9594 states and 14954 transitions. [2019-10-13 21:24:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:40,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-13 21:24:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:40,652 INFO L225 Difference]: With dead ends: 9594 [2019-10-13 21:24:40,652 INFO L226 Difference]: Without dead ends: 6514 [2019-10-13 21:24:40,663 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:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-10-13 21:24:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6512. [2019-10-13 21:24:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-10-13 21:24:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10016 transitions. [2019-10-13 21:24:41,082 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10016 transitions. Word has length 111 [2019-10-13 21:24:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:41,083 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 10016 transitions. [2019-10-13 21:24:41,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10016 transitions. [2019-10-13 21:24:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:24:41,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:41,087 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:41,087 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:41,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2028254793, now seen corresponding path program 1 times [2019-10-13 21:24:41,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:41,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586134248] [2019-10-13 21:24:41,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:41,225 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:41,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586134248] [2019-10-13 21:24:41,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:41,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:41,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518104930] [2019-10-13 21:24:41,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:41,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:41,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:41,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:41,228 INFO L87 Difference]: Start difference. First operand 6512 states and 10016 transitions. Second operand 4 states. [2019-10-13 21:24:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:41,581 INFO L93 Difference]: Finished difference Result 10292 states and 15865 transitions. [2019-10-13 21:24:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:41,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 21:24:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:41,625 INFO L225 Difference]: With dead ends: 10292 [2019-10-13 21:24:41,625 INFO L226 Difference]: Without dead ends: 5311 [2019-10-13 21:24:41,636 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:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-10-13 21:24:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5311. [2019-10-13 21:24:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-10-13 21:24:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 8136 transitions. [2019-10-13 21:24:41,913 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 8136 transitions. Word has length 111 [2019-10-13 21:24:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:41,913 INFO L462 AbstractCegarLoop]: Abstraction has 5311 states and 8136 transitions. [2019-10-13 21:24:41,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 8136 transitions. [2019-10-13 21:24:41,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:24:41,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:41,918 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:41,918 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:41,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:41,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1274580373, now seen corresponding path program 1 times [2019-10-13 21:24:41,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:41,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512792339] [2019-10-13 21:24:41,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:42,083 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:42,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512792339] [2019-10-13 21:24:42,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:42,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:42,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581069115] [2019-10-13 21:24:42,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:42,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:42,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:42,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:42,085 INFO L87 Difference]: Start difference. First operand 5311 states and 8136 transitions. Second operand 3 states. [2019-10-13 21:24:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:42,512 INFO L93 Difference]: Finished difference Result 13935 states and 21751 transitions. [2019-10-13 21:24:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:42,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-13 21:24:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:42,536 INFO L225 Difference]: With dead ends: 13935 [2019-10-13 21:24:42,536 INFO L226 Difference]: Without dead ends: 8965 [2019-10-13 21:24:42,549 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:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-10-13 21:24:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8683. [2019-10-13 21:24:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-10-13 21:24:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 13503 transitions. [2019-10-13 21:24:43,083 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 13503 transitions. Word has length 113 [2019-10-13 21:24:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:43,083 INFO L462 AbstractCegarLoop]: Abstraction has 8683 states and 13503 transitions. [2019-10-13 21:24:43,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 13503 transitions. [2019-10-13 21:24:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:24:43,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:43,087 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:43,087 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash 723633182, now seen corresponding path program 1 times [2019-10-13 21:24:43,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:43,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747206120] [2019-10-13 21:24:43,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:43,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:43,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:43,245 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:43,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747206120] [2019-10-13 21:24:43,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:43,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:43,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937120986] [2019-10-13 21:24:43,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:43,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:43,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:43,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:43,247 INFO L87 Difference]: Start difference. First operand 8683 states and 13503 transitions. Second operand 4 states. [2019-10-13 21:24:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:44,159 INFO L93 Difference]: Finished difference Result 24205 states and 37580 transitions. [2019-10-13 21:24:44,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:44,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:24:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:44,204 INFO L225 Difference]: With dead ends: 24205 [2019-10-13 21:24:44,204 INFO L226 Difference]: Without dead ends: 15565 [2019-10-13 21:24:44,223 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:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2019-10-13 21:24:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15563. [2019-10-13 21:24:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-10-13 21:24:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23928 transitions. [2019-10-13 21:24:45,071 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23928 transitions. Word has length 114 [2019-10-13 21:24:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:45,071 INFO L462 AbstractCegarLoop]: Abstraction has 15563 states and 23928 transitions. [2019-10-13 21:24:45,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23928 transitions. [2019-10-13 21:24:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:24:45,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:45,077 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] [2019-10-13 21:24:45,078 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1996953920, now seen corresponding path program 1 times [2019-10-13 21:24:45,078 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:45,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183534070] [2019-10-13 21:24:45,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:45,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:45,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:45,132 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:45,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183534070] [2019-10-13 21:24:45,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:45,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:45,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129115249] [2019-10-13 21:24:45,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:45,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:45,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:45,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:45,134 INFO L87 Difference]: Start difference. First operand 15563 states and 23928 transitions. Second operand 3 states. [2019-10-13 21:24:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:47,273 INFO L93 Difference]: Finished difference Result 46487 states and 71527 transitions. [2019-10-13 21:24:47,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:47,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-13 21:24:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:47,366 INFO L225 Difference]: With dead ends: 46487 [2019-10-13 21:24:47,366 INFO L226 Difference]: Without dead ends: 31034 [2019-10-13 21:24:47,393 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:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31034 states. [2019-10-13 21:24:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31034 to 15569. [2019-10-13 21:24:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15569 states. [2019-10-13 21:24:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15569 states to 15569 states and 23934 transitions. [2019-10-13 21:24:48,230 INFO L78 Accepts]: Start accepts. Automaton has 15569 states and 23934 transitions. Word has length 115 [2019-10-13 21:24:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:48,231 INFO L462 AbstractCegarLoop]: Abstraction has 15569 states and 23934 transitions. [2019-10-13 21:24:48,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15569 states and 23934 transitions. [2019-10-13 21:24:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:24:48,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:48,237 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] [2019-10-13 21:24:48,237 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1312027809, now seen corresponding path program 1 times [2019-10-13 21:24:48,238 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:48,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517755372] [2019-10-13 21:24:48,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:48,351 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:48,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517755372] [2019-10-13 21:24:48,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:48,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:48,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714902459] [2019-10-13 21:24:48,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:48,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:48,354 INFO L87 Difference]: Start difference. First operand 15569 states and 23934 transitions. Second operand 4 states. [2019-10-13 21:24:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:48,937 INFO L93 Difference]: Finished difference Result 31096 states and 47812 transitions. [2019-10-13 21:24:48,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:48,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-13 21:24:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:48,975 INFO L225 Difference]: With dead ends: 31096 [2019-10-13 21:24:48,975 INFO L226 Difference]: Without dead ends: 15563 [2019-10-13 21:24:49,003 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:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-10-13 21:24:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15563. [2019-10-13 21:24:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-10-13 21:24:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23922 transitions. [2019-10-13 21:24:49,896 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23922 transitions. Word has length 116 [2019-10-13 21:24:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,897 INFO L462 AbstractCegarLoop]: Abstraction has 15563 states and 23922 transitions. [2019-10-13 21:24:49,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23922 transitions. [2019-10-13 21:24:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:24:49,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,903 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] [2019-10-13 21:24:49,903 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1204434274, now seen corresponding path program 1 times [2019-10-13 21:24:49,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311033695] [2019-10-13 21:24:49,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,993 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:49,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311033695] [2019-10-13 21:24:49,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:49,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078020570] [2019-10-13 21:24:49,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:49,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:49,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:49,999 INFO L87 Difference]: Start difference. First operand 15563 states and 23922 transitions. Second operand 3 states. [2019-10-13 21:24:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,023 INFO L93 Difference]: Finished difference Result 37297 states and 57457 transitions. [2019-10-13 21:24:51,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:51,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-13 21:24:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,072 INFO L225 Difference]: With dead ends: 37297 [2019-10-13 21:24:51,072 INFO L226 Difference]: Without dead ends: 22487 [2019-10-13 21:24:51,094 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:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22487 states. [2019-10-13 21:24:52,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22487 to 22485. [2019-10-13 21:24:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22485 states. [2019-10-13 21:24:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22485 states to 22485 states and 34047 transitions. [2019-10-13 21:24:52,326 INFO L78 Accepts]: Start accepts. Automaton has 22485 states and 34047 transitions. Word has length 116 [2019-10-13 21:24:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:52,326 INFO L462 AbstractCegarLoop]: Abstraction has 22485 states and 34047 transitions. [2019-10-13 21:24:52,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 22485 states and 34047 transitions. [2019-10-13 21:24:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:24:52,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:52,334 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:52,334 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash 306834164, now seen corresponding path program 1 times [2019-10-13 21:24:52,335 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:52,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014558416] [2019-10-13 21:24:52,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:52,427 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:52,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014558416] [2019-10-13 21:24:52,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:52,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:52,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737160495] [2019-10-13 21:24:52,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:52,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:52,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:52,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:52,430 INFO L87 Difference]: Start difference. First operand 22485 states and 34047 transitions. Second operand 3 states. [2019-10-13 21:24:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,746 INFO L93 Difference]: Finished difference Result 61641 states and 95217 transitions. [2019-10-13 21:24:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:54,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-13 21:24:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,829 INFO L225 Difference]: With dead ends: 61641 [2019-10-13 21:24:54,829 INFO L226 Difference]: Without dead ends: 42063 [2019-10-13 21:24:54,862 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:54,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42063 states. [2019-10-13 21:24:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42063 to 41977. [2019-10-13 21:24:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41977 states. [2019-10-13 21:24:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41977 states to 41977 states and 63515 transitions. [2019-10-13 21:24:56,920 INFO L78 Accepts]: Start accepts. Automaton has 41977 states and 63515 transitions. Word has length 119 [2019-10-13 21:24:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:56,920 INFO L462 AbstractCegarLoop]: Abstraction has 41977 states and 63515 transitions. [2019-10-13 21:24:56,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 41977 states and 63515 transitions. [2019-10-13 21:24:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:24:56,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:56,926 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:56,927 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:56,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2137277520, now seen corresponding path program 1 times [2019-10-13 21:24:56,927 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:56,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310906482] [2019-10-13 21:24:56,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:57,211 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:57,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310906482] [2019-10-13 21:24:57,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:57,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:24:57,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428273726] [2019-10-13 21:24:57,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:24:57,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:24:57,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:24:57,213 INFO L87 Difference]: Start difference. First operand 41977 states and 63515 transitions. Second operand 12 states. [2019-10-13 21:25:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:05,186 INFO L93 Difference]: Finished difference Result 157307 states and 240454 transitions. [2019-10-13 21:25:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:05,187 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2019-10-13 21:25:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:05,443 INFO L225 Difference]: With dead ends: 157307 [2019-10-13 21:25:05,443 INFO L226 Difference]: Without dead ends: 117623 [2019-10-13 21:25:05,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:25:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117623 states.