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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:05:38,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:05:38,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:05:38,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:05:38,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:05:38,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:05:38,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:05:38,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:05:38,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:05:38,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:05:38,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:05:38,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:05:38,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:05:38,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:05:38,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:05:38,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:05:38,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:05:38,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:05:38,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:05:38,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:05:38,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:05:38,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:05:38,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:05:38,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:05:38,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:05:38,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:05:38,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:05:38,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:05:38,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:05:38,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:05:38,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:05:38,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:05:38,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:05:38,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:05:38,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:05:38,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:05:38,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:05:38,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:05:38,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:05:38,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:05:38,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:05:38,732 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:05:38,747 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:05:38,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:05:38,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:05:38,751 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:05:38,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:05:38,752 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:05:38,752 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:05:38,753 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:05:38,753 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:05:38,753 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:05:38,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:05:38,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:05:38,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:05:38,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:05:38,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:05:38,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:05:38,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:05:38,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:05:38,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:05:38,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:05:38,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:05:38,757 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:05:38,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:05:38,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:05:38,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:05:38,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:05:38,758 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:05:38,758 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:05:38,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:05:38,759 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:05:38,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:05:38,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:05:38,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:05:38,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:05:38,824 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:05:38,825 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:05:38,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff19d8cb6/2e101a21a36241b8b1d33058a8dbedbd/FLAGb57f52221 [2019-09-10 07:05:39,365 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:05:39,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:05:39,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff19d8cb6/2e101a21a36241b8b1d33058a8dbedbd/FLAGb57f52221 [2019-09-10 07:05:39,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff19d8cb6/2e101a21a36241b8b1d33058a8dbedbd [2019-09-10 07:05:39,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:05:39,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:05:39,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:05:39,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:05:39,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:05:39,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:05:39" (1/1) ... [2019-09-10 07:05:39,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bec8495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:39, skipping insertion in model container [2019-09-10 07:05:39,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:05:39" (1/1) ... [2019-09-10 07:05:39,740 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:05:39,788 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:05:40,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:05:40,370 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:05:40,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:05:40,460 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:05:40,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40 WrapperNode [2019-09-10 07:05:40,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:05:40,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:05:40,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:05:40,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:05:40,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (1/1) ... [2019-09-10 07:05:40,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (1/1) ... [2019-09-10 07:05:40,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (1/1) ... [2019-09-10 07:05:40,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (1/1) ... [2019-09-10 07:05:40,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (1/1) ... [2019-09-10 07:05:40,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (1/1) ... [2019-09-10 07:05:40,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (1/1) ... [2019-09-10 07:05:40,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:05:40,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:05:40,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:05:40,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:05:40,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (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-09-10 07:05:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:05:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:05:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:05:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:05:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:05:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:05:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:05:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:05:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:05:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:05:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:05:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:05:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:05:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:05:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:05:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:05:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:05:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:05:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:05:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:05:41,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:05:41,382 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:05:41,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:05:41 BoogieIcfgContainer [2019-09-10 07:05:41,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:05:41,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:05:41,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:05:41,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:05:41,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:05:39" (1/3) ... [2019-09-10 07:05:41,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2a0557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:05:41, skipping insertion in model container [2019-09-10 07:05:41,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:05:40" (2/3) ... [2019-09-10 07:05:41,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2a0557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:05:41, skipping insertion in model container [2019-09-10 07:05:41,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:05:41" (3/3) ... [2019-09-10 07:05:41,392 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:05:41,401 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:05:41,409 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:05:41,429 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:05:41,455 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:05:41,455 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:05:41,456 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:05:41,456 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:05:41,456 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:05:41,456 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:05:41,457 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:05:41,457 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:05:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-10 07:05:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:05:41,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:41,489 INFO L399 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] [2019-09-10 07:05:41,491 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1503365547, now seen corresponding path program 1 times [2019-09-10 07:05:41,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:41,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:41,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:41,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:41,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:41,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:41,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:41,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:41,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:41,987 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-09-10 07:05:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:42,093 INFO L93 Difference]: Finished difference Result 227 states and 365 transitions. [2019-09-10 07:05:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:42,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 07:05:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:42,122 INFO L225 Difference]: With dead ends: 227 [2019-09-10 07:05:42,122 INFO L226 Difference]: Without dead ends: 219 [2019-09-10 07:05:42,125 INFO L628 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-09-10 07:05:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-10 07:05:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-09-10 07:05:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-10 07:05:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 323 transitions. [2019-09-10 07:05:42,204 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 323 transitions. Word has length 64 [2019-09-10 07:05:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:42,204 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 323 transitions. [2019-09-10 07:05:42,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 323 transitions. [2019-09-10 07:05:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:05:42,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:42,208 INFO L399 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] [2019-09-10 07:05:42,208 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:42,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1067938911, now seen corresponding path program 1 times [2019-09-10 07:05:42,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:42,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:42,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:42,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:42,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:42,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:42,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:42,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:42,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:42,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:42,374 INFO L87 Difference]: Start difference. First operand 217 states and 323 transitions. Second operand 3 states. [2019-09-10 07:05:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:42,422 INFO L93 Difference]: Finished difference Result 363 states and 553 transitions. [2019-09-10 07:05:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:42,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:05:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:42,430 INFO L225 Difference]: With dead ends: 363 [2019-09-10 07:05:42,430 INFO L226 Difference]: Without dead ends: 363 [2019-09-10 07:05:42,432 INFO L628 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-09-10 07:05:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-10 07:05:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-09-10 07:05:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-10 07:05:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2019-09-10 07:05:42,459 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 65 [2019-09-10 07:05:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:42,459 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2019-09-10 07:05:42,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2019-09-10 07:05:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:05:42,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:42,462 INFO L399 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] [2019-09-10 07:05:42,462 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:42,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:42,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2132718422, now seen corresponding path program 1 times [2019-09-10 07:05:42,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:42,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:42,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:42,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:42,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:42,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:42,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:42,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:42,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:42,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:42,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:42,585 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand 3 states. [2019-09-10 07:05:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:42,624 INFO L93 Difference]: Finished difference Result 619 states and 957 transitions. [2019-09-10 07:05:42,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:42,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 07:05:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:42,629 INFO L225 Difference]: With dead ends: 619 [2019-09-10 07:05:42,629 INFO L226 Difference]: Without dead ends: 619 [2019-09-10 07:05:42,630 INFO L628 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-09-10 07:05:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-10 07:05:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2019-09-10 07:05:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-10 07:05:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 956 transitions. [2019-09-10 07:05:42,664 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 956 transitions. Word has length 66 [2019-09-10 07:05:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:42,665 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 956 transitions. [2019-09-10 07:05:42,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 956 transitions. [2019-09-10 07:05:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:05:42,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:42,671 INFO L399 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] [2019-09-10 07:05:42,671 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash -523046956, now seen corresponding path program 1 times [2019-09-10 07:05:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:42,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:42,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:42,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:42,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:42,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:42,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:42,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:42,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:42,803 INFO L87 Difference]: Start difference. First operand 617 states and 956 transitions. Second operand 3 states. [2019-09-10 07:05:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:42,828 INFO L93 Difference]: Finished difference Result 1067 states and 1657 transitions. [2019-09-10 07:05:42,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:42,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 07:05:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:42,836 INFO L225 Difference]: With dead ends: 1067 [2019-09-10 07:05:42,837 INFO L226 Difference]: Without dead ends: 1067 [2019-09-10 07:05:42,837 INFO L628 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-09-10 07:05:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-09-10 07:05:42,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2019-09-10 07:05:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-09-10 07:05:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1656 transitions. [2019-09-10 07:05:42,870 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1656 transitions. Word has length 67 [2019-09-10 07:05:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:42,871 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1656 transitions. [2019-09-10 07:05:42,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1656 transitions. [2019-09-10 07:05:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:05:42,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:42,877 INFO L399 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] [2019-09-10 07:05:42,878 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1868074219, now seen corresponding path program 1 times [2019-09-10 07:05:42,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:42,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:42,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:42,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:42,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:42,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:42,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:42,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:42,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:42,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:42,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:42,973 INFO L87 Difference]: Start difference. First operand 1065 states and 1656 transitions. Second operand 3 states. [2019-09-10 07:05:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:43,008 INFO L93 Difference]: Finished difference Result 1835 states and 2841 transitions. [2019-09-10 07:05:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:43,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 07:05:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:43,020 INFO L225 Difference]: With dead ends: 1835 [2019-09-10 07:05:43,020 INFO L226 Difference]: Without dead ends: 1835 [2019-09-10 07:05:43,020 INFO L628 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-09-10 07:05:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-09-10 07:05:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1833. [2019-09-10 07:05:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2019-09-10 07:05:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2840 transitions. [2019-09-10 07:05:43,090 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2840 transitions. Word has length 68 [2019-09-10 07:05:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:43,093 INFO L475 AbstractCegarLoop]: Abstraction has 1833 states and 2840 transitions. [2019-09-10 07:05:43,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2840 transitions. [2019-09-10 07:05:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:05:43,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:43,099 INFO L399 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] [2019-09-10 07:05:43,100 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:43,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1423874723, now seen corresponding path program 1 times [2019-09-10 07:05:43,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:43,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:43,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:43,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:05:43,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:43,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:05:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:05:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:43,327 INFO L87 Difference]: Start difference. First operand 1833 states and 2840 transitions. Second operand 7 states. [2019-09-10 07:05:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:43,582 INFO L93 Difference]: Finished difference Result 7649 states and 11772 transitions. [2019-09-10 07:05:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:05:43,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-10 07:05:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:43,621 INFO L225 Difference]: With dead ends: 7649 [2019-09-10 07:05:43,621 INFO L226 Difference]: Without dead ends: 7649 [2019-09-10 07:05:43,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2019-09-10 07:05:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 7641. [2019-09-10 07:05:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7641 states. [2019-09-10 07:05:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7641 states to 7641 states and 11768 transitions. [2019-09-10 07:05:43,812 INFO L78 Accepts]: Start accepts. Automaton has 7641 states and 11768 transitions. Word has length 69 [2019-09-10 07:05:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:43,814 INFO L475 AbstractCegarLoop]: Abstraction has 7641 states and 11768 transitions. [2019-09-10 07:05:43,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:05:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 7641 states and 11768 transitions. [2019-09-10 07:05:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:05:43,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:43,821 INFO L399 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] [2019-09-10 07:05:43,822 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash -500644588, now seen corresponding path program 1 times [2019-09-10 07:05:43,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:43,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:43,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:43,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:43,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:43,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:43,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:05:43,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:43,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:05:43,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:05:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:05:43,998 INFO L87 Difference]: Start difference. First operand 7641 states and 11768 transitions. Second operand 5 states. [2019-09-10 07:05:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:44,362 INFO L93 Difference]: Finished difference Result 15243 states and 23353 transitions. [2019-09-10 07:05:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:05:44,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:05:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:44,451 INFO L225 Difference]: With dead ends: 15243 [2019-09-10 07:05:44,451 INFO L226 Difference]: Without dead ends: 15243 [2019-09-10 07:05:44,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15243 states. [2019-09-10 07:05:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15243 to 15241. [2019-09-10 07:05:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15241 states. [2019-09-10 07:05:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15241 states to 15241 states and 23352 transitions. [2019-09-10 07:05:44,784 INFO L78 Accepts]: Start accepts. Automaton has 15241 states and 23352 transitions. Word has length 71 [2019-09-10 07:05:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:44,785 INFO L475 AbstractCegarLoop]: Abstraction has 15241 states and 23352 transitions. [2019-09-10 07:05:44,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:05:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 15241 states and 23352 transitions. [2019-09-10 07:05:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:05:44,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:44,786 INFO L399 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] [2019-09-10 07:05:44,787 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:44,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1116860303, now seen corresponding path program 1 times [2019-09-10 07:05:44,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:44,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:44,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:44,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:44,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:44,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:05:44,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:44,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:05:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:05:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:44,973 INFO L87 Difference]: Start difference. First operand 15241 states and 23352 transitions. Second operand 7 states. [2019-09-10 07:05:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:45,581 INFO L93 Difference]: Finished difference Result 62771 states and 95693 transitions. [2019-09-10 07:05:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:05:45,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 07:05:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:46,476 INFO L225 Difference]: With dead ends: 62771 [2019-09-10 07:05:46,476 INFO L226 Difference]: Without dead ends: 62771 [2019-09-10 07:05:46,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:05:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62771 states. [2019-09-10 07:05:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62771 to 30441. [2019-09-10 07:05:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30441 states. [2019-09-10 07:05:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30441 states to 30441 states and 46024 transitions. [2019-09-10 07:05:47,312 INFO L78 Accepts]: Start accepts. Automaton has 30441 states and 46024 transitions. Word has length 71 [2019-09-10 07:05:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:47,312 INFO L475 AbstractCegarLoop]: Abstraction has 30441 states and 46024 transitions. [2019-09-10 07:05:47,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:05:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 30441 states and 46024 transitions. [2019-09-10 07:05:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:05:47,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:47,314 INFO L399 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] [2019-09-10 07:05:47,314 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:47,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 244398304, now seen corresponding path program 1 times [2019-09-10 07:05:47,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:47,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:47,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:47,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:47,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:47,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:47,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:05:47,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:47,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:05:47,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:05:47,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:05:47,414 INFO L87 Difference]: Start difference. First operand 30441 states and 46024 transitions. Second operand 5 states. [2019-09-10 07:05:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:47,650 INFO L93 Difference]: Finished difference Result 62121 states and 92648 transitions. [2019-09-10 07:05:47,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:05:47,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 07:05:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:47,787 INFO L225 Difference]: With dead ends: 62121 [2019-09-10 07:05:47,788 INFO L226 Difference]: Without dead ends: 62121 [2019-09-10 07:05:47,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62121 states. [2019-09-10 07:05:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62121 to 31721. [2019-09-10 07:05:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31721 states. [2019-09-10 07:05:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31721 states to 31721 states and 47304 transitions. [2019-09-10 07:05:49,676 INFO L78 Accepts]: Start accepts. Automaton has 31721 states and 47304 transitions. Word has length 72 [2019-09-10 07:05:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:49,676 INFO L475 AbstractCegarLoop]: Abstraction has 31721 states and 47304 transitions. [2019-09-10 07:05:49,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:05:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 31721 states and 47304 transitions. [2019-09-10 07:05:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:05:49,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:49,678 INFO L399 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] [2019-09-10 07:05:49,678 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1003967394, now seen corresponding path program 1 times [2019-09-10 07:05:49,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:49,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:49,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:49,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:49,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:49,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:49,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:49,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:49,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:49,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:49,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:49,741 INFO L87 Difference]: Start difference. First operand 31721 states and 47304 transitions. Second operand 3 states. [2019-09-10 07:05:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:49,866 INFO L93 Difference]: Finished difference Result 39037 states and 57867 transitions. [2019-09-10 07:05:49,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:49,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:05:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:49,948 INFO L225 Difference]: With dead ends: 39037 [2019-09-10 07:05:49,948 INFO L226 Difference]: Without dead ends: 39037 [2019-09-10 07:05:49,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39037 states. [2019-09-10 07:05:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39037 to 39035. [2019-09-10 07:05:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39035 states. [2019-09-10 07:05:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39035 states to 39035 states and 57866 transitions. [2019-09-10 07:05:50,747 INFO L78 Accepts]: Start accepts. Automaton has 39035 states and 57866 transitions. Word has length 73 [2019-09-10 07:05:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:50,748 INFO L475 AbstractCegarLoop]: Abstraction has 39035 states and 57866 transitions. [2019-09-10 07:05:50,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:05:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 39035 states and 57866 transitions. [2019-09-10 07:05:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:05:50,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:50,767 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:05:50,767 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2145575447, now seen corresponding path program 1 times [2019-09-10 07:05:50,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:50,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:50,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:50,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:50,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:05:50,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:05:50,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:05:50,916 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:05:50,918 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [199], [204], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [376], [378], [391], [399], [418], [429], [431], [434], [437], [440], [442], [444], [508], [509], [513], [514], [515] [2019-09-10 07:05:50,977 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:05:50,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:05:51,166 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:05:51,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:05:51,734 INFO L272 AbstractInterpreter]: Visited 90 different actions 589 times. Merged at 51 different actions 428 times. Widened at 17 different actions 60 times. Performed 1955 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1955 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 61 fixpoints after 16 different actions. Largest state had 145 variables. [2019-09-10 07:05:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:51,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:05:51,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:05:51,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:05:51,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:51,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:05:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:51,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 07:05:51,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:05:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:05:52,194 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:05:52,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:05:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:05:52,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:05:52,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 11] total 20 [2019-09-10 07:05:52,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:05:52,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:05:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:05:52,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:05:52,483 INFO L87 Difference]: Start difference. First operand 39035 states and 57866 transitions. Second operand 11 states. [2019-09-10 07:05:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:53,516 INFO L93 Difference]: Finished difference Result 72930 states and 107308 transitions. [2019-09-10 07:05:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:05:53,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-10 07:05:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:53,695 INFO L225 Difference]: With dead ends: 72930 [2019-09-10 07:05:53,696 INFO L226 Difference]: Without dead ends: 72930 [2019-09-10 07:05:53,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:05:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72930 states. [2019-09-10 07:05:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72930 to 67435. [2019-09-10 07:05:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67435 states. [2019-09-10 07:05:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67435 states to 67435 states and 99290 transitions. [2019-09-10 07:05:56,121 INFO L78 Accepts]: Start accepts. Automaton has 67435 states and 99290 transitions. Word has length 98 [2019-09-10 07:05:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:56,121 INFO L475 AbstractCegarLoop]: Abstraction has 67435 states and 99290 transitions. [2019-09-10 07:05:56,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:05:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 67435 states and 99290 transitions. [2019-09-10 07:05:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:05:56,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:56,141 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:05:56,141 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1615048955, now seen corresponding path program 1 times [2019-09-10 07:05:56,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:56,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:56,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:56,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:56,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:05:56,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:05:56,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:05:56,295 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [112], [117], [119], [122], [133], [135], [138], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [376], [378], [391], [399], [418], [420], [423], [431], [434], [437], [440], [442], [444], [508], [509], [513], [514], [515] [2019-09-10 07:05:56,304 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:05:56,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:05:56,345 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:05:56,601 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:05:56,601 INFO L272 AbstractInterpreter]: Visited 87 different actions 403 times. Merged at 45 different actions 267 times. Widened at 8 different actions 23 times. Performed 1505 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1505 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 32 fixpoints after 8 different actions. Largest state had 145 variables. [2019-09-10 07:05:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:56,602 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:05:56,904 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.04% of their original sizes. [2019-09-10 07:05:56,905 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:06:01,813 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:06:01,813 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:06:01,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:06:01,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [7] total 62 [2019-09-10 07:06:01,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:01,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 07:06:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 07:06:01,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2849, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:06:01,817 INFO L87 Difference]: Start difference. First operand 67435 states and 99290 transitions. Second operand 57 states. [2019-09-10 07:07:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:10,036 INFO L93 Difference]: Finished difference Result 175043 states and 249951 transitions. [2019-09-10 07:07:10,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-10 07:07:10,037 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 99 [2019-09-10 07:07:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:10,401 INFO L225 Difference]: With dead ends: 175043 [2019-09-10 07:07:10,402 INFO L226 Difference]: Without dead ends: 175043 [2019-09-10 07:07:10,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7942 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3430, Invalid=22330, Unknown=0, NotChecked=0, Total=25760 [2019-09-10 07:07:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175043 states. [2019-09-10 07:07:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175043 to 96254. [2019-09-10 07:07:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96254 states. [2019-09-10 07:07:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96254 states to 96254 states and 139546 transitions. [2019-09-10 07:07:12,193 INFO L78 Accepts]: Start accepts. Automaton has 96254 states and 139546 transitions. Word has length 99 [2019-09-10 07:07:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:12,193 INFO L475 AbstractCegarLoop]: Abstraction has 96254 states and 139546 transitions. [2019-09-10 07:07:12,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 07:07:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 96254 states and 139546 transitions. [2019-09-10 07:07:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:07:12,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:12,221 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:07:12,221 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:12,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2074205712, now seen corresponding path program 1 times [2019-09-10 07:07:12,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:12,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:12,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:12,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:12,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:12,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:12,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:12,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:12,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:12,303 INFO L87 Difference]: Start difference. First operand 96254 states and 139546 transitions. Second operand 3 states. [2019-09-10 07:07:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:12,798 INFO L93 Difference]: Finished difference Result 146471 states and 210257 transitions. [2019-09-10 07:07:12,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:12,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:07:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:13,038 INFO L225 Difference]: With dead ends: 146471 [2019-09-10 07:07:13,039 INFO L226 Difference]: Without dead ends: 146471 [2019-09-10 07:07:13,039 INFO L628 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-09-10 07:07:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146471 states. [2019-09-10 07:07:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146471 to 141293. [2019-09-10 07:07:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141293 states. [2019-09-10 07:07:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141293 states to 141293 states and 203289 transitions. [2019-09-10 07:07:16,741 INFO L78 Accepts]: Start accepts. Automaton has 141293 states and 203289 transitions. Word has length 99 [2019-09-10 07:07:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:16,741 INFO L475 AbstractCegarLoop]: Abstraction has 141293 states and 203289 transitions. [2019-09-10 07:07:16,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 141293 states and 203289 transitions. [2019-09-10 07:07:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:07:16,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:16,769 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:07:16,770 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1126938495, now seen corresponding path program 1 times [2019-09-10 07:07:16,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:16,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:16,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:16,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:16,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:16,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:16,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:16,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:16,845 INFO L87 Difference]: Start difference. First operand 141293 states and 203289 transitions. Second operand 3 states. [2019-09-10 07:07:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:18,232 INFO L93 Difference]: Finished difference Result 244181 states and 349694 transitions. [2019-09-10 07:07:18,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:18,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:07:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:18,637 INFO L225 Difference]: With dead ends: 244181 [2019-09-10 07:07:18,637 INFO L226 Difference]: Without dead ends: 244181 [2019-09-10 07:07:18,638 INFO L628 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-09-10 07:07:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244181 states. [2019-09-10 07:07:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244181 to 243935. [2019-09-10 07:07:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243935 states. [2019-09-10 07:07:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243935 states to 243935 states and 349449 transitions. [2019-09-10 07:07:27,209 INFO L78 Accepts]: Start accepts. Automaton has 243935 states and 349449 transitions. Word has length 99 [2019-09-10 07:07:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:27,210 INFO L475 AbstractCegarLoop]: Abstraction has 243935 states and 349449 transitions. [2019-09-10 07:07:27,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 243935 states and 349449 transitions. [2019-09-10 07:07:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:07:27,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:27,255 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:07:27,255 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash 189680672, now seen corresponding path program 1 times [2019-09-10 07:07:27,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:27,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:27,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:27,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:27,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:27,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:27,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:27,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:27,331 INFO L87 Difference]: Start difference. First operand 243935 states and 349449 transitions. Second operand 3 states. [2019-09-10 07:07:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:28,092 INFO L93 Difference]: Finished difference Result 335242 states and 474438 transitions. [2019-09-10 07:07:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:28,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:07:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:28,510 INFO L225 Difference]: With dead ends: 335242 [2019-09-10 07:07:28,510 INFO L226 Difference]: Without dead ends: 335242 [2019-09-10 07:07:28,511 INFO L628 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-09-10 07:07:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335242 states. [2019-09-10 07:07:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335242 to 311147. [2019-09-10 07:07:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311147 states. [2019-09-10 07:07:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311147 states to 311147 states and 441662 transitions. [2019-09-10 07:07:34,983 INFO L78 Accepts]: Start accepts. Automaton has 311147 states and 441662 transitions. Word has length 99 [2019-09-10 07:07:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:34,984 INFO L475 AbstractCegarLoop]: Abstraction has 311147 states and 441662 transitions. [2019-09-10 07:07:34,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 311147 states and 441662 transitions. [2019-09-10 07:07:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:07:35,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:35,024 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:07:35,025 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:35,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash -297155159, now seen corresponding path program 1 times [2019-09-10 07:07:35,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:35,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:35,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:35,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:35,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:35,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:35,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:35,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:35,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:35,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:35,104 INFO L87 Difference]: Start difference. First operand 311147 states and 441662 transitions. Second operand 3 states. [2019-09-10 07:07:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:35,985 INFO L93 Difference]: Finished difference Result 357575 states and 499565 transitions. [2019-09-10 07:07:35,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:35,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:07:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:36,605 INFO L225 Difference]: With dead ends: 357575 [2019-09-10 07:07:36,606 INFO L226 Difference]: Without dead ends: 321675 [2019-09-10 07:07:36,606 INFO L628 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-09-10 07:07:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321675 states. [2019-09-10 07:07:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321675 to 306361. [2019-09-10 07:07:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306361 states. [2019-09-10 07:07:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306361 states to 306361 states and 428608 transitions. [2019-09-10 07:07:46,337 INFO L78 Accepts]: Start accepts. Automaton has 306361 states and 428608 transitions. Word has length 99 [2019-09-10 07:07:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:46,337 INFO L475 AbstractCegarLoop]: Abstraction has 306361 states and 428608 transitions. [2019-09-10 07:07:46,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 306361 states and 428608 transitions. [2019-09-10 07:07:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:07:46,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:46,387 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:07:46,388 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:46,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1668131521, now seen corresponding path program 1 times [2019-09-10 07:07:46,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:46,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:46,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:46,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:46,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:46,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:46,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:46,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:46,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:46,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:46,453 INFO L87 Difference]: Start difference. First operand 306361 states and 428608 transitions. Second operand 3 states. [2019-09-10 07:07:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:49,027 INFO L93 Difference]: Finished difference Result 481181 states and 664971 transitions. [2019-09-10 07:07:49,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:49,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:07:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:49,751 INFO L225 Difference]: With dead ends: 481181 [2019-09-10 07:07:49,751 INFO L226 Difference]: Without dead ends: 474716 [2019-09-10 07:07:49,752 INFO L628 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-09-10 07:07:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474716 states. [2019-09-10 07:08:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474716 to 469409. [2019-09-10 07:08:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469409 states. [2019-09-10 07:08:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469409 states to 469409 states and 649624 transitions. [2019-09-10 07:08:02,756 INFO L78 Accepts]: Start accepts. Automaton has 469409 states and 649624 transitions. Word has length 99 [2019-09-10 07:08:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:02,756 INFO L475 AbstractCegarLoop]: Abstraction has 469409 states and 649624 transitions. [2019-09-10 07:08:02,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 469409 states and 649624 transitions. [2019-09-10 07:08:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:08:02,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:02,801 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:08:02,801 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1732651124, now seen corresponding path program 1 times [2019-09-10 07:08:02,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:02,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:02,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:02,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:02,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:02,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:08:02,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:08:02,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:08:02,921 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [125], [128], [133], [135], [138], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [367], [370], [378], [381], [384], [387], [389], [391], [429], [431], [444], [452], [471], [508], [509], [513], [514], [515] [2019-09-10 07:08:02,930 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:08:02,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:08:02,951 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:08:03,114 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:08:03,115 INFO L272 AbstractInterpreter]: Visited 87 different actions 442 times. Merged at 45 different actions 299 times. Widened at 14 different actions 34 times. Performed 1616 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1616 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 33 fixpoints after 9 different actions. Largest state had 145 variables. [2019-09-10 07:08:03,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:03,116 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:08:03,394 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.67% of their original sizes. [2019-09-10 07:08:03,394 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:08:14,007 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:08:14,008 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:08:14,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:08:14,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [7] total 59 [2019-09-10 07:08:14,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:14,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 07:08:14,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 07:08:14,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:08:14,011 INFO L87 Difference]: Start difference. First operand 469409 states and 649624 transitions. Second operand 54 states. [2019-09-10 07:10:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:06,471 INFO L93 Difference]: Finished difference Result 882387 states and 1201681 transitions. [2019-09-10 07:10:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 554 states. [2019-09-10 07:10:06,471 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 99 [2019-09-10 07:10:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:07,640 INFO L225 Difference]: With dead ends: 882387 [2019-09-10 07:10:07,640 INFO L226 Difference]: Without dead ends: 882352 [2019-09-10 07:10:07,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 580 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146717 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=34706, Invalid=303436, Unknown=0, NotChecked=0, Total=338142 [2019-09-10 07:10:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882352 states. [2019-09-10 07:10:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882352 to 518094. [2019-09-10 07:10:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518094 states. [2019-09-10 07:10:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518094 states to 518094 states and 710080 transitions. [2019-09-10 07:10:32,581 INFO L78 Accepts]: Start accepts. Automaton has 518094 states and 710080 transitions. Word has length 99 [2019-09-10 07:10:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:32,581 INFO L475 AbstractCegarLoop]: Abstraction has 518094 states and 710080 transitions. [2019-09-10 07:10:32,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 07:10:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 518094 states and 710080 transitions. [2019-09-10 07:10:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:10:32,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:32,637 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:10:32,637 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash -343746299, now seen corresponding path program 1 times [2019-09-10 07:10:32,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:32,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:32,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:32,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:32,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:10:32,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:10:32,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:10:32,740 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [141], [144], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [314], [317], [325], [328], [331], [334], [336], [338], [376], [378], [391], [399], [418], [429], [431], [444], [452], [471], [508], [509], [513], [514], [515] [2019-09-10 07:10:32,741 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:10:32,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:10:32,763 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:10:32,929 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:10:32,930 INFO L272 AbstractInterpreter]: Visited 87 different actions 454 times. Merged at 45 different actions 311 times. Widened at 14 different actions 37 times. Performed 1601 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1601 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 33 fixpoints after 10 different actions. Largest state had 145 variables. [2019-09-10 07:10:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:32,930 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:10:33,148 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.53% of their original sizes. [2019-09-10 07:10:33,148 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:10:38,294 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:10:38,294 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:10:38,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:10:38,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:10:38,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:38,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:10:38,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:10:38,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2752, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:10:38,296 INFO L87 Difference]: Start difference. First operand 518094 states and 710080 transitions. Second operand 56 states. [2019-09-10 07:12:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:03,703 INFO L93 Difference]: Finished difference Result 872835 states and 1194005 transitions. [2019-09-10 07:12:03,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2019-09-10 07:12:03,703 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 99 [2019-09-10 07:12:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:05,776 INFO L225 Difference]: With dead ends: 872835 [2019-09-10 07:12:05,777 INFO L226 Difference]: Without dead ends: 872835 [2019-09-10 07:12:05,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35217 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=11809, Invalid=76697, Unknown=0, NotChecked=0, Total=88506 [2019-09-10 07:12:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872835 states. [2019-09-10 07:12:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872835 to 541874. [2019-09-10 07:12:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541874 states. [2019-09-10 07:12:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541874 states to 541874 states and 740265 transitions. [2019-09-10 07:12:23,688 INFO L78 Accepts]: Start accepts. Automaton has 541874 states and 740265 transitions. Word has length 99 [2019-09-10 07:12:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:23,688 INFO L475 AbstractCegarLoop]: Abstraction has 541874 states and 740265 transitions. [2019-09-10 07:12:23,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:12:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 541874 states and 740265 transitions. [2019-09-10 07:12:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:12:23,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:23,737 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:12:23,737 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:23,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:23,737 INFO L82 PathProgramCache]: Analyzing trace with hash -423295904, now seen corresponding path program 1 times [2019-09-10 07:12:23,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:23,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:23,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:23,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:23,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:23,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:12:23,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:12:23,830 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:12:23,830 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [149], [151], [154], [157], [160], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [261], [264], [272], [275], [278], [281], [283], [285], [323], [325], [338], [346], [365], [376], [378], [391], [399], [418], [429], [431], [444], [452], [471], [508], [509], [513], [514], [515] [2019-09-10 07:12:23,832 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:12:23,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:12:23,849 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:12:24,000 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:12:24,001 INFO L272 AbstractInterpreter]: Visited 87 different actions 423 times. Merged at 45 different actions 285 times. Widened at 13 different actions 33 times. Performed 1538 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1538 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 30 fixpoints after 10 different actions. Largest state had 145 variables. [2019-09-10 07:12:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:24,001 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:12:24,125 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.72% of their original sizes. [2019-09-10 07:12:24,125 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:12:28,884 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:12:28,884 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:12:28,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:12:28,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [7] total 60 [2019-09-10 07:12:28,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:28,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 07:12:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 07:12:28,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2633, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 07:12:28,886 INFO L87 Difference]: Start difference. First operand 541874 states and 740265 transitions. Second operand 55 states. [2019-09-10 07:13:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:42,621 INFO L93 Difference]: Finished difference Result 874410 states and 1197363 transitions. [2019-09-10 07:13:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2019-09-10 07:13:42,621 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 99 [2019-09-10 07:13:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:44,023 INFO L225 Difference]: With dead ends: 874410 [2019-09-10 07:13:44,024 INFO L226 Difference]: Without dead ends: 874410 [2019-09-10 07:13:44,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17919 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=6552, Invalid=41190, Unknown=0, NotChecked=0, Total=47742 [2019-09-10 07:13:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874410 states. [2019-09-10 07:13:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874410 to 561037. [2019-09-10 07:13:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561037 states. [2019-09-10 07:14:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561037 states to 561037 states and 764212 transitions. [2019-09-10 07:14:06,156 INFO L78 Accepts]: Start accepts. Automaton has 561037 states and 764212 transitions. Word has length 99 [2019-09-10 07:14:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:06,156 INFO L475 AbstractCegarLoop]: Abstraction has 561037 states and 764212 transitions. [2019-09-10 07:14:06,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 07:14:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 561037 states and 764212 transitions. [2019-09-10 07:14:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:14:06,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:06,216 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:14:06,216 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:06,216 INFO L82 PathProgramCache]: Analyzing trace with hash 262495149, now seen corresponding path program 1 times [2019-09-10 07:14:06,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:06,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:06,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:06,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:06,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:06,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:14:06,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:14:06,336 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:14:06,336 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [149], [151], [154], [165], [167], [170], [173], [176], [181], [183], [186], [189], [191], [194], [195], [197], [206], [208], [211], [219], [222], [225], [228], [230], [232], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [376], [378], [391], [399], [418], [429], [431], [444], [452], [471], [508], [509], [513], [514], [515] [2019-09-10 07:14:06,340 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:14:06,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:14:06,362 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:14:06,586 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:14:06,587 INFO L272 AbstractInterpreter]: Visited 87 different actions 472 times. Merged at 45 different actions 327 times. Widened at 12 different actions 36 times. Performed 1650 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1650 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 32 fixpoints after 9 different actions. Largest state had 145 variables. [2019-09-10 07:14:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:06,588 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:14:06,709 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.72% of their original sizes. [2019-09-10 07:14:06,710 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:14:12,158 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:14:12,158 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:14:12,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:14:12,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:14:12,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:12,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:14:12,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:14:12,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2740, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:14:12,161 INFO L87 Difference]: Start difference. First operand 561037 states and 764212 transitions. Second operand 56 states. [2019-09-10 07:15:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:37,566 INFO L93 Difference]: Finished difference Result 890894 states and 1217816 transitions. [2019-09-10 07:15:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-10 07:15:37,566 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 99 [2019-09-10 07:15:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:38,925 INFO L225 Difference]: With dead ends: 890894 [2019-09-10 07:15:38,925 INFO L226 Difference]: Without dead ends: 890894 [2019-09-10 07:15:38,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11685 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=5145, Invalid=28161, Unknown=0, NotChecked=0, Total=33306 [2019-09-10 07:15:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890894 states. [2019-09-10 07:15:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890894 to 576006. [2019-09-10 07:15:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576006 states. [2019-09-10 07:15:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576006 states to 576006 states and 782535 transitions. [2019-09-10 07:15:59,008 INFO L78 Accepts]: Start accepts. Automaton has 576006 states and 782535 transitions. Word has length 99 [2019-09-10 07:15:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:59,009 INFO L475 AbstractCegarLoop]: Abstraction has 576006 states and 782535 transitions. [2019-09-10 07:15:59,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:15:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 576006 states and 782535 transitions. [2019-09-10 07:15:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:15:59,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:59,074 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:15:59,074 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1101950771, now seen corresponding path program 1 times [2019-09-10 07:15:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:59,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:59,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:59,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:15:59,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:15:59,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 07:15:59,187 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [112], [117], [119], [122], [133], [135], [138], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [376], [378], [381], [384], [387], [389], [391], [420], [423], [431], [434], [437], [440], [442], [444], [508], [509], [513], [514], [515] [2019-09-10 07:15:59,189 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:15:59,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:15:59,205 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:15:59,374 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:15:59,374 INFO L272 AbstractInterpreter]: Visited 89 different actions 470 times. Merged at 47 different actions 324 times. Widened at 15 different actions 39 times. Performed 1666 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 36 fixpoints after 12 different actions. Largest state had 146 variables. [2019-09-10 07:15:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:59,375 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:15:59,493 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 80.93% of their original sizes. [2019-09-10 07:15:59,494 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:16:09,864 INFO L420 sIntCurrentIteration]: We unified 100 AI predicates to 100 [2019-09-10 07:16:09,864 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:16:09,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:16:09,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:16:09,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:09,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:16:09,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:16:09,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2739, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:16:09,867 INFO L87 Difference]: Start difference. First operand 576006 states and 782535 transitions. Second operand 56 states. [2019-09-10 07:17:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:15,930 INFO L93 Difference]: Finished difference Result 971621 states and 1316305 transitions. [2019-09-10 07:17:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-09-10 07:17:15,930 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 101 [2019-09-10 07:17:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:17,589 INFO L225 Difference]: With dead ends: 971621 [2019-09-10 07:17:17,589 INFO L226 Difference]: Without dead ends: 971441 [2019-09-10 07:17:17,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31206 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=10326, Invalid=72906, Unknown=0, NotChecked=0, Total=83232 [2019-09-10 07:17:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971441 states.