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.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:14:52,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:14:52,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:14:52,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:14:52,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:14:52,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:14:52,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:14:52,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:14:52,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:14:52,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:14:52,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:14:52,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:14:52,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:14:52,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:14:52,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:14:52,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:14:52,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:14:52,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:14:52,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:14:52,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:14:52,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:14:52,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:14:52,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:14:52,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:14:52,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:14:52,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:14:52,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:14:52,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:14:52,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:14:52,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:14:52,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:14:52,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:14:52,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:14:52,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:14:52,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:14:52,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:14:52,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:14:52,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:14:52,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:14:52,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:14:52,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:14:52,679 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:14:52,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:14:52,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:14:52,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:14:52,694 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:14:52,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:14:52,695 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:14:52,695 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:14:52,695 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:14:52,695 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:14:52,696 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:14:52,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:14:52,697 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:14:52,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:14:52,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:14:52,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:14:52,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:14:52,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:14:52,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:14:52,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:14:52,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:14:52,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:14:52,699 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:14:52,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:14:52,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:14:52,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:14:52,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:14:52,700 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:14:52,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:14:52,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:14:52,700 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:14:52,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:14:52,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:14:52,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:14:52,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:14:52,747 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:14:52,747 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.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:14:52,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39601e7ef/5df4498a0c664012a1ee2ea8d2822df7/FLAG0048e2207 [2019-09-10 07:14:53,313 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:14:53,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:14:53,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39601e7ef/5df4498a0c664012a1ee2ea8d2822df7/FLAG0048e2207 [2019-09-10 07:14:53,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39601e7ef/5df4498a0c664012a1ee2ea8d2822df7 [2019-09-10 07:14:53,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:14:53,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:14:53,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:14:53,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:14:53,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:14:53,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:14:53" (1/1) ... [2019-09-10 07:14:53,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27370af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:53, skipping insertion in model container [2019-09-10 07:14:53,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:14:53" (1/1) ... [2019-09-10 07:14:53,673 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:14:53,742 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:14:54,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:14:54,131 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:14:54,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:14:54,243 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:14:54,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54 WrapperNode [2019-09-10 07:14:54,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:14:54,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:14:54,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:14:54,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:14:54,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (1/1) ... [2019-09-10 07:14:54,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (1/1) ... [2019-09-10 07:14:54,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (1/1) ... [2019-09-10 07:14:54,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (1/1) ... [2019-09-10 07:14:54,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (1/1) ... [2019-09-10 07:14:54,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (1/1) ... [2019-09-10 07:14:54,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (1/1) ... [2019-09-10 07:14:54,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:14:54,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:14:54,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:14:54,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:14:54,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (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:14:54,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:14:54,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:14:54,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:14:54,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:14:54,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:14:54,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:14:54,358 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:14:54,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:14:54,358 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:14:54,358 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:14:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:14:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:14:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:14:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:14:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:14:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:14:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:14:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:14:54,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:14:54,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:14:55,094 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:14:55,094 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:14:55,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:14:55 BoogieIcfgContainer [2019-09-10 07:14:55,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:14:55,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:14:55,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:14:55,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:14:55,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:14:53" (1/3) ... [2019-09-10 07:14:55,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a1c07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:14:55, skipping insertion in model container [2019-09-10 07:14:55,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:14:54" (2/3) ... [2019-09-10 07:14:55,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a1c07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:14:55, skipping insertion in model container [2019-09-10 07:14:55,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:14:55" (3/3) ... [2019-09-10 07:14:55,103 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:14:55,111 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:14:55,119 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:14:55,136 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:14:55,162 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:14:55,163 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:14:55,163 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:14:55,163 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:14:55,163 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:14:55,163 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:14:55,164 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:14:55,164 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:14:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-10 07:14:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:14:55,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:55,199 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:14:55,201 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:55,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1503365547, now seen corresponding path program 1 times [2019-09-10 07:14:55,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:55,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:55,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:55,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:55,678 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:14:55,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:55,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:55,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:55,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:55,712 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-09-10 07:14:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:55,833 INFO L93 Difference]: Finished difference Result 227 states and 365 transitions. [2019-09-10 07:14:55,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:55,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 07:14:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:55,863 INFO L225 Difference]: With dead ends: 227 [2019-09-10 07:14:55,864 INFO L226 Difference]: Without dead ends: 219 [2019-09-10 07:14:55,867 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:14:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-10 07:14:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-09-10 07:14:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-10 07:14:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 323 transitions. [2019-09-10 07:14:55,998 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 323 transitions. Word has length 64 [2019-09-10 07:14:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:55,999 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 323 transitions. [2019-09-10 07:14:55,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 323 transitions. [2019-09-10 07:14:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:14:56,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:56,006 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:14:56,006 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1067938911, now seen corresponding path program 1 times [2019-09-10 07:14:56,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:56,223 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:14:56,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:56,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:56,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:56,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:56,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:56,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:56,226 INFO L87 Difference]: Start difference. First operand 217 states and 323 transitions. Second operand 3 states. [2019-09-10 07:14:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:56,262 INFO L93 Difference]: Finished difference Result 363 states and 553 transitions. [2019-09-10 07:14:56,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:56,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:14:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:56,271 INFO L225 Difference]: With dead ends: 363 [2019-09-10 07:14:56,271 INFO L226 Difference]: Without dead ends: 363 [2019-09-10 07:14:56,272 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:14:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-10 07:14:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-09-10 07:14:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-10 07:14:56,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2019-09-10 07:14:56,308 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 65 [2019-09-10 07:14:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:56,309 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2019-09-10 07:14:56,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2019-09-10 07:14:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:14:56,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:56,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] [2019-09-10 07:14:56,314 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:56,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2132718422, now seen corresponding path program 1 times [2019-09-10 07:14:56,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:56,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:56,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:56,398 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:14:56,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:56,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:56,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:56,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:56,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:56,401 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand 3 states. [2019-09-10 07:14:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:56,430 INFO L93 Difference]: Finished difference Result 619 states and 957 transitions. [2019-09-10 07:14:56,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:56,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 07:14:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:56,435 INFO L225 Difference]: With dead ends: 619 [2019-09-10 07:14:56,435 INFO L226 Difference]: Without dead ends: 619 [2019-09-10 07:14:56,435 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:14:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-10 07:14:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2019-09-10 07:14:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-10 07:14:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 956 transitions. [2019-09-10 07:14:56,459 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 956 transitions. Word has length 66 [2019-09-10 07:14:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:56,459 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 956 transitions. [2019-09-10 07:14:56,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 956 transitions. [2019-09-10 07:14:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:14:56,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:56,461 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:14:56,461 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash -523046956, now seen corresponding path program 1 times [2019-09-10 07:14:56,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:56,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:56,543 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:14:56,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:56,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:56,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:56,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:56,547 INFO L87 Difference]: Start difference. First operand 617 states and 956 transitions. Second operand 3 states. [2019-09-10 07:14:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:56,574 INFO L93 Difference]: Finished difference Result 1067 states and 1657 transitions. [2019-09-10 07:14:56,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:56,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 07:14:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:56,583 INFO L225 Difference]: With dead ends: 1067 [2019-09-10 07:14:56,584 INFO L226 Difference]: Without dead ends: 1067 [2019-09-10 07:14:56,584 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:14:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-09-10 07:14:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2019-09-10 07:14:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-09-10 07:14:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1656 transitions. [2019-09-10 07:14:56,618 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1656 transitions. Word has length 67 [2019-09-10 07:14:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:56,619 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1656 transitions. [2019-09-10 07:14:56,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1656 transitions. [2019-09-10 07:14:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:14:56,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:56,622 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:14:56,622 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1868074219, now seen corresponding path program 1 times [2019-09-10 07:14:56,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:56,706 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:14:56,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:56,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:14:56,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:56,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:14:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:14:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:14:56,708 INFO L87 Difference]: Start difference. First operand 1065 states and 1656 transitions. Second operand 3 states. [2019-09-10 07:14:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:56,744 INFO L93 Difference]: Finished difference Result 1835 states and 2841 transitions. [2019-09-10 07:14:56,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:56,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 07:14:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:56,755 INFO L225 Difference]: With dead ends: 1835 [2019-09-10 07:14:56,755 INFO L226 Difference]: Without dead ends: 1835 [2019-09-10 07:14:56,756 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:14:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-09-10 07:14:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1833. [2019-09-10 07:14:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2019-09-10 07:14:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2840 transitions. [2019-09-10 07:14:56,827 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2840 transitions. Word has length 68 [2019-09-10 07:14:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:56,829 INFO L475 AbstractCegarLoop]: Abstraction has 1833 states and 2840 transitions. [2019-09-10 07:14:56,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2840 transitions. [2019-09-10 07:14:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:14:56,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:56,831 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:14:56,832 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1423874723, now seen corresponding path program 1 times [2019-09-10 07:14:56,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:56,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:56,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:56,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:57,071 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:14:57,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:57,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:57,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:57,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:57,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:57,076 INFO L87 Difference]: Start difference. First operand 1833 states and 2840 transitions. Second operand 7 states. [2019-09-10 07:14:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:57,353 INFO L93 Difference]: Finished difference Result 7649 states and 11772 transitions. [2019-09-10 07:14:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:14:57,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-10 07:14:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:57,391 INFO L225 Difference]: With dead ends: 7649 [2019-09-10 07:14:57,391 INFO L226 Difference]: Without dead ends: 7649 [2019-09-10 07:14:57,392 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:14:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2019-09-10 07:14:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 7641. [2019-09-10 07:14:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7641 states. [2019-09-10 07:14:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7641 states to 7641 states and 11768 transitions. [2019-09-10 07:14:57,576 INFO L78 Accepts]: Start accepts. Automaton has 7641 states and 11768 transitions. Word has length 69 [2019-09-10 07:14:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:57,577 INFO L475 AbstractCegarLoop]: Abstraction has 7641 states and 11768 transitions. [2019-09-10 07:14:57,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7641 states and 11768 transitions. [2019-09-10 07:14:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:14:57,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:57,582 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:14:57,583 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash -500644588, now seen corresponding path program 1 times [2019-09-10 07:14:57,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:57,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:57,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:57,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:57,721 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:14:57,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:57,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:14:57,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:57,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:14:57,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:14:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:14:57,723 INFO L87 Difference]: Start difference. First operand 7641 states and 11768 transitions. Second operand 5 states. [2019-09-10 07:14:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:58,102 INFO L93 Difference]: Finished difference Result 13915 states and 21321 transitions. [2019-09-10 07:14:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:14:58,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:14:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:58,213 INFO L225 Difference]: With dead ends: 13915 [2019-09-10 07:14:58,218 INFO L226 Difference]: Without dead ends: 13915 [2019-09-10 07:14:58,219 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:14:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13915 states. [2019-09-10 07:14:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13915 to 13913. [2019-09-10 07:14:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13913 states. [2019-09-10 07:14:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13913 states to 13913 states and 21320 transitions. [2019-09-10 07:14:58,752 INFO L78 Accepts]: Start accepts. Automaton has 13913 states and 21320 transitions. Word has length 71 [2019-09-10 07:14:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:58,753 INFO L475 AbstractCegarLoop]: Abstraction has 13913 states and 21320 transitions. [2019-09-10 07:14:58,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:14:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 13913 states and 21320 transitions. [2019-09-10 07:14:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:14:58,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:58,754 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:14:58,755 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:58,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1116860303, now seen corresponding path program 1 times [2019-09-10 07:14:58,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:58,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:58,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:58,959 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:14:58,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:58,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:58,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:58,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:58,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:58,962 INFO L87 Difference]: Start difference. First operand 13913 states and 21320 transitions. Second operand 7 states. [2019-09-10 07:14:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:59,415 INFO L93 Difference]: Finished difference Result 60115 states and 91693 transitions. [2019-09-10 07:14:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:14:59,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 07:14:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:59,560 INFO L225 Difference]: With dead ends: 60115 [2019-09-10 07:14:59,560 INFO L226 Difference]: Without dead ends: 60115 [2019-09-10 07:14:59,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60115 states. [2019-09-10 07:15:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60115 to 27785. [2019-09-10 07:15:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27785 states. [2019-09-10 07:15:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27785 states to 27785 states and 42024 transitions. [2019-09-10 07:15:00,940 INFO L78 Accepts]: Start accepts. Automaton has 27785 states and 42024 transitions. Word has length 71 [2019-09-10 07:15:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:00,941 INFO L475 AbstractCegarLoop]: Abstraction has 27785 states and 42024 transitions. [2019-09-10 07:15:00,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 27785 states and 42024 transitions. [2019-09-10 07:15:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:15:00,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:00,942 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:15:00,943 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:00,944 INFO L82 PathProgramCache]: Analyzing trace with hash 244398304, now seen corresponding path program 1 times [2019-09-10 07:15:00,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:00,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:00,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:00,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:01,048 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:15:01,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:15:01,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:01,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:15:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:15:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:15:01,050 INFO L87 Difference]: Start difference. First operand 27785 states and 42024 transitions. Second operand 5 states. [2019-09-10 07:15:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:01,255 INFO L93 Difference]: Finished difference Result 56681 states and 84584 transitions. [2019-09-10 07:15:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:15:01,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 07:15:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:01,374 INFO L225 Difference]: With dead ends: 56681 [2019-09-10 07:15:01,374 INFO L226 Difference]: Without dead ends: 56681 [2019-09-10 07:15:01,375 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:15:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56681 states. [2019-09-10 07:15:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56681 to 28937. [2019-09-10 07:15:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28937 states. [2019-09-10 07:15:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28937 states to 28937 states and 43176 transitions. [2019-09-10 07:15:02,233 INFO L78 Accepts]: Start accepts. Automaton has 28937 states and 43176 transitions. Word has length 72 [2019-09-10 07:15:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:02,233 INFO L475 AbstractCegarLoop]: Abstraction has 28937 states and 43176 transitions. [2019-09-10 07:15:02,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:15:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28937 states and 43176 transitions. [2019-09-10 07:15:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:15:02,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:02,235 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:15:02,235 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:02,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:02,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1003967394, now seen corresponding path program 1 times [2019-09-10 07:15:02,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:02,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:02,302 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:15:02,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:02,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:02,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:02,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:02,306 INFO L87 Difference]: Start difference. First operand 28937 states and 43176 transitions. Second operand 3 states. [2019-09-10 07:15:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:02,412 INFO L93 Difference]: Finished difference Result 36253 states and 53739 transitions. [2019-09-10 07:15:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:02,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:15:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:02,464 INFO L225 Difference]: With dead ends: 36253 [2019-09-10 07:15:02,464 INFO L226 Difference]: Without dead ends: 36253 [2019-09-10 07:15:02,465 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:15:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36253 states. [2019-09-10 07:15:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36253 to 36251. [2019-09-10 07:15:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36251 states. [2019-09-10 07:15:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36251 states to 36251 states and 53738 transitions. [2019-09-10 07:15:03,599 INFO L78 Accepts]: Start accepts. Automaton has 36251 states and 53738 transitions. Word has length 73 [2019-09-10 07:15:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:03,600 INFO L475 AbstractCegarLoop]: Abstraction has 36251 states and 53738 transitions. [2019-09-10 07:15:03,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36251 states and 53738 transitions. [2019-09-10 07:15:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:15:03,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:03,618 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:15:03,619 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2145575447, now seen corresponding path program 1 times [2019-09-10 07:15:03,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:03,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:03,763 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:15:03,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:15:03,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:15:03,765 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:15:03,767 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:15:03,816 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:15:03,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:15:03,976 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:15:04,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:15:04,673 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:15:04,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:04,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:15:04,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:15:04,680 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) [2019-09-10 07:15:04,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:04,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:15:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:04,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 07:15:04,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:15:05,102 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:15:05,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:15:05,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:15:05,387 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:15:05,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:15:05,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 11] total 20 [2019-09-10 07:15:05,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:15:05,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:15:05,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:15:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:15:05,401 INFO L87 Difference]: Start difference. First operand 36251 states and 53738 transitions. Second operand 11 states. [2019-09-10 07:15:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:06,061 INFO L93 Difference]: Finished difference Result 68914 states and 101436 transitions. [2019-09-10 07:15:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:15:06,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-10 07:15:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:06,342 INFO L225 Difference]: With dead ends: 68914 [2019-09-10 07:15:06,343 INFO L226 Difference]: Without dead ends: 68914 [2019-09-10 07:15:06,343 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:15:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68914 states. [2019-09-10 07:15:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68914 to 63419. [2019-09-10 07:15:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63419 states. [2019-09-10 07:15:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63419 states to 63419 states and 93418 transitions. [2019-09-10 07:15:07,827 INFO L78 Accepts]: Start accepts. Automaton has 63419 states and 93418 transitions. Word has length 98 [2019-09-10 07:15:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:07,828 INFO L475 AbstractCegarLoop]: Abstraction has 63419 states and 93418 transitions. [2019-09-10 07:15:07,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:15:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 63419 states and 93418 transitions. [2019-09-10 07:15:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:15:07,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:07,847 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:15:07,847 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1615048955, now seen corresponding path program 1 times [2019-09-10 07:15:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:07,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:07,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:07,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:07,997 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:07,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:15:07,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:15:07,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:15:07,998 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:15:08,007 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:15:08,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:15:08,044 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:15:08,274 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:15:08,274 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:15:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:08,275 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:15:08,985 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.04% of their original sizes. [2019-09-10 07:15:08,985 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:15:14,925 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:15:14,925 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:15:14,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:15:14,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [7] total 62 [2019-09-10 07:15:14,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:14,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 07:15:14,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 07:15:14,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2849, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:15:14,929 INFO L87 Difference]: Start difference. First operand 63419 states and 93418 transitions. Second operand 57 states. [2019-09-10 07:16:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:35,347 INFO L93 Difference]: Finished difference Result 161267 states and 230529 transitions. [2019-09-10 07:16:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-10 07:16:35,347 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 99 [2019-09-10 07:16:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:35,781 INFO L225 Difference]: With dead ends: 161267 [2019-09-10 07:16:35,781 INFO L226 Difference]: Without dead ends: 161267 [2019-09-10 07:16:35,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7942 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=3430, Invalid=22330, Unknown=0, NotChecked=0, Total=25760 [2019-09-10 07:16:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161267 states. [2019-09-10 07:16:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161267 to 88874. [2019-09-10 07:16:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88874 states. [2019-09-10 07:16:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88874 states to 88874 states and 128991 transitions. [2019-09-10 07:16:37,017 INFO L78 Accepts]: Start accepts. Automaton has 88874 states and 128991 transitions. Word has length 99 [2019-09-10 07:16:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:37,017 INFO L475 AbstractCegarLoop]: Abstraction has 88874 states and 128991 transitions. [2019-09-10 07:16:37,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 07:16:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 88874 states and 128991 transitions. [2019-09-10 07:16:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:16:37,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:37,041 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:16:37,041 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2074205712, now seen corresponding path program 1 times [2019-09-10 07:16:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:37,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:37,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:37,116 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:16:37,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:37,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:37,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:37,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:37,117 INFO L87 Difference]: Start difference. First operand 88874 states and 128991 transitions. Second operand 3 states. [2019-09-10 07:16:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:39,327 INFO L93 Difference]: Finished difference Result 138075 states and 198400 transitions. [2019-09-10 07:16:39,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:39,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:16:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:39,535 INFO L225 Difference]: With dead ends: 138075 [2019-09-10 07:16:39,536 INFO L226 Difference]: Without dead ends: 138075 [2019-09-10 07:16:39,536 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:16:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138075 states. [2019-09-10 07:16:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138075 to 133757. [2019-09-10 07:16:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133757 states. [2019-09-10 07:16:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133757 states to 133757 states and 192660 transitions. [2019-09-10 07:16:41,465 INFO L78 Accepts]: Start accepts. Automaton has 133757 states and 192660 transitions. Word has length 99 [2019-09-10 07:16:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:41,465 INFO L475 AbstractCegarLoop]: Abstraction has 133757 states and 192660 transitions. [2019-09-10 07:16:41,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 133757 states and 192660 transitions. [2019-09-10 07:16:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:16:41,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:41,495 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:16:41,496 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1126938495, now seen corresponding path program 1 times [2019-09-10 07:16:41,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:41,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:41,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:41,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:41,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:41,566 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:16:41,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:41,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:41,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:41,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:41,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:41,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:41,568 INFO L87 Difference]: Start difference. First operand 133757 states and 192660 transitions. Second operand 3 states. [2019-09-10 07:16:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:41,946 INFO L93 Difference]: Finished difference Result 191766 states and 273737 transitions. [2019-09-10 07:16:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:41,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:16:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:42,136 INFO L225 Difference]: With dead ends: 191766 [2019-09-10 07:16:42,136 INFO L226 Difference]: Without dead ends: 191766 [2019-09-10 07:16:42,136 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:16:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191766 states. [2019-09-10 07:16:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191766 to 191528. [2019-09-10 07:16:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191528 states. [2019-09-10 07:16:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191528 states to 191528 states and 273500 transitions. [2019-09-10 07:16:46,574 INFO L78 Accepts]: Start accepts. Automaton has 191528 states and 273500 transitions. Word has length 99 [2019-09-10 07:16:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:46,574 INFO L475 AbstractCegarLoop]: Abstraction has 191528 states and 273500 transitions. [2019-09-10 07:16:46,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 191528 states and 273500 transitions. [2019-09-10 07:16:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:16:46,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:46,604 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:16:46,605 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:46,605 INFO L82 PathProgramCache]: Analyzing trace with hash 189680672, now seen corresponding path program 1 times [2019-09-10 07:16:46,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:46,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:46,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:46,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:46,669 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:16:46,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:46,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:46,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:46,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:46,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:46,671 INFO L87 Difference]: Start difference. First operand 191528 states and 273500 transitions. Second operand 3 states. [2019-09-10 07:16:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:47,314 INFO L93 Difference]: Finished difference Result 264129 states and 372634 transitions. [2019-09-10 07:16:47,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:47,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:16:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:47,670 INFO L225 Difference]: With dead ends: 264129 [2019-09-10 07:16:47,670 INFO L226 Difference]: Without dead ends: 264129 [2019-09-10 07:16:47,671 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:16:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264129 states. [2019-09-10 07:16:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264129 to 245012. [2019-09-10 07:16:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245012 states. [2019-09-10 07:16:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245012 states to 245012 states and 346726 transitions. [2019-09-10 07:16:54,106 INFO L78 Accepts]: Start accepts. Automaton has 245012 states and 346726 transitions. Word has length 99 [2019-09-10 07:16:54,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:54,106 INFO L475 AbstractCegarLoop]: Abstraction has 245012 states and 346726 transitions. [2019-09-10 07:16:54,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 245012 states and 346726 transitions. [2019-09-10 07:16:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:16:54,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:54,135 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:16:54,135 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash -297155159, now seen corresponding path program 1 times [2019-09-10 07:16:54,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:54,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:54,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:54,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:54,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:54,197 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:16:54,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:54,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:54,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:54,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:54,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:54,198 INFO L87 Difference]: Start difference. First operand 245012 states and 346726 transitions. Second operand 3 states. [2019-09-10 07:16:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:54,945 INFO L93 Difference]: Finished difference Result 281958 states and 392712 transitions. [2019-09-10 07:16:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:54,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:16:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:55,455 INFO L225 Difference]: With dead ends: 281958 [2019-09-10 07:16:55,456 INFO L226 Difference]: Without dead ends: 253092 [2019-09-10 07:16:55,456 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:16:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253092 states. [2019-09-10 07:17:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253092 to 241172. [2019-09-10 07:17:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241172 states. [2019-09-10 07:17:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241172 states to 241172 states and 336360 transitions. [2019-09-10 07:17:02,409 INFO L78 Accepts]: Start accepts. Automaton has 241172 states and 336360 transitions. Word has length 99 [2019-09-10 07:17:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:02,410 INFO L475 AbstractCegarLoop]: Abstraction has 241172 states and 336360 transitions. [2019-09-10 07:17:02,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 241172 states and 336360 transitions. [2019-09-10 07:17:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:17:02,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:02,444 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:17:02,444 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1668131521, now seen corresponding path program 1 times [2019-09-10 07:17:02,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:02,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:02,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:02,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:02,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:02,504 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:17:02,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:02,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:02,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:02,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:02,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:02,506 INFO L87 Difference]: Start difference. First operand 241172 states and 336360 transitions. Second operand 3 states. [2019-09-10 07:17:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:03,510 INFO L93 Difference]: Finished difference Result 380052 states and 523561 transitions. [2019-09-10 07:17:03,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:03,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:17:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:04,188 INFO L225 Difference]: With dead ends: 380052 [2019-09-10 07:17:04,188 INFO L226 Difference]: Without dead ends: 374489 [2019-09-10 07:17:04,189 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:17:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374489 states. [2019-09-10 07:17:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374489 to 370233. [2019-09-10 07:17:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370233 states. [2019-09-10 07:17:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370233 states to 370233 states and 510796 transitions. [2019-09-10 07:17:18,799 INFO L78 Accepts]: Start accepts. Automaton has 370233 states and 510796 transitions. Word has length 99 [2019-09-10 07:17:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:18,799 INFO L475 AbstractCegarLoop]: Abstraction has 370233 states and 510796 transitions. [2019-09-10 07:17:18,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 370233 states and 510796 transitions. [2019-09-10 07:17:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:17:18,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:18,841 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:17:18,841 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1732651124, now seen corresponding path program 1 times [2019-09-10 07:17:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:18,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:18,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:18,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:18,950 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:17:18,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:17:18,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:17:18,951 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:17:18,953 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:17:18,963 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:17:18,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:17:18,994 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:17:19,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:17:19,220 INFO L272 AbstractInterpreter]: Visited 87 different actions 449 times. Merged at 45 different actions 305 times. Widened at 15 different actions 36 times. Performed 1620 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1620 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 34 fixpoints after 9 different actions. Largest state had 145 variables. [2019-09-10 07:17:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:19,220 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:17:19,445 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.73% of their original sizes. [2019-09-10 07:17:19,446 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:17:23,517 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:17:23,517 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:17:23,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:17:23,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [7] total 59 [2019-09-10 07:17:23,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:23,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 07:17:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 07:17:23,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:17:23,520 INFO L87 Difference]: Start difference. First operand 370233 states and 510796 transitions. Second operand 54 states. [2019-09-10 07:19:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:58,327 INFO L93 Difference]: Finished difference Result 701687 states and 950599 transitions. [2019-09-10 07:19:58,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 554 states. [2019-09-10 07:19:58,327 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 99 [2019-09-10 07:19:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:59,360 INFO L225 Difference]: With dead ends: 701687 [2019-09-10 07:19:59,360 INFO L226 Difference]: Without dead ends: 701652 [2019-09-10 07:19:59,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 580 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146717 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=34706, Invalid=303436, Unknown=0, NotChecked=0, Total=338142 [2019-09-10 07:20:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701652 states. [2019-09-10 07:20:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701652 to 412702. [2019-09-10 07:20:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412702 states. [2019-09-10 07:20:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412702 states to 412702 states and 563541 transitions. [2019-09-10 07:20:08,863 INFO L78 Accepts]: Start accepts. Automaton has 412702 states and 563541 transitions. Word has length 99 [2019-09-10 07:20:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:08,863 INFO L475 AbstractCegarLoop]: Abstraction has 412702 states and 563541 transitions. [2019-09-10 07:20:08,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 07:20:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 412702 states and 563541 transitions. [2019-09-10 07:20:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:20:08,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:08,905 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:20:08,905 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash -343746299, now seen corresponding path program 1 times [2019-09-10 07:20:08,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:08,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:08,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:15,920 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:20:15,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:20:15,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:20:15,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:20:15,922 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:20:15,925 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:20:15,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:20:15,944 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:20:16,096 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:20:16,096 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:20:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:16,097 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:20:16,223 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.53% of their original sizes. [2019-09-10 07:20:16,223 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:20:20,153 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:20:20,153 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:20:20,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:20:20,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:20:20,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:20,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:20:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:20:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2752, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:20:20,155 INFO L87 Difference]: Start difference. First operand 412702 states and 563541 transitions. Second operand 56 states. [2019-09-10 07:21:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:45,959 INFO L93 Difference]: Finished difference Result 695818 states and 947062 transitions. [2019-09-10 07:21:45,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2019-09-10 07:21:45,959 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 99 [2019-09-10 07:21:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:46,791 INFO L225 Difference]: With dead ends: 695818 [2019-09-10 07:21:46,791 INFO L226 Difference]: Without dead ends: 695818 [2019-09-10 07:21:46,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35217 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=11809, Invalid=76697, Unknown=0, NotChecked=0, Total=88506 [2019-09-10 07:21:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695818 states. [2019-09-10 07:21:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695818 to 434700. [2019-09-10 07:21:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434700 states. [2019-09-10 07:21:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434700 states to 434700 states and 591445 transitions. [2019-09-10 07:21:55,125 INFO L78 Accepts]: Start accepts. Automaton has 434700 states and 591445 transitions. Word has length 99 [2019-09-10 07:21:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:55,125 INFO L475 AbstractCegarLoop]: Abstraction has 434700 states and 591445 transitions. [2019-09-10 07:21:55,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:21:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 434700 states and 591445 transitions. [2019-09-10 07:21:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:21:55,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:55,168 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:21:55,168 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:55,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash -423295904, now seen corresponding path program 1 times [2019-09-10 07:21:55,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:55,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:55,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:55,262 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:21:55,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:21:55,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:21:55,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:21:55,263 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:21:55,265 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:21:55,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:21:55,282 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:21:55,417 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:21:55,417 INFO L272 AbstractInterpreter]: Visited 87 different actions 442 times. Merged at 45 different actions 303 times. Widened at 13 different actions 37 times. Performed 1564 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 32 fixpoints after 10 different actions. Largest state had 145 variables. [2019-09-10 07:21:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:55,417 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:21:57,114 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.79% of their original sizes. [2019-09-10 07:21:57,114 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:22:01,005 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:22:01,006 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:22:01,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:22:01,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [7] total 60 [2019-09-10 07:22:01,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:01,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 07:22:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 07:22:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2634, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 07:22:01,007 INFO L87 Difference]: Start difference. First operand 434700 states and 591445 transitions. Second operand 55 states. [2019-09-10 07:23:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:09,940 INFO L93 Difference]: Finished difference Result 697891 states and 950880 transitions. [2019-09-10 07:23:09,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-09-10 07:23:09,940 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 99 [2019-09-10 07:23:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:10,856 INFO L225 Difference]: With dead ends: 697891 [2019-09-10 07:23:10,856 INFO L226 Difference]: Without dead ends: 697891 [2019-09-10 07:23:10,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18375 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=6779, Invalid=41841, Unknown=0, NotChecked=0, Total=48620 [2019-09-10 07:23:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697891 states. [2019-09-10 07:23:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697891 to 452559. [2019-09-10 07:23:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452559 states. [2019-09-10 07:23:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452559 states to 452559 states and 613785 transitions. [2019-09-10 07:23:18,089 INFO L78 Accepts]: Start accepts. Automaton has 452559 states and 613785 transitions. Word has length 99 [2019-09-10 07:23:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:18,089 INFO L475 AbstractCegarLoop]: Abstraction has 452559 states and 613785 transitions. [2019-09-10 07:23:18,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 07:23:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 452559 states and 613785 transitions. [2019-09-10 07:23:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:23:18,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:18,132 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:23:18,132 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:18,132 INFO L82 PathProgramCache]: Analyzing trace with hash 262495149, now seen corresponding path program 1 times [2019-09-10 07:23:18,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:18,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:18,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:18,234 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:23:18,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:23:18,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:23:18,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:23:18,235 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:23:18,237 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:23:18,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:23:18,252 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:23:18,388 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:23:18,389 INFO L272 AbstractInterpreter]: Visited 87 different actions 472 times. Merged at 45 different actions 327 times. Widened at 12 different actions 36 times. Performed 1639 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1639 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:23:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:18,389 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:23:18,464 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80.72% of their original sizes. [2019-09-10 07:23:18,465 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:23:23,471 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:23:23,471 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:23:23,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:23:23,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:23:23,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:23,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:23:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:23:23,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2740, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:23:23,474 INFO L87 Difference]: Start difference. First operand 452559 states and 613785 transitions. Second operand 56 states. [2019-09-10 07:24:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:29,831 INFO L93 Difference]: Finished difference Result 713880 states and 970750 transitions. [2019-09-10 07:24:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-10 07:24:29,832 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 99 [2019-09-10 07:24:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:31,698 INFO L225 Difference]: With dead ends: 713880 [2019-09-10 07:24:31,698 INFO L226 Difference]: Without dead ends: 713880 [2019-09-10 07:24:31,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11685 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=5145, Invalid=28161, Unknown=0, NotChecked=0, Total=33306 [2019-09-10 07:24:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713880 states. [2019-09-10 07:24:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713880 to 466691. [2019-09-10 07:24:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466691 states. [2019-09-10 07:24:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466691 states to 466691 states and 631144 transitions. [2019-09-10 07:24:41,209 INFO L78 Accepts]: Start accepts. Automaton has 466691 states and 631144 transitions. Word has length 99 [2019-09-10 07:24:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:41,210 INFO L475 AbstractCegarLoop]: Abstraction has 466691 states and 631144 transitions. [2019-09-10 07:24:41,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:24:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 466691 states and 631144 transitions. [2019-09-10 07:24:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:24:41,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:41,263 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:24:41,264 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:41,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:41,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1101950771, now seen corresponding path program 1 times [2019-09-10 07:24:41,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:41,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:41,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:41,363 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:24:41,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:24:41,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:24:41,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 07:24:41,364 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:24:41,366 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:24:41,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:24:41,384 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:24:41,579 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:24:41,579 INFO L272 AbstractInterpreter]: Visited 89 different actions 519 times. Merged at 47 different actions 366 times. Widened at 17 different actions 55 times. Performed 1809 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1809 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 41 fixpoints after 11 different actions. Largest state had 146 variables. [2019-09-10 07:24:41,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:41,579 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:24:41,700 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 80.88% of their original sizes. [2019-09-10 07:24:41,700 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:24:46,665 INFO L420 sIntCurrentIteration]: We unified 100 AI predicates to 100 [2019-09-10 07:24:46,665 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:24:46,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:24:46,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:24:46,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:46,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:24:46,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:24:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2739, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:24:46,666 INFO L87 Difference]: Start difference. First operand 466691 states and 631144 transitions. Second operand 56 states. [2019-09-10 07:25:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:47,550 INFO L93 Difference]: Finished difference Result 777627 states and 1047449 transitions. [2019-09-10 07:25:47,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-09-10 07:25:47,550 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 101 [2019-09-10 07:25:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:49,163 INFO L225 Difference]: With dead ends: 777627 [2019-09-10 07:25:49,164 INFO L226 Difference]: Without dead ends: 777447 [2019-09-10 07:25:49,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31206 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=10326, Invalid=72906, Unknown=0, NotChecked=0, Total=83232 [2019-09-10 07:25:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777447 states. [2019-09-10 07:26:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777447 to 469676. [2019-09-10 07:26:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469676 states. [2019-09-10 07:26:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469676 states to 469676 states and 634072 transitions. [2019-09-10 07:26:03,300 INFO L78 Accepts]: Start accepts. Automaton has 469676 states and 634072 transitions. Word has length 101 [2019-09-10 07:26:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:03,300 INFO L475 AbstractCegarLoop]: Abstraction has 469676 states and 634072 transitions. [2019-09-10 07:26:03,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:26:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 469676 states and 634072 transitions. [2019-09-10 07:26:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:26:03,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:03,361 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:26:03,361 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:03,362 INFO L82 PathProgramCache]: Analyzing trace with hash 496238142, now seen corresponding path program 1 times [2019-09-10 07:26:03,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:03,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:03,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 07:26:03,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:03,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:03,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:03,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:03,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:03,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:03,535 INFO L87 Difference]: Start difference. First operand 469676 states and 634072 transitions. Second operand 7 states. [2019-09-10 07:26:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:10,533 INFO L93 Difference]: Finished difference Result 902688 states and 1242752 transitions. [2019-09-10 07:26:10,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:26:10,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-09-10 07:26:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:12,847 INFO L225 Difference]: With dead ends: 902688 [2019-09-10 07:26:12,847 INFO L226 Difference]: Without dead ends: 900477 [2019-09-10 07:26:12,847 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:26:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900477 states. [2019-09-10 07:26:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900477 to 610532. [2019-09-10 07:26:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610532 states. [2019-09-10 07:26:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610532 states to 610532 states and 828972 transitions. [2019-09-10 07:26:29,100 INFO L78 Accepts]: Start accepts. Automaton has 610532 states and 828972 transitions. Word has length 101 [2019-09-10 07:26:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:29,100 INFO L475 AbstractCegarLoop]: Abstraction has 610532 states and 828972 transitions. [2019-09-10 07:26:29,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:26:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 610532 states and 828972 transitions. [2019-09-10 07:26:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:26:29,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:29,163 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:26:29,164 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash -909927049, now seen corresponding path program 1 times [2019-09-10 07:26:29,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:29,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:29,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:29,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:29,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:29,251 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:26:29,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:29,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:29,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 07:26:29,252 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], [328], [331], [334], [336], [338], [376], [378], [391], [399], [418], [420], [423], [431], [434], [437], [440], [442], [444], [508], [509], [513], [514], [515] [2019-09-10 07:26:29,254 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:29,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:29,271 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:29,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:26:29,424 INFO L272 AbstractInterpreter]: Visited 89 different actions 459 times. Merged at 47 different actions 315 times. Widened at 14 different actions 43 times. Performed 1690 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1690 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 34 fixpoints after 9 different actions. Largest state had 146 variables. [2019-09-10 07:26:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:29,425 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:26:29,522 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 81.07% of their original sizes. [2019-09-10 07:26:29,523 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:26:34,676 INFO L420 sIntCurrentIteration]: We unified 100 AI predicates to 100 [2019-09-10 07:26:34,676 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:26:34,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:26:34,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [7] total 62 [2019-09-10 07:26:34,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:34,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 07:26:34,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 07:26:34,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=2842, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:26:34,678 INFO L87 Difference]: Start difference. First operand 610532 states and 828972 transitions. Second operand 57 states.