/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:04:33,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:04:33,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:04:33,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:04:33,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:04:33,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:04:33,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:04:33,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:04:33,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:04:33,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:04:33,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:04:33,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:04:33,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:04:33,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:04:33,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:04:33,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:04:33,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:04:33,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:04:33,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:04:33,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:04:33,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:04:33,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:04:33,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:04:33,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:04:33,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:04:33,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:04:33,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:04:33,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:04:33,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:04:33,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:04:33,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:04:33,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:04:33,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:04:33,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:04:33,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:04:33,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:04:33,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:04:33,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:04:33,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:04:33,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:04:33,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:04:33,511 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-11-07 01:04:33,525 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:04:33,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:04:33,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:04:33,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:04:33,527 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:04:33,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:04:33,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:04:33,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:04:33,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:04:33,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:04:33,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:04:33,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:04:33,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:04:33,529 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:04:33,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:04:33,530 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:04:33,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:04:33,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:04:33,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:04:33,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:04:33,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:04:33,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:04:33,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:04:33,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:04:33,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:04:33,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:04:33,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:04:33,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:04:33,532 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-11-07 01:04:33,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:04:33,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:04:33,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:04:33,856 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:04:33,856 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:04:33,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:04:33,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14108236c/d319245864fa4e64bb6822e11ce81183/FLAG8deacb0d1 [2019-11-07 01:04:34,489 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:04:34,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:04:34,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14108236c/d319245864fa4e64bb6822e11ce81183/FLAG8deacb0d1 [2019-11-07 01:04:34,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14108236c/d319245864fa4e64bb6822e11ce81183 [2019-11-07 01:04:34,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:04:34,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:04:34,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:34,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:04:34,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:04:34,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:34" (1/1) ... [2019-11-07 01:04:34,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789b381a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:34, skipping insertion in model container [2019-11-07 01:04:34,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:34" (1/1) ... [2019-11-07 01:04:34,819 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:04:34,863 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:04:35,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:35,327 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:04:35,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:35,463 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:04:35,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35 WrapperNode [2019-11-07 01:04:35,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:35,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:04:35,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:04:35,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:04:35,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (1/1) ... [2019-11-07 01:04:35,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (1/1) ... [2019-11-07 01:04:35,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (1/1) ... [2019-11-07 01:04:35,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (1/1) ... [2019-11-07 01:04:35,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (1/1) ... [2019-11-07 01:04:35,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (1/1) ... [2019-11-07 01:04:35,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (1/1) ... [2019-11-07 01:04:35,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:04:35,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:04:35,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:04:35,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:04:35,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (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-11-07 01:04:35,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:04:35,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:04:35,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:04:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:04:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:04:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:04:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:04:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:04:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:04:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:04:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:04:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:04:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:04:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:04:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:04:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:04:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:04:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:04:36,870 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:04:36,871 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:04:36,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:36 BoogieIcfgContainer [2019-11-07 01:04:36,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:04:36,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:04:36,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:04:36,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:04:36,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:34" (1/3) ... [2019-11-07 01:04:36,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d566c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:36, skipping insertion in model container [2019-11-07 01:04:36,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:35" (2/3) ... [2019-11-07 01:04:36,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d566c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:36, skipping insertion in model container [2019-11-07 01:04:36,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:36" (3/3) ... [2019-11-07 01:04:36,881 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:04:36,890 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:04:36,899 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:04:36,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:04:36,937 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:04:36,938 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:04:36,938 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:04:36,938 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:04:36,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:04:36,939 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:04:36,939 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:04:36,939 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:04:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states. [2019-11-07 01:04:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 01:04:36,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:36,977 INFO L410 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] [2019-11-07 01:04:36,979 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash 343036633, now seen corresponding path program 1 times [2019-11-07 01:04:36,991 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:36,991 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030725978] [2019-11-07 01:04:36,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:37,667 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030725978] [2019-11-07 01:04:37,668 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:37,668 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:37,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308112043] [2019-11-07 01:04:37,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:37,677 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:37,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:37,695 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 4 states. [2019-11-07 01:04:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:37,941 INFO L93 Difference]: Finished difference Result 636 states and 1118 transitions. [2019-11-07 01:04:37,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:04:37,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-07 01:04:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:37,961 INFO L225 Difference]: With dead ends: 636 [2019-11-07 01:04:37,962 INFO L226 Difference]: Without dead ends: 418 [2019-11-07 01:04:37,967 INFO L630 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-11-07 01:04:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-07 01:04:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2019-11-07 01:04:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-07 01:04:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 609 transitions. [2019-11-07 01:04:38,065 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 609 transitions. Word has length 98 [2019-11-07 01:04:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:38,066 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 609 transitions. [2019-11-07 01:04:38,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 609 transitions. [2019-11-07 01:04:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-07 01:04:38,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:38,075 INFO L410 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] [2019-11-07 01:04:38,078 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:38,079 INFO L82 PathProgramCache]: Analyzing trace with hash -936762471, now seen corresponding path program 1 times [2019-11-07 01:04:38,079 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:38,079 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53510813] [2019-11-07 01:04:38,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:38,240 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53510813] [2019-11-07 01:04:38,240 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:38,240 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:38,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748046868] [2019-11-07 01:04:38,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:38,243 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:38,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:38,244 INFO L87 Difference]: Start difference. First operand 416 states and 609 transitions. Second operand 3 states. [2019-11-07 01:04:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:38,319 INFO L93 Difference]: Finished difference Result 1202 states and 1757 transitions. [2019-11-07 01:04:38,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:38,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-07 01:04:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:38,326 INFO L225 Difference]: With dead ends: 1202 [2019-11-07 01:04:38,326 INFO L226 Difference]: Without dead ends: 818 [2019-11-07 01:04:38,330 INFO L630 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-11-07 01:04:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-07 01:04:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 418. [2019-11-07 01:04:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-07 01:04:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-11-07 01:04:38,433 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 99 [2019-11-07 01:04:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:38,435 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-11-07 01:04:38,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-11-07 01:04:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-07 01:04:38,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:38,445 INFO L410 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] [2019-11-07 01:04:38,446 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:38,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1773874167, now seen corresponding path program 1 times [2019-11-07 01:04:38,447 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:38,448 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244224498] [2019-11-07 01:04:38,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:38,588 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244224498] [2019-11-07 01:04:38,589 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:38,589 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:38,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027770703] [2019-11-07 01:04:38,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:38,590 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:38,591 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 3 states. [2019-11-07 01:04:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:38,672 INFO L93 Difference]: Finished difference Result 1038 states and 1538 transitions. [2019-11-07 01:04:38,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:38,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-07 01:04:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:38,679 INFO L225 Difference]: With dead ends: 1038 [2019-11-07 01:04:38,679 INFO L226 Difference]: Without dead ends: 802 [2019-11-07 01:04:38,689 INFO L630 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-11-07 01:04:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-11-07 01:04:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2019-11-07 01:04:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-11-07 01:04:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1163 transitions. [2019-11-07 01:04:38,741 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1163 transitions. Word has length 100 [2019-11-07 01:04:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:38,742 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1163 transitions. [2019-11-07 01:04:38,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1163 transitions. [2019-11-07 01:04:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-07 01:04:38,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:38,750 INFO L410 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] [2019-11-07 01:04:38,750 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:38,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:38,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1816624602, now seen corresponding path program 1 times [2019-11-07 01:04:38,751 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:38,751 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458188590] [2019-11-07 01:04:38,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:38,900 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458188590] [2019-11-07 01:04:38,900 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:38,900 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:38,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123400622] [2019-11-07 01:04:38,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:38,901 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:38,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:38,902 INFO L87 Difference]: Start difference. First operand 800 states and 1163 transitions. Second operand 4 states. [2019-11-07 01:04:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:38,959 INFO L93 Difference]: Finished difference Result 1239 states and 1819 transitions. [2019-11-07 01:04:38,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:38,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-07 01:04:38,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:38,963 INFO L225 Difference]: With dead ends: 1239 [2019-11-07 01:04:38,964 INFO L226 Difference]: Without dead ends: 611 [2019-11-07 01:04:38,965 INFO L630 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-11-07 01:04:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-07 01:04:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-11-07 01:04:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-07 01:04:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 883 transitions. [2019-11-07 01:04:38,998 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 883 transitions. Word has length 100 [2019-11-07 01:04:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:38,999 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 883 transitions. [2019-11-07 01:04:38,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 883 transitions. [2019-11-07 01:04:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-07 01:04:39,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:39,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:39,001 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:39,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1713248280, now seen corresponding path program 1 times [2019-11-07 01:04:39,002 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:39,002 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556653870] [2019-11-07 01:04:39,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:39,234 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556653870] [2019-11-07 01:04:39,234 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:39,234 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:39,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532060689] [2019-11-07 01:04:39,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:39,235 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:39,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:39,236 INFO L87 Difference]: Start difference. First operand 611 states and 883 transitions. Second operand 4 states. [2019-11-07 01:04:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:39,363 INFO L93 Difference]: Finished difference Result 1485 states and 2148 transitions. [2019-11-07 01:04:39,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:39,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-07 01:04:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:39,369 INFO L225 Difference]: With dead ends: 1485 [2019-11-07 01:04:39,369 INFO L226 Difference]: Without dead ends: 897 [2019-11-07 01:04:39,371 INFO L630 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-11-07 01:04:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-07 01:04:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 895. [2019-11-07 01:04:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-07 01:04:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1282 transitions. [2019-11-07 01:04:39,423 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1282 transitions. Word has length 102 [2019-11-07 01:04:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:39,424 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1282 transitions. [2019-11-07 01:04:39,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1282 transitions. [2019-11-07 01:04:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:04:39,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:39,426 INFO L410 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-11-07 01:04:39,426 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1610605002, now seen corresponding path program 1 times [2019-11-07 01:04:39,427 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:39,427 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173522317] [2019-11-07 01:04:39,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:39,516 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173522317] [2019-11-07 01:04:39,517 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:39,517 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:39,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922605839] [2019-11-07 01:04:39,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:39,518 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:39,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:39,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:39,518 INFO L87 Difference]: Start difference. First operand 895 states and 1282 transitions. Second operand 3 states. [2019-11-07 01:04:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:39,674 INFO L93 Difference]: Finished difference Result 2174 states and 3182 transitions. [2019-11-07 01:04:39,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:39,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-07 01:04:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:39,687 INFO L225 Difference]: With dead ends: 2174 [2019-11-07 01:04:39,687 INFO L226 Difference]: Without dead ends: 1607 [2019-11-07 01:04:39,690 INFO L630 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-11-07 01:04:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-11-07 01:04:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1605. [2019-11-07 01:04:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-11-07 01:04:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2301 transitions. [2019-11-07 01:04:39,843 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2301 transitions. Word has length 104 [2019-11-07 01:04:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:39,844 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 2301 transitions. [2019-11-07 01:04:39,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2301 transitions. [2019-11-07 01:04:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:04:39,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:39,848 INFO L410 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-11-07 01:04:39,848 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:39,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash -817857369, now seen corresponding path program 1 times [2019-11-07 01:04:39,849 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:39,849 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109455571] [2019-11-07 01:04:39,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:40,042 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109455571] [2019-11-07 01:04:40,043 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:40,043 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:40,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973705221] [2019-11-07 01:04:40,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:40,044 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:40,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:40,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:40,046 INFO L87 Difference]: Start difference. First operand 1605 states and 2301 transitions. Second operand 4 states. [2019-11-07 01:04:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:40,183 INFO L93 Difference]: Finished difference Result 2391 states and 3456 transitions. [2019-11-07 01:04:40,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:40,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-07 01:04:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:40,192 INFO L225 Difference]: With dead ends: 2391 [2019-11-07 01:04:40,192 INFO L226 Difference]: Without dead ends: 1319 [2019-11-07 01:04:40,196 INFO L630 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-11-07 01:04:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-07 01:04:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2019-11-07 01:04:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-11-07 01:04:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1881 transitions. [2019-11-07 01:04:40,303 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1881 transitions. Word has length 104 [2019-11-07 01:04:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:40,303 INFO L462 AbstractCegarLoop]: Abstraction has 1319 states and 1881 transitions. [2019-11-07 01:04:40,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1881 transitions. [2019-11-07 01:04:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:04:40,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:40,306 INFO L410 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-11-07 01:04:40,307 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash 669169858, now seen corresponding path program 1 times [2019-11-07 01:04:40,307 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:40,308 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848165228] [2019-11-07 01:04:40,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:40,433 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848165228] [2019-11-07 01:04:40,433 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:40,434 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:40,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099078952] [2019-11-07 01:04:40,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:40,435 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:40,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:40,435 INFO L87 Difference]: Start difference. First operand 1319 states and 1881 transitions. Second operand 3 states. [2019-11-07 01:04:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:40,787 INFO L93 Difference]: Finished difference Result 3197 states and 4694 transitions. [2019-11-07 01:04:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:40,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-07 01:04:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:40,800 INFO L225 Difference]: With dead ends: 3197 [2019-11-07 01:04:40,800 INFO L226 Difference]: Without dead ends: 2376 [2019-11-07 01:04:40,803 INFO L630 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-11-07 01:04:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-11-07 01:04:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2374. [2019-11-07 01:04:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-11-07 01:04:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3419 transitions. [2019-11-07 01:04:40,956 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3419 transitions. Word has length 106 [2019-11-07 01:04:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:40,957 INFO L462 AbstractCegarLoop]: Abstraction has 2374 states and 3419 transitions. [2019-11-07 01:04:40,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3419 transitions. [2019-11-07 01:04:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:04:40,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:40,962 INFO L410 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-11-07 01:04:40,962 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:40,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash -53512537, now seen corresponding path program 1 times [2019-11-07 01:04:40,962 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:40,963 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822452624] [2019-11-07 01:04:40,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:41,123 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822452624] [2019-11-07 01:04:41,125 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:41,151 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:41,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101630986] [2019-11-07 01:04:41,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:41,153 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:41,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:41,154 INFO L87 Difference]: Start difference. First operand 2374 states and 3419 transitions. Second operand 4 states. [2019-11-07 01:04:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:41,467 INFO L93 Difference]: Finished difference Result 6864 states and 9875 transitions. [2019-11-07 01:04:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:41,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-07 01:04:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:41,493 INFO L225 Difference]: With dead ends: 6864 [2019-11-07 01:04:41,494 INFO L226 Difference]: Without dead ends: 4533 [2019-11-07 01:04:41,500 INFO L630 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-11-07 01:04:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-11-07 01:04:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4531. [2019-11-07 01:04:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-11-07 01:04:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6454 transitions. [2019-11-07 01:04:41,763 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6454 transitions. Word has length 106 [2019-11-07 01:04:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:41,764 INFO L462 AbstractCegarLoop]: Abstraction has 4531 states and 6454 transitions. [2019-11-07 01:04:41,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6454 transitions. [2019-11-07 01:04:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 01:04:41,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:41,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:41,772 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:41,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2125527721, now seen corresponding path program 1 times [2019-11-07 01:04:41,772 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:41,773 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807128441] [2019-11-07 01:04:41,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:41,871 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807128441] [2019-11-07 01:04:41,872 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:41,872 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:41,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274065045] [2019-11-07 01:04:41,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:41,873 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:41,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:41,877 INFO L87 Difference]: Start difference. First operand 4531 states and 6454 transitions. Second operand 3 states. [2019-11-07 01:04:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:42,337 INFO L93 Difference]: Finished difference Result 13393 states and 19105 transitions. [2019-11-07 01:04:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:42,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-07 01:04:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:42,384 INFO L225 Difference]: With dead ends: 13393 [2019-11-07 01:04:42,384 INFO L226 Difference]: Without dead ends: 8971 [2019-11-07 01:04:42,400 INFO L630 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-11-07 01:04:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2019-11-07 01:04:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 4537. [2019-11-07 01:04:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-11-07 01:04:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 6460 transitions. [2019-11-07 01:04:42,860 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 6460 transitions. Word has length 107 [2019-11-07 01:04:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:42,860 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 6460 transitions. [2019-11-07 01:04:42,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 6460 transitions. [2019-11-07 01:04:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-07 01:04:42,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:42,870 INFO L410 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-11-07 01:04:42,870 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash -871367960, now seen corresponding path program 1 times [2019-11-07 01:04:42,871 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:42,871 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50235010] [2019-11-07 01:04:42,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:43,020 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50235010] [2019-11-07 01:04:43,020 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:43,020 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:43,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040052234] [2019-11-07 01:04:43,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:43,021 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:43,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:43,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:43,021 INFO L87 Difference]: Start difference. First operand 4537 states and 6460 transitions. Second operand 4 states. [2019-11-07 01:04:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:43,381 INFO L93 Difference]: Finished difference Result 9032 states and 12864 transitions. [2019-11-07 01:04:43,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:43,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-07 01:04:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:43,402 INFO L225 Difference]: With dead ends: 9032 [2019-11-07 01:04:43,402 INFO L226 Difference]: Without dead ends: 4531 [2019-11-07 01:04:43,410 INFO L630 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-11-07 01:04:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2019-11-07 01:04:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4531. [2019-11-07 01:04:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-11-07 01:04:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6448 transitions. [2019-11-07 01:04:43,671 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6448 transitions. Word has length 108 [2019-11-07 01:04:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:43,671 INFO L462 AbstractCegarLoop]: Abstraction has 4531 states and 6448 transitions. [2019-11-07 01:04:43,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6448 transitions. [2019-11-07 01:04:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-07 01:04:43,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:43,678 INFO L410 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-11-07 01:04:43,678 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1746692037, now seen corresponding path program 1 times [2019-11-07 01:04:43,679 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:43,679 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011883567] [2019-11-07 01:04:43,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:43,771 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011883567] [2019-11-07 01:04:43,771 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:43,771 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:43,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726674910] [2019-11-07 01:04:43,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:43,772 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:43,773 INFO L87 Difference]: Start difference. First operand 4531 states and 6448 transitions. Second operand 3 states. [2019-11-07 01:04:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:44,195 INFO L93 Difference]: Finished difference Result 10307 states and 14773 transitions. [2019-11-07 01:04:44,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:44,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-07 01:04:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:44,217 INFO L225 Difference]: With dead ends: 10307 [2019-11-07 01:04:44,217 INFO L226 Difference]: Without dead ends: 6717 [2019-11-07 01:04:44,225 INFO L630 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-11-07 01:04:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2019-11-07 01:04:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 6715. [2019-11-07 01:04:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6715 states. [2019-11-07 01:04:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 9383 transitions. [2019-11-07 01:04:44,683 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 9383 transitions. Word has length 108 [2019-11-07 01:04:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:44,684 INFO L462 AbstractCegarLoop]: Abstraction has 6715 states and 9383 transitions. [2019-11-07 01:04:44,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 9383 transitions. [2019-11-07 01:04:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-07 01:04:44,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:44,692 INFO L410 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] [2019-11-07 01:04:44,693 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:44,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:44,693 INFO L82 PathProgramCache]: Analyzing trace with hash -848505304, now seen corresponding path program 1 times [2019-11-07 01:04:44,693 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:44,693 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772106255] [2019-11-07 01:04:44,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:44,829 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772106255] [2019-11-07 01:04:44,830 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:44,830 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:44,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750113542] [2019-11-07 01:04:44,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:44,831 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:44,831 INFO L87 Difference]: Start difference. First operand 6715 states and 9383 transitions. Second operand 4 states. [2019-11-07 01:04:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:45,459 INFO L93 Difference]: Finished difference Result 12456 states and 17427 transitions. [2019-11-07 01:04:45,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:45,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-07 01:04:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:45,480 INFO L225 Difference]: With dead ends: 12456 [2019-11-07 01:04:45,480 INFO L226 Difference]: Without dead ends: 6092 [2019-11-07 01:04:45,494 INFO L630 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-11-07 01:04:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6092 states. [2019-11-07 01:04:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6092 to 6023. [2019-11-07 01:04:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6023 states. [2019-11-07 01:04:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6023 states to 6023 states and 8366 transitions. [2019-11-07 01:04:45,872 INFO L78 Accepts]: Start accepts. Automaton has 6023 states and 8366 transitions. Word has length 110 [2019-11-07 01:04:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:45,873 INFO L462 AbstractCegarLoop]: Abstraction has 6023 states and 8366 transitions. [2019-11-07 01:04:45,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 6023 states and 8366 transitions. [2019-11-07 01:04:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-07 01:04:45,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:45,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:45,882 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1621946400, now seen corresponding path program 1 times [2019-11-07 01:04:45,882 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:45,882 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701002430] [2019-11-07 01:04:45,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:45,947 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701002430] [2019-11-07 01:04:45,947 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:45,947 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:45,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680442720] [2019-11-07 01:04:45,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:45,948 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:45,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:45,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:45,949 INFO L87 Difference]: Start difference. First operand 6023 states and 8366 transitions. Second operand 3 states. [2019-11-07 01:04:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:46,752 INFO L93 Difference]: Finished difference Result 14841 states and 21156 transitions. [2019-11-07 01:04:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:46,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-07 01:04:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:46,778 INFO L225 Difference]: With dead ends: 14841 [2019-11-07 01:04:46,778 INFO L226 Difference]: Without dead ends: 10994 [2019-11-07 01:04:46,791 INFO L630 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-11-07 01:04:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10994 states. [2019-11-07 01:04:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10994 to 10992. [2019-11-07 01:04:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10992 states. [2019-11-07 01:04:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10992 states to 10992 states and 15347 transitions. [2019-11-07 01:04:47,578 INFO L78 Accepts]: Start accepts. Automaton has 10992 states and 15347 transitions. Word has length 112 [2019-11-07 01:04:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:47,578 INFO L462 AbstractCegarLoop]: Abstraction has 10992 states and 15347 transitions. [2019-11-07 01:04:47,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 10992 states and 15347 transitions. [2019-11-07 01:04:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-07 01:04:47,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:47,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:47,592 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 900773541, now seen corresponding path program 1 times [2019-11-07 01:04:47,593 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:47,593 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339605438] [2019-11-07 01:04:47,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:47,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339605438] [2019-11-07 01:04:47,757 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:47,757 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:47,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16551147] [2019-11-07 01:04:47,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:47,758 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:47,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:47,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:47,759 INFO L87 Difference]: Start difference. First operand 10992 states and 15347 transitions. Second operand 4 states. [2019-11-07 01:04:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:48,884 INFO L93 Difference]: Finished difference Result 22202 states and 30971 transitions. [2019-11-07 01:04:48,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:48,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-07 01:04:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:48,908 INFO L225 Difference]: With dead ends: 22202 [2019-11-07 01:04:48,908 INFO L226 Difference]: Without dead ends: 11365 [2019-11-07 01:04:48,929 INFO L630 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-11-07 01:04:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2019-11-07 01:04:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 11179. [2019-11-07 01:04:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11179 states. [2019-11-07 01:04:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11179 states to 11179 states and 15555 transitions. [2019-11-07 01:04:49,780 INFO L78 Accepts]: Start accepts. Automaton has 11179 states and 15555 transitions. Word has length 112 [2019-11-07 01:04:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:49,781 INFO L462 AbstractCegarLoop]: Abstraction has 11179 states and 15555 transitions. [2019-11-07 01:04:49,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 11179 states and 15555 transitions. [2019-11-07 01:04:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-07 01:04:49,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:49,795 INFO L410 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-11-07 01:04:49,796 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:49,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash 288500069, now seen corresponding path program 1 times [2019-11-07 01:04:49,796 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:49,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914477878] [2019-11-07 01:04:49,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:49,870 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914477878] [2019-11-07 01:04:49,872 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:49,872 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:49,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247090275] [2019-11-07 01:04:49,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:49,873 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:49,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:49,873 INFO L87 Difference]: Start difference. First operand 11179 states and 15555 transitions. Second operand 3 states. [2019-11-07 01:04:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:51,037 INFO L93 Difference]: Finished difference Result 29974 states and 41914 transitions. [2019-11-07 01:04:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:51,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-07 01:04:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:51,090 INFO L225 Difference]: With dead ends: 29974 [2019-11-07 01:04:51,091 INFO L226 Difference]: Without dead ends: 22153 [2019-11-07 01:04:51,116 INFO L630 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-11-07 01:04:51,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22153 states. [2019-11-07 01:04:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22153 to 11189. [2019-11-07 01:04:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11189 states. [2019-11-07 01:04:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 15565 transitions. [2019-11-07 01:04:51,916 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 15565 transitions. Word has length 113 [2019-11-07 01:04:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:51,916 INFO L462 AbstractCegarLoop]: Abstraction has 11189 states and 15565 transitions. [2019-11-07 01:04:51,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 15565 transitions. [2019-11-07 01:04:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:04:51,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:51,930 INFO L410 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-11-07 01:04:51,931 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:51,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash -431095923, now seen corresponding path program 1 times [2019-11-07 01:04:51,931 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:51,931 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091442831] [2019-11-07 01:04:51,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:52,201 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091442831] [2019-11-07 01:04:52,202 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:52,202 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 01:04:52,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307360231] [2019-11-07 01:04:52,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 01:04:52,203 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 01:04:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:04:52,203 INFO L87 Difference]: Start difference. First operand 11189 states and 15565 transitions. Second operand 12 states. [2019-11-07 01:04:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:55,110 INFO L93 Difference]: Finished difference Result 37443 states and 55319 transitions. [2019-11-07 01:04:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 01:04:55,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-11-07 01:04:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:55,165 INFO L225 Difference]: With dead ends: 37443 [2019-11-07 01:04:55,165 INFO L226 Difference]: Without dead ends: 30501 [2019-11-07 01:04:55,183 INFO L630 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-11-07 01:04:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30501 states. [2019-11-07 01:04:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30501 to 25435. [2019-11-07 01:04:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25435 states. [2019-11-07 01:04:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25435 states to 25435 states and 36699 transitions. [2019-11-07 01:04:56,792 INFO L78 Accepts]: Start accepts. Automaton has 25435 states and 36699 transitions. Word has length 114 [2019-11-07 01:04:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:56,793 INFO L462 AbstractCegarLoop]: Abstraction has 25435 states and 36699 transitions. [2019-11-07 01:04:56,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 01:04:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25435 states and 36699 transitions. [2019-11-07 01:04:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:04:56,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:56,814 INFO L410 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-11-07 01:04:56,814 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1784609226, now seen corresponding path program 1 times [2019-11-07 01:04:56,815 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:56,815 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036560624] [2019-11-07 01:04:56,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:56,888 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036560624] [2019-11-07 01:04:56,888 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:56,888 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:56,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163509904] [2019-11-07 01:04:56,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:56,889 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:56,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:56,889 INFO L87 Difference]: Start difference. First operand 25435 states and 36699 transitions. Second operand 3 states. [2019-11-07 01:04:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:59,942 INFO L93 Difference]: Finished difference Result 58469 states and 88539 transitions. [2019-11-07 01:04:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:59,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-07 01:04:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:00,016 INFO L225 Difference]: With dead ends: 58469 [2019-11-07 01:05:00,017 INFO L226 Difference]: Without dead ends: 41921 [2019-11-07 01:05:00,043 INFO L630 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-11-07 01:05:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41921 states. [2019-11-07 01:05:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41921 to 41919. [2019-11-07 01:05:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41919 states. [2019-11-07 01:05:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41919 states to 41919 states and 61685 transitions. [2019-11-07 01:05:02,732 INFO L78 Accepts]: Start accepts. Automaton has 41919 states and 61685 transitions. Word has length 114 [2019-11-07 01:05:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:02,732 INFO L462 AbstractCegarLoop]: Abstraction has 41919 states and 61685 transitions. [2019-11-07 01:05:02,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 41919 states and 61685 transitions. [2019-11-07 01:05:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:05:02,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:02,744 INFO L410 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-11-07 01:05:02,744 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1465323800, now seen corresponding path program 1 times [2019-11-07 01:05:02,745 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:02,745 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196945490] [2019-11-07 01:05:02,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:02,910 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196945490] [2019-11-07 01:05:02,910 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:02,910 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:05:02,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850441805] [2019-11-07 01:05:02,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:05:02,911 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:05:02,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:02,911 INFO L87 Difference]: Start difference. First operand 41919 states and 61685 transitions. Second operand 8 states. [2019-11-07 01:05:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:07,567 INFO L93 Difference]: Finished difference Result 97743 states and 147918 transitions. [2019-11-07 01:05:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:07,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-11-07 01:05:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:07,651 INFO L225 Difference]: With dead ends: 97743 [2019-11-07 01:05:07,652 INFO L226 Difference]: Without dead ends: 64072 [2019-11-07 01:05:07,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64072 states.