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.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:48:51,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:48:51,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:48:51,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:48:51,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:48:51,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:48:51,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:48:51,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:48:51,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:48:51,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:48:51,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:48:51,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:48:51,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:48:51,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:48:51,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:48:51,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:48:51,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:48:51,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:48:51,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:48:51,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:48:51,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:48:51,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:48:51,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:48:51,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:48:51,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:48:51,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:48:51,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:48:51,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:48:51,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:48:51,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:48:51,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:48:51,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:48:51,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:48:51,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:48:51,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:48:51,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:48:51,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:48:51,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:48:51,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:48:51,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:48:51,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:48:51,623 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 06:48:51,656 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:48:51,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:48:51,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:48:51,657 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:48:51,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:48:51,658 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:48:51,660 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:48:51,660 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:48:51,660 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:48:51,660 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:48:51,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:48:51,661 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:48:51,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:48:51,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:48:51,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:48:51,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:48:51,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:48:51,662 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:48:51,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:48:51,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:48:51,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:48:51,665 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:48:51,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:48:51,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:48:51,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:48:51,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:48:51,666 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:48:51,666 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:48:51,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:48:51,667 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:48:51,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:48:51,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:48:51,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:48:51,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:48:51,727 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:48:51,727 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.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:48:51,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c739b1cf/cabfbab9c0954ae5b01675edabe47e7a/FLAG3d17f7496 [2019-09-10 06:48:52,301 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:48:52,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:48:52,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c739b1cf/cabfbab9c0954ae5b01675edabe47e7a/FLAG3d17f7496 [2019-09-10 06:48:52,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c739b1cf/cabfbab9c0954ae5b01675edabe47e7a [2019-09-10 06:48:52,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:48:52,633 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:48:52,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:48:52,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:48:52,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:48:52,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:48:52" (1/1) ... [2019-09-10 06:48:52,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2691675c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:52, skipping insertion in model container [2019-09-10 06:48:52,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:48:52" (1/1) ... [2019-09-10 06:48:52,649 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:48:52,690 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:48:53,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:48:53,183 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:48:53,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:48:53,285 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:48:53,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53 WrapperNode [2019-09-10 06:48:53,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:48:53,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:48:53,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:48:53,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:48:53,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (1/1) ... [2019-09-10 06:48:53,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (1/1) ... [2019-09-10 06:48:53,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (1/1) ... [2019-09-10 06:48:53,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (1/1) ... [2019-09-10 06:48:53,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (1/1) ... [2019-09-10 06:48:53,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (1/1) ... [2019-09-10 06:48:53,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (1/1) ... [2019-09-10 06:48:53,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:48:53,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:48:53,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:48:53,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:48:53,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (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 06:48:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:48:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:48:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:48:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:48:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:48:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:48:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:48:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:48:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:48:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:48:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:48:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:48:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:48:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:48:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:48:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:48:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:48:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:48:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:48:54,085 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:48:54,087 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:48:54,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:48:54 BoogieIcfgContainer [2019-09-10 06:48:54,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:48:54,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:48:54,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:48:54,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:48:54,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:48:52" (1/3) ... [2019-09-10 06:48:54,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0bb3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:48:54, skipping insertion in model container [2019-09-10 06:48:54,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:53" (2/3) ... [2019-09-10 06:48:54,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0bb3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:48:54, skipping insertion in model container [2019-09-10 06:48:54,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:48:54" (3/3) ... [2019-09-10 06:48:54,103 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:48:54,114 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:48:54,138 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:48:54,158 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:48:54,194 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:48:54,194 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:48:54,194 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:48:54,195 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:48:54,195 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:48:54,196 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:48:54,196 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:48:54,196 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:48:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-09-10 06:48:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 06:48:54,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:54,254 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] [2019-09-10 06:48:54,259 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:54,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1173815041, now seen corresponding path program 1 times [2019-09-10 06:48:54,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:54,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:54,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:54,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:54,671 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 06:48:54,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:54,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:54,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:54,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:54,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:54,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:54,698 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-09-10 06:48:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:54,768 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2019-09-10 06:48:54,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:54,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 06:48:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:54,796 INFO L225 Difference]: With dead ends: 183 [2019-09-10 06:48:54,797 INFO L226 Difference]: Without dead ends: 175 [2019-09-10 06:48:54,800 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 06:48:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-10 06:48:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2019-09-10 06:48:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-10 06:48:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2019-09-10 06:48:54,853 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 52 [2019-09-10 06:48:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:54,853 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2019-09-10 06:48:54,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2019-09-10 06:48:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 06:48:54,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:54,860 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] [2019-09-10 06:48:54,860 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1357822606, now seen corresponding path program 1 times [2019-09-10 06:48:54,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:54,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:54,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:54,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:55,038 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 06:48:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:55,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:55,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:55,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:55,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:55,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:55,041 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand 3 states. [2019-09-10 06:48:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:55,075 INFO L93 Difference]: Finished difference Result 283 states and 429 transitions. [2019-09-10 06:48:55,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:55,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 06:48:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:55,079 INFO L225 Difference]: With dead ends: 283 [2019-09-10 06:48:55,079 INFO L226 Difference]: Without dead ends: 283 [2019-09-10 06:48:55,080 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 06:48:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-10 06:48:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2019-09-10 06:48:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-10 06:48:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 428 transitions. [2019-09-10 06:48:55,105 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 428 transitions. Word has length 53 [2019-09-10 06:48:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:55,106 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 428 transitions. [2019-09-10 06:48:55,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 428 transitions. [2019-09-10 06:48:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:48:55,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:55,108 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] [2019-09-10 06:48:55,108 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1224986484, now seen corresponding path program 1 times [2019-09-10 06:48:55,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:55,237 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 06:48:55,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:55,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:55,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:55,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:55,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:55,240 INFO L87 Difference]: Start difference. First operand 281 states and 428 transitions. Second operand 3 states. [2019-09-10 06:48:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:55,268 INFO L93 Difference]: Finished difference Result 467 states and 717 transitions. [2019-09-10 06:48:55,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:55,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-10 06:48:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:55,272 INFO L225 Difference]: With dead ends: 467 [2019-09-10 06:48:55,273 INFO L226 Difference]: Without dead ends: 467 [2019-09-10 06:48:55,273 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 06:48:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-10 06:48:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2019-09-10 06:48:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 06:48:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 716 transitions. [2019-09-10 06:48:55,304 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 716 transitions. Word has length 54 [2019-09-10 06:48:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:55,304 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 716 transitions. [2019-09-10 06:48:55,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 716 transitions. [2019-09-10 06:48:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:48:55,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:55,306 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] [2019-09-10 06:48:55,307 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:55,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash 781354829, now seen corresponding path program 1 times [2019-09-10 06:48:55,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:55,413 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 06:48:55,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:55,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:55,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:55,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:55,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:55,416 INFO L87 Difference]: Start difference. First operand 465 states and 716 transitions. Second operand 3 states. [2019-09-10 06:48:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:55,442 INFO L93 Difference]: Finished difference Result 771 states and 1185 transitions. [2019-09-10 06:48:55,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:55,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:48:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:55,448 INFO L225 Difference]: With dead ends: 771 [2019-09-10 06:48:55,448 INFO L226 Difference]: Without dead ends: 771 [2019-09-10 06:48:55,449 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 06:48:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-10 06:48:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2019-09-10 06:48:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-10 06:48:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1184 transitions. [2019-09-10 06:48:55,483 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1184 transitions. Word has length 55 [2019-09-10 06:48:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:55,483 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 1184 transitions. [2019-09-10 06:48:55,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1184 transitions. [2019-09-10 06:48:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:48:55,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:55,486 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] [2019-09-10 06:48:55,486 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:55,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:55,487 INFO L82 PathProgramCache]: Analyzing trace with hash -895952899, now seen corresponding path program 1 times [2019-09-10 06:48:55,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:55,620 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 06:48:55,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:55,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:55,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:55,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:55,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:55,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:55,626 INFO L87 Difference]: Start difference. First operand 769 states and 1184 transitions. Second operand 6 states. [2019-09-10 06:48:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:55,825 INFO L93 Difference]: Finished difference Result 3721 states and 5764 transitions. [2019-09-10 06:48:55,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:48:55,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:48:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:55,852 INFO L225 Difference]: With dead ends: 3721 [2019-09-10 06:48:55,852 INFO L226 Difference]: Without dead ends: 3721 [2019-09-10 06:48:55,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2019-09-10 06:48:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 1505. [2019-09-10 06:48:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2019-09-10 06:48:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2304 transitions. [2019-09-10 06:48:55,957 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2304 transitions. Word has length 56 [2019-09-10 06:48:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:55,958 INFO L475 AbstractCegarLoop]: Abstraction has 1505 states and 2304 transitions. [2019-09-10 06:48:55,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2304 transitions. [2019-09-10 06:48:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:48:55,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:55,966 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] [2019-09-10 06:48:55,967 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2023268854, now seen corresponding path program 1 times [2019-09-10 06:48:55,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:56,168 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 06:48:56,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:56,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:56,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:56,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:56,170 INFO L87 Difference]: Start difference. First operand 1505 states and 2304 transitions. Second operand 6 states. [2019-09-10 06:48:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:56,336 INFO L93 Difference]: Finished difference Result 5031 states and 7619 transitions. [2019-09-10 06:48:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:48:56,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:48:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:56,364 INFO L225 Difference]: With dead ends: 5031 [2019-09-10 06:48:56,364 INFO L226 Difference]: Without dead ends: 5031 [2019-09-10 06:48:56,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2019-09-10 06:48:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 5025. [2019-09-10 06:48:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-09-10 06:48:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7616 transitions. [2019-09-10 06:48:56,494 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7616 transitions. Word has length 57 [2019-09-10 06:48:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:56,495 INFO L475 AbstractCegarLoop]: Abstraction has 5025 states and 7616 transitions. [2019-09-10 06:48:56,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7616 transitions. [2019-09-10 06:48:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:48:56,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:56,497 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] [2019-09-10 06:48:56,497 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:56,497 INFO L82 PathProgramCache]: Analyzing trace with hash -837113055, now seen corresponding path program 1 times [2019-09-10 06:48:56,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:56,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:56,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:56,571 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 06:48:56,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:56,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:56,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:56,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:56,573 INFO L87 Difference]: Start difference. First operand 5025 states and 7616 transitions. Second operand 5 states. [2019-09-10 06:48:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:56,862 INFO L93 Difference]: Finished difference Result 10019 states and 15089 transitions. [2019-09-10 06:48:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:56,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 06:48:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:57,032 INFO L225 Difference]: With dead ends: 10019 [2019-09-10 06:48:57,032 INFO L226 Difference]: Without dead ends: 10019 [2019-09-10 06:48:57,033 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 06:48:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10019 states. [2019-09-10 06:48:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10019 to 10017. [2019-09-10 06:48:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10017 states. [2019-09-10 06:48:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10017 states to 10017 states and 15088 transitions. [2019-09-10 06:48:57,347 INFO L78 Accepts]: Start accepts. Automaton has 10017 states and 15088 transitions. Word has length 59 [2019-09-10 06:48:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:57,347 INFO L475 AbstractCegarLoop]: Abstraction has 10017 states and 15088 transitions. [2019-09-10 06:48:57,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 10017 states and 15088 transitions. [2019-09-10 06:48:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:48:57,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:57,349 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] [2019-09-10 06:48:57,349 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:57,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash 932858652, now seen corresponding path program 1 times [2019-09-10 06:48:57,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:57,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:57,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:57,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:57,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:57,452 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 06:48:57,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:57,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:57,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:57,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:57,454 INFO L87 Difference]: Start difference. First operand 10017 states and 15088 transitions. Second operand 5 states. [2019-09-10 06:48:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:57,620 INFO L93 Difference]: Finished difference Result 20513 states and 30400 transitions. [2019-09-10 06:48:57,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:48:57,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 06:48:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:57,690 INFO L225 Difference]: With dead ends: 20513 [2019-09-10 06:48:57,690 INFO L226 Difference]: Without dead ends: 20513 [2019-09-10 06:48:57,691 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 06:48:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20513 states. [2019-09-10 06:48:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20513 to 10529. [2019-09-10 06:48:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10529 states. [2019-09-10 06:48:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 15600 transitions. [2019-09-10 06:48:58,148 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 15600 transitions. Word has length 59 [2019-09-10 06:48:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:58,149 INFO L475 AbstractCegarLoop]: Abstraction has 10529 states and 15600 transitions. [2019-09-10 06:48:58,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 15600 transitions. [2019-09-10 06:48:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:48:58,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:58,150 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] [2019-09-10 06:48:58,151 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1136533126, now seen corresponding path program 1 times [2019-09-10 06:48:58,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:58,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:58,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:58,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:58,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:58,217 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 06:48:58,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:58,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:58,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:58,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:58,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:58,219 INFO L87 Difference]: Start difference. First operand 10529 states and 15600 transitions. Second operand 3 states. [2019-09-10 06:48:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:58,286 INFO L93 Difference]: Finished difference Result 12893 states and 18967 transitions. [2019-09-10 06:48:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:58,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:48:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:58,320 INFO L225 Difference]: With dead ends: 12893 [2019-09-10 06:48:58,320 INFO L226 Difference]: Without dead ends: 12893 [2019-09-10 06:48:58,321 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 06:48:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12893 states. [2019-09-10 06:48:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12893 to 12891. [2019-09-10 06:48:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12891 states. [2019-09-10 06:48:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 18966 transitions. [2019-09-10 06:48:58,684 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 18966 transitions. Word has length 60 [2019-09-10 06:48:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:58,685 INFO L475 AbstractCegarLoop]: Abstraction has 12891 states and 18966 transitions. [2019-09-10 06:48:58,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 18966 transitions. [2019-09-10 06:48:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:48:58,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:58,694 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] [2019-09-10 06:48:58,694 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:58,694 INFO L82 PathProgramCache]: Analyzing trace with hash 324055568, now seen corresponding path program 1 times [2019-09-10 06:48:58,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:58,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:58,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:58,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:48:58,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:58,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:58,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 06:48:58,834 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], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [159], [164], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [336], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 06:48:58,877 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:58,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:59,027 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:59,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:59,521 INFO L272 AbstractInterpreter]: Visited 74 different actions 485 times. Merged at 43 different actions 352 times. Widened at 18 different actions 60 times. Performed 1703 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1703 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 50 fixpoints after 13 different actions. Largest state had 121 variables. [2019-09-10 06:48:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:59,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:59,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:59,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:48:59,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:59,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:48:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:59,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 06:48:59,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:48:59,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:59,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:59,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:48:59,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:59,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 7 [2019-09-10 06:48:59,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:59,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:48:59,887 INFO L87 Difference]: Start difference. First operand 12891 states and 18966 transitions. Second operand 5 states. [2019-09-10 06:49:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:00,548 INFO L93 Difference]: Finished difference Result 23085 states and 33664 transitions. [2019-09-10 06:49:00,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:00,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 06:49:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:00,614 INFO L225 Difference]: With dead ends: 23085 [2019-09-10 06:49:00,614 INFO L226 Difference]: Without dead ends: 23085 [2019-09-10 06:49:00,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:49:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23085 states. [2019-09-10 06:49:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23085 to 22051. [2019-09-10 06:49:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22051 states. [2019-09-10 06:49:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22051 states to 22051 states and 32166 transitions. [2019-09-10 06:49:01,156 INFO L78 Accepts]: Start accepts. Automaton has 22051 states and 32166 transitions. Word has length 81 [2019-09-10 06:49:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:01,156 INFO L475 AbstractCegarLoop]: Abstraction has 22051 states and 32166 transitions. [2019-09-10 06:49:01,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:49:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22051 states and 32166 transitions. [2019-09-10 06:49:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:49:01,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:01,168 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:49:01,169 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 429171158, now seen corresponding path program 1 times [2019-09-10 06:49:01,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:01,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:01,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:01,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:01,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:01,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:01,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:01,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:01,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:01,253 INFO L87 Difference]: Start difference. First operand 22051 states and 32166 transitions. Second operand 3 states. [2019-09-10 06:49:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:01,361 INFO L93 Difference]: Finished difference Result 34866 states and 50127 transitions. [2019-09-10 06:49:01,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:01,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:49:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:01,440 INFO L225 Difference]: With dead ends: 34866 [2019-09-10 06:49:01,440 INFO L226 Difference]: Without dead ends: 34866 [2019-09-10 06:49:01,441 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 06:49:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34866 states. [2019-09-10 06:49:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34866 to 33440. [2019-09-10 06:49:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33440 states. [2019-09-10 06:49:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33440 states to 33440 states and 48204 transitions. [2019-09-10 06:49:02,082 INFO L78 Accepts]: Start accepts. Automaton has 33440 states and 48204 transitions. Word has length 82 [2019-09-10 06:49:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:02,083 INFO L475 AbstractCegarLoop]: Abstraction has 33440 states and 48204 transitions. [2019-09-10 06:49:02,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 33440 states and 48204 transitions. [2019-09-10 06:49:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:49:02,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:02,095 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:49:02,095 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1049279691, now seen corresponding path program 1 times [2019-09-10 06:49:02,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:02,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:02,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:02,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:02,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:02,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:02,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:02,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:02,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:02,168 INFO L87 Difference]: Start difference. First operand 33440 states and 48204 transitions. Second operand 3 states. [2019-09-10 06:49:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:02,481 INFO L93 Difference]: Finished difference Result 47600 states and 67406 transitions. [2019-09-10 06:49:02,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:02,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:49:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:02,569 INFO L225 Difference]: With dead ends: 47600 [2019-09-10 06:49:02,570 INFO L226 Difference]: Without dead ends: 47600 [2019-09-10 06:49:02,570 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 06:49:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47600 states. [2019-09-10 06:49:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47600 to 45526. [2019-09-10 06:49:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45526 states. [2019-09-10 06:49:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45526 states to 45526 states and 64689 transitions. [2019-09-10 06:49:03,231 INFO L78 Accepts]: Start accepts. Automaton has 45526 states and 64689 transitions. Word has length 82 [2019-09-10 06:49:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:03,231 INFO L475 AbstractCegarLoop]: Abstraction has 45526 states and 64689 transitions. [2019-09-10 06:49:03,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 45526 states and 64689 transitions. [2019-09-10 06:49:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:49:03,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:03,244 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:49:03,244 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1536115522, now seen corresponding path program 1 times [2019-09-10 06:49:03,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:03,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:03,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:03,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:03,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:03,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:03,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:03,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:03,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:03,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:03,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:03,324 INFO L87 Difference]: Start difference. First operand 45526 states and 64689 transitions. Second operand 3 states. [2019-09-10 06:49:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:03,814 INFO L93 Difference]: Finished difference Result 52731 states and 73559 transitions. [2019-09-10 06:49:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:03,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:49:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:03,951 INFO L225 Difference]: With dead ends: 52731 [2019-09-10 06:49:03,951 INFO L226 Difference]: Without dead ends: 47577 [2019-09-10 06:49:03,952 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 06:49:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47577 states. [2019-09-10 06:49:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47577 to 45741. [2019-09-10 06:49:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45741 states. [2019-09-10 06:49:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45741 states to 45741 states and 63955 transitions. [2019-09-10 06:49:05,966 INFO L78 Accepts]: Start accepts. Automaton has 45741 states and 63955 transitions. Word has length 82 [2019-09-10 06:49:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:05,967 INFO L475 AbstractCegarLoop]: Abstraction has 45741 states and 63955 transitions. [2019-09-10 06:49:05,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 45741 states and 63955 transitions. [2019-09-10 06:49:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:49:05,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:05,981 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:49:05,982 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:05,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1323355809, now seen corresponding path program 1 times [2019-09-10 06:49:05,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:05,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:05,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:06,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:06,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:06,107 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 06:49:06,107 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], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [327], [330], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 06:49:06,117 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:06,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:06,147 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:06,438 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:49:06,438 INFO L272 AbstractInterpreter]: Visited 71 different actions 332 times. Merged at 37 different actions 220 times. Widened at 12 different actions 24 times. Performed 1215 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 06:49:06,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:06,439 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:49:06,785 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 80.79% of their original sizes. [2019-09-10 06:49:06,785 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:49:09,999 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 06:49:10,000 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:49:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:49:10,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 06:49:10,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:10,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 06:49:10,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 06:49:10,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1914, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:49:10,003 INFO L87 Difference]: Start difference. First operand 45741 states and 63955 transitions. Second operand 47 states. [2019-09-10 06:49:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:53,180 INFO L93 Difference]: Finished difference Result 94247 states and 129938 transitions. [2019-09-10 06:49:53,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-10 06:49:53,181 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 82 [2019-09-10 06:49:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:53,301 INFO L225 Difference]: With dead ends: 94247 [2019-09-10 06:49:53,302 INFO L226 Difference]: Without dead ends: 94148 [2019-09-10 06:49:53,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12511 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=5027, Invalid=31263, Unknown=0, NotChecked=0, Total=36290 [2019-09-10 06:49:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94148 states. [2019-09-10 06:49:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94148 to 54829. [2019-09-10 06:49:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54829 states. [2019-09-10 06:49:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54829 states to 54829 states and 75861 transitions. [2019-09-10 06:49:54,084 INFO L78 Accepts]: Start accepts. Automaton has 54829 states and 75861 transitions. Word has length 82 [2019-09-10 06:49:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:54,084 INFO L475 AbstractCegarLoop]: Abstraction has 54829 states and 75861 transitions. [2019-09-10 06:49:54,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 06:49:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 54829 states and 75861 transitions. [2019-09-10 06:49:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:49:54,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:54,100 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:49:54,100 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:54,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1092382182, now seen corresponding path program 1 times [2019-09-10 06:49:54,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:54,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:54,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:54,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:54,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:54,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:54,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:54,203 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 06:49:54,204 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], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 06:49:54,208 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:54,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:54,223 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:54,332 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:49:54,333 INFO L272 AbstractInterpreter]: Visited 71 different actions 319 times. Merged at 37 different actions 210 times. Widened at 9 different actions 18 times. Performed 1149 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1149 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 06:49:54,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:54,333 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:49:54,443 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 80.78% of their original sizes. [2019-09-10 06:49:54,444 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:49:58,028 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 06:49:58,029 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:49:58,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:49:58,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 06:49:58,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:58,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 06:49:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 06:49:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2097, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:49:58,031 INFO L87 Difference]: Start difference. First operand 54829 states and 75861 transitions. Second operand 49 states. [2019-09-10 06:50:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:42,973 INFO L93 Difference]: Finished difference Result 105574 states and 144367 transitions. [2019-09-10 06:50:42,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-10 06:50:42,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 82 [2019-09-10 06:50:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:43,101 INFO L225 Difference]: With dead ends: 105574 [2019-09-10 06:50:43,102 INFO L226 Difference]: Without dead ends: 105556 [2019-09-10 06:50:43,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11220 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=4572, Invalid=27648, Unknown=0, NotChecked=0, Total=32220 [2019-09-10 06:50:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105556 states. [2019-09-10 06:50:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105556 to 62080. [2019-09-10 06:50:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62080 states. [2019-09-10 06:50:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62080 states to 62080 states and 85315 transitions. [2019-09-10 06:50:45,729 INFO L78 Accepts]: Start accepts. Automaton has 62080 states and 85315 transitions. Word has length 82 [2019-09-10 06:50:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:45,730 INFO L475 AbstractCegarLoop]: Abstraction has 62080 states and 85315 transitions. [2019-09-10 06:50:45,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 06:50:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 62080 states and 85315 transitions. [2019-09-10 06:50:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:50:45,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:45,743 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:50:45,743 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:45,744 INFO L82 PathProgramCache]: Analyzing trace with hash 596777845, now seen corresponding path program 1 times [2019-09-10 06:50:45,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:45,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:45,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:45,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:45,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:45,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:45,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:45,837 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 06:50:45,838 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], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 06:50:45,840 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:45,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:45,854 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:45,959 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:50:45,959 INFO L272 AbstractInterpreter]: Visited 71 different actions 359 times. Merged at 37 different actions 243 times. Widened at 13 different actions 32 times. Performed 1293 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1293 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 06:50:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:45,960 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:50:46,068 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 81.2% of their original sizes. [2019-09-10 06:50:46,069 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:50:48,448 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 06:50:48,448 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:50:48,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:50:48,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [7] total 51 [2019-09-10 06:50:48,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:48,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 06:50:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 06:50:48,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1824, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:50:48,450 INFO L87 Difference]: Start difference. First operand 62080 states and 85315 transitions. Second operand 46 states. [2019-09-10 06:51:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:40,369 INFO L93 Difference]: Finished difference Result 113804 states and 154372 transitions. [2019-09-10 06:51:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2019-09-10 06:51:40,370 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 82 [2019-09-10 06:51:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:40,499 INFO L225 Difference]: With dead ends: 113804 [2019-09-10 06:51:40,499 INFO L226 Difference]: Without dead ends: 113792 [2019-09-10 06:51:40,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23597 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=8361, Invalid=51419, Unknown=0, NotChecked=0, Total=59780 [2019-09-10 06:51:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113792 states. [2019-09-10 06:51:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113792 to 70056. [2019-09-10 06:51:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70056 states. [2019-09-10 06:51:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70056 states to 70056 states and 95242 transitions. [2019-09-10 06:51:41,406 INFO L78 Accepts]: Start accepts. Automaton has 70056 states and 95242 transitions. Word has length 82 [2019-09-10 06:51:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:41,406 INFO L475 AbstractCegarLoop]: Abstraction has 70056 states and 95242 transitions. [2019-09-10 06:51:41,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 06:51:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 70056 states and 95242 transitions. [2019-09-10 06:51:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:51:41,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:41,423 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:51:41,423 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2014317374, now seen corresponding path program 1 times [2019-09-10 06:51:41,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:41,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:41,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:41,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:41,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 06:51:41,520 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], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 06:51:41,522 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:41,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:41,537 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:41,663 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:51:41,663 INFO L272 AbstractInterpreter]: Visited 71 different actions 358 times. Merged at 37 different actions 244 times. Widened at 10 different actions 33 times. Performed 1278 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1278 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 06:51:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:41,664 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:51:41,792 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 81.06% of their original sizes. [2019-09-10 06:51:41,793 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:51:44,389 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 06:51:44,389 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:51:44,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:51:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 06:51:44,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:44,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 06:51:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 06:51:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2089, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:51:44,392 INFO L87 Difference]: Start difference. First operand 70056 states and 95242 transitions. Second operand 49 states. [2019-09-10 06:52:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:29,501 INFO L93 Difference]: Finished difference Result 116005 states and 157802 transitions. [2019-09-10 06:52:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-10 06:52:29,501 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 82 [2019-09-10 06:52:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:29,612 INFO L225 Difference]: With dead ends: 116005 [2019-09-10 06:52:29,612 INFO L226 Difference]: Without dead ends: 116005 [2019-09-10 06:52:29,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8942 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=4170, Invalid=21270, Unknown=0, NotChecked=0, Total=25440 [2019-09-10 06:52:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116005 states. [2019-09-10 06:52:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116005 to 74835. [2019-09-10 06:52:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74835 states. [2019-09-10 06:52:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74835 states to 74835 states and 101341 transitions. [2019-09-10 06:52:30,460 INFO L78 Accepts]: Start accepts. Automaton has 74835 states and 101341 transitions. Word has length 82 [2019-09-10 06:52:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:30,461 INFO L475 AbstractCegarLoop]: Abstraction has 74835 states and 101341 transitions. [2019-09-10 06:52:30,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 06:52:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 74835 states and 101341 transitions. [2019-09-10 06:52:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:52:30,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:30,473 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:30,473 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 845153957, now seen corresponding path program 1 times [2019-09-10 06:52:30,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:30,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:30,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:30,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:30,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:30,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:52:30,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:30,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:52:30,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:52:30,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:30,537 INFO L87 Difference]: Start difference. First operand 74835 states and 101341 transitions. Second operand 3 states. [2019-09-10 06:52:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:30,808 INFO L93 Difference]: Finished difference Result 116674 states and 156831 transitions. [2019-09-10 06:52:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:52:30,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:52:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:30,932 INFO L225 Difference]: With dead ends: 116674 [2019-09-10 06:52:30,933 INFO L226 Difference]: Without dead ends: 116259 [2019-09-10 06:52:30,933 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 06:52:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116259 states. [2019-09-10 06:52:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116259 to 116001. [2019-09-10 06:52:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116001 states. [2019-09-10 06:52:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116001 states to 116001 states and 156012 transitions. [2019-09-10 06:52:32,753 INFO L78 Accepts]: Start accepts. Automaton has 116001 states and 156012 transitions. Word has length 82 [2019-09-10 06:52:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:32,754 INFO L475 AbstractCegarLoop]: Abstraction has 116001 states and 156012 transitions. [2019-09-10 06:52:32,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 116001 states and 156012 transitions. [2019-09-10 06:52:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:52:32,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:32,774 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:32,774 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:32,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:32,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1641210552, now seen corresponding path program 1 times [2019-09-10 06:52:32,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:32,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:32,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:32,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:32,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:52:32,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:32,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:52:32,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:32,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:52:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:52:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:52:32,876 INFO L87 Difference]: Start difference. First operand 116001 states and 156012 transitions. Second operand 6 states. [2019-09-10 06:52:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:33,483 INFO L93 Difference]: Finished difference Result 190757 states and 260722 transitions. [2019-09-10 06:52:33,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:52:33,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 06:52:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:33,713 INFO L225 Difference]: With dead ends: 190757 [2019-09-10 06:52:33,713 INFO L226 Difference]: Without dead ends: 190354 [2019-09-10 06:52:33,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190354 states. [2019-09-10 06:52:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190354 to 149453. [2019-09-10 06:52:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149453 states. [2019-09-10 06:52:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149453 states to 149453 states and 202070 transitions. [2019-09-10 06:52:35,502 INFO L78 Accepts]: Start accepts. Automaton has 149453 states and 202070 transitions. Word has length 84 [2019-09-10 06:52:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:35,502 INFO L475 AbstractCegarLoop]: Abstraction has 149453 states and 202070 transitions. [2019-09-10 06:52:35,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:52:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 149453 states and 202070 transitions. [2019-09-10 06:52:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:52:35,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:35,521 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:35,521 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:35,521 INFO L82 PathProgramCache]: Analyzing trace with hash -747025901, now seen corresponding path program 1 times [2019-09-10 06:52:35,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:35,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:35,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:35,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:35,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:35,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 06:52:35,609 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], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [288], [291], [294], [296], [298], [327], [330], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 06:52:35,613 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:35,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:35,628 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:38,834 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:52:38,834 INFO L272 AbstractInterpreter]: Visited 73 different actions 387 times. Merged at 39 different actions 266 times. Widened at 15 different actions 40 times. Performed 1414 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1414 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 122 variables. [2019-09-10 06:52:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:38,835 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:52:38,915 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.22% of their original sizes. [2019-09-10 06:52:38,915 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:52:41,425 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 06:52:41,425 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:52:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:52:41,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 06:52:41,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:41,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 06:52:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 06:52:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2085, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:52:41,427 INFO L87 Difference]: Start difference. First operand 149453 states and 202070 transitions. Second operand 49 states. [2019-09-10 06:53:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:29,431 INFO L93 Difference]: Finished difference Result 247028 states and 334061 transitions. [2019-09-10 06:53:29,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-09-10 06:53:29,432 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 84 [2019-09-10 06:53:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:29,696 INFO L225 Difference]: With dead ends: 247028 [2019-09-10 06:53:29,696 INFO L226 Difference]: Without dead ends: 247019 [2019-09-10 06:53:29,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21250 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=7587, Invalid=49295, Unknown=0, NotChecked=0, Total=56882 [2019-09-10 06:53:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247019 states. [2019-09-10 06:53:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247019 to 153609. [2019-09-10 06:53:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153609 states. [2019-09-10 06:53:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153609 states to 153609 states and 207374 transitions. [2019-09-10 06:53:31,983 INFO L78 Accepts]: Start accepts. Automaton has 153609 states and 207374 transitions. Word has length 84 [2019-09-10 06:53:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:31,984 INFO L475 AbstractCegarLoop]: Abstraction has 153609 states and 207374 transitions. [2019-09-10 06:53:31,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 06:53:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 153609 states and 207374 transitions. [2019-09-10 06:53:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:53:32,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:32,002 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:53:32,003 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:32,003 INFO L82 PathProgramCache]: Analyzing trace with hash 47949475, now seen corresponding path program 1 times [2019-09-10 06:53:32,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:32,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:32,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:32,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:32,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:32,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 06:53:32,097 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], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [336], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 06:53:32,100 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:32,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:32,113 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:32,267 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:53:32,268 INFO L272 AbstractInterpreter]: Visited 73 different actions 421 times. Merged at 39 different actions 297 times. Widened at 17 different actions 55 times. Performed 1505 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1505 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 122 variables. [2019-09-10 06:53:32,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:32,269 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:53:32,374 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.6% of their original sizes. [2019-09-10 06:53:32,374 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:53:35,208 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 06:53:35,209 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:53:35,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:53:35,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 06:53:35,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:35,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 06:53:35,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 06:53:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1909, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:53:35,211 INFO L87 Difference]: Start difference. First operand 153609 states and 207374 transitions. Second operand 47 states. [2019-09-10 06:54:52,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:52,190 INFO L93 Difference]: Finished difference Result 310703 states and 412110 transitions. [2019-09-10 06:54:52,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 370 states. [2019-09-10 06:54:52,190 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 84 [2019-09-10 06:54:52,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:52,493 INFO L225 Difference]: With dead ends: 310703 [2019-09-10 06:54:52,494 INFO L226 Difference]: Without dead ends: 310703 [2019-09-10 06:54:52,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67382 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=17049, Invalid=136223, Unknown=0, NotChecked=0, Total=153272 [2019-09-10 06:54:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310703 states. [2019-09-10 06:54:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310703 to 186520. [2019-09-10 06:54:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186520 states. [2019-09-10 06:54:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186520 states to 186520 states and 248412 transitions. [2019-09-10 06:54:55,405 INFO L78 Accepts]: Start accepts. Automaton has 186520 states and 248412 transitions. Word has length 84 [2019-09-10 06:54:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:55,405 INFO L475 AbstractCegarLoop]: Abstraction has 186520 states and 248412 transitions. [2019-09-10 06:54:55,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 06:54:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 186520 states and 248412 transitions. [2019-09-10 06:54:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:54:55,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:55,419 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:54:55,420 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1731821552, now seen corresponding path program 1 times [2019-09-10 06:54:55,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:55,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:55,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:54:55,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 06:54:55,502 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], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [336], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 06:54:55,505 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:54:55,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:54:55,516 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:54:55,675 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:54:55,676 INFO L272 AbstractInterpreter]: Visited 73 different actions 445 times. Merged at 39 different actions 318 times. Widened at 16 different actions 55 times. Performed 1514 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1514 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 12 different actions. Largest state had 122 variables. [2019-09-10 06:54:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:55,676 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:54:55,756 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.62% of their original sizes. [2019-09-10 06:54:55,756 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:54:58,218 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 06:54:58,218 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:54:58,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:54:58,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 06:54:58,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:58,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 06:54:58,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 06:54:58,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2085, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:54:58,220 INFO L87 Difference]: Start difference. First operand 186520 states and 248412 transitions. Second operand 49 states. [2019-09-10 06:56:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:47,664 INFO L93 Difference]: Finished difference Result 336244 states and 442501 transitions. [2019-09-10 06:56:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 560 states. [2019-09-10 06:56:47,664 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 84 [2019-09-10 06:56:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:48,057 INFO L225 Difference]: With dead ends: 336244 [2019-09-10 06:56:48,058 INFO L226 Difference]: Without dead ends: 335891 [2019-09-10 06:56:48,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 581 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155647 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=35890, Invalid=303416, Unknown=0, NotChecked=0, Total=339306 [2019-09-10 06:56:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335891 states. [2019-09-10 06:56:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335891 to 193660. [2019-09-10 06:56:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193660 states. [2019-09-10 06:56:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193660 states to 193660 states and 256938 transitions. [2019-09-10 06:56:51,954 INFO L78 Accepts]: Start accepts. Automaton has 193660 states and 256938 transitions. Word has length 84 [2019-09-10 06:56:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:51,954 INFO L475 AbstractCegarLoop]: Abstraction has 193660 states and 256938 transitions. [2019-09-10 06:56:51,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 06:56:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 193660 states and 256938 transitions. [2019-09-10 06:56:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:56:51,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:51,972 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:56:51,972 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash 296325587, now seen corresponding path program 1 times [2019-09-10 06:56:51,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:51,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:51,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:51,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:56:52,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:52,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:56:52,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:52,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:56:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:56:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:56:52,051 INFO L87 Difference]: Start difference. First operand 193660 states and 256938 transitions. Second operand 6 states. [2019-09-10 06:56:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:52,653 INFO L93 Difference]: Finished difference Result 269518 states and 363574 transitions. [2019-09-10 06:56:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:56:52,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 06:56:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:52,944 INFO L225 Difference]: With dead ends: 269518 [2019-09-10 06:56:52,945 INFO L226 Difference]: Without dead ends: 269287 [2019-09-10 06:56:52,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:56:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269287 states. [2019-09-10 06:56:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269287 to 211551. [2019-09-10 06:56:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211551 states. [2019-09-10 06:57:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211551 states to 211551 states and 281910 transitions. [2019-09-10 06:57:02,169 INFO L78 Accepts]: Start accepts. Automaton has 211551 states and 281910 transitions. Word has length 84 [2019-09-10 06:57:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:02,169 INFO L475 AbstractCegarLoop]: Abstraction has 211551 states and 281910 transitions. [2019-09-10 06:57:02,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 211551 states and 281910 transitions. [2019-09-10 06:57:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:57:02,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:02,189 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:57:02,189 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1875929625, now seen corresponding path program 1 times [2019-09-10 06:57:02,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:02,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:02,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:02,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:02,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:57:02,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:02,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:02,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:02,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:02,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:02,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:02,262 INFO L87 Difference]: Start difference. First operand 211551 states and 281910 transitions. Second operand 6 states. [2019-09-10 06:57:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:03,135 INFO L93 Difference]: Finished difference Result 287607 states and 388430 transitions. [2019-09-10 06:57:03,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:57:03,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 06:57:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:03,511 INFO L225 Difference]: With dead ends: 287607 [2019-09-10 06:57:03,512 INFO L226 Difference]: Without dead ends: 287594 [2019-09-10 06:57:03,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:57:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287594 states. [2019-09-10 06:57:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287594 to 235527. [2019-09-10 06:57:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235527 states. [2019-09-10 06:57:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235527 states to 235527 states and 315138 transitions. [2019-09-10 06:57:07,955 INFO L78 Accepts]: Start accepts. Automaton has 235527 states and 315138 transitions. Word has length 84 [2019-09-10 06:57:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:07,955 INFO L475 AbstractCegarLoop]: Abstraction has 235527 states and 315138 transitions. [2019-09-10 06:57:07,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 235527 states and 315138 transitions. [2019-09-10 06:57:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:57:07,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:07,969 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:57:07,969 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:07,969 INFO L82 PathProgramCache]: Analyzing trace with hash -192057548, now seen corresponding path program 1 times [2019-09-10 06:57:07,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:07,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:07,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:07,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:07,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:08,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:08,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:08,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 06:57:08,047 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], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 06:57:08,049 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:08,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:08,060 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:08,178 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:57:08,179 INFO L272 AbstractInterpreter]: Visited 73 different actions 389 times. Merged at 39 different actions 271 times. Widened at 14 different actions 43 times. Performed 1347 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1347 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 11 different actions. Largest state had 122 variables. [2019-09-10 06:57:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:08,179 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:57:08,254 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.58% of their original sizes. [2019-09-10 06:57:08,255 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:57:10,758 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 06:57:10,758 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:57:10,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:57:10,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 06:57:10,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:10,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 06:57:10,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 06:57:10,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2172, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:57:10,759 INFO L87 Difference]: Start difference. First operand 235527 states and 315138 transitions. Second operand 50 states. [2019-09-10 06:59:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:01,886 INFO L93 Difference]: Finished difference Result 396479 states and 529407 transitions. [2019-09-10 06:59:01,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 435 states. [2019-09-10 06:59:01,886 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 84 [2019-09-10 06:59:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:02,351 INFO L225 Difference]: With dead ends: 396479 [2019-09-10 06:59:02,351 INFO L226 Difference]: Without dead ends: 396391 [2019-09-10 06:59:02,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98540 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=25098, Invalid=186962, Unknown=0, NotChecked=0, Total=212060 [2019-09-10 06:59:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396391 states. [2019-09-10 06:59:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396391 to 254231. [2019-09-10 06:59:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254231 states. [2019-09-10 06:59:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254231 states to 254231 states and 338440 transitions. [2019-09-10 06:59:07,481 INFO L78 Accepts]: Start accepts. Automaton has 254231 states and 338440 transitions. Word has length 84 [2019-09-10 06:59:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:07,481 INFO L475 AbstractCegarLoop]: Abstraction has 254231 states and 338440 transitions. [2019-09-10 06:59:07,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 06:59:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 254231 states and 338440 transitions. [2019-09-10 06:59:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:59:07,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:07,497 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:07,497 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1249818576, now seen corresponding path program 1 times [2019-09-10 06:59:07,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:07,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:07,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:59:07,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:07,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:07,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:07,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:07,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:07,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:07,572 INFO L87 Difference]: Start difference. First operand 254231 states and 338440 transitions. Second operand 6 states. [2019-09-10 06:59:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:08,396 INFO L93 Difference]: Finished difference Result 326542 states and 439581 transitions. [2019-09-10 06:59:08,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:59:08,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 06:59:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:08,801 INFO L225 Difference]: With dead ends: 326542 [2019-09-10 06:59:08,801 INFO L226 Difference]: Without dead ends: 326542 [2019-09-10 06:59:08,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326542 states. [2019-09-10 06:59:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326542 to 274475. [2019-09-10 06:59:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274475 states. [2019-09-10 06:59:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274475 states to 274475 states and 366384 transitions. [2019-09-10 06:59:13,870 INFO L78 Accepts]: Start accepts. Automaton has 274475 states and 366384 transitions. Word has length 84 [2019-09-10 06:59:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:13,870 INFO L475 AbstractCegarLoop]: Abstraction has 274475 states and 366384 transitions. [2019-09-10 06:59:13,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:59:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 274475 states and 366384 transitions. [2019-09-10 06:59:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 06:59:13,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:13,889 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:13,889 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1646036884, now seen corresponding path program 1 times [2019-09-10 06:59:13,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:13,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:13,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:13,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:13,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:13,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:13,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:59:13,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-10 06:59:13,962 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], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [327], [330], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 06:59:13,964 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:59:13,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:59:13,975 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:59:19,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:59:19,058 INFO L272 AbstractInterpreter]: Visited 77 different actions 489 times. Merged at 45 different actions 360 times. Widened at 15 different actions 46 times. Performed 1655 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1655 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 12 different actions. Largest state had 122 variables. [2019-09-10 06:59:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:19,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:59:19,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:19,058 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:59:19,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:19,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:59:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:19,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 06:59:19,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:59:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:19,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:59:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:19,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:59:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 06:59:19,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:59:19,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:59:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:59:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:59:19,308 INFO L87 Difference]: Start difference. First operand 274475 states and 366384 transitions. Second operand 11 states. [2019-09-10 06:59:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:20,795 INFO L93 Difference]: Finished difference Result 489322 states and 652832 transitions. [2019-09-10 06:59:20,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:20,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 06:59:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:21,402 INFO L225 Difference]: With dead ends: 489322 [2019-09-10 06:59:21,402 INFO L226 Difference]: Without dead ends: 489322 [2019-09-10 06:59:21,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:59:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489322 states. [2019-09-10 06:59:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489322 to 302212. [2019-09-10 06:59:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302212 states. [2019-09-10 06:59:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302212 states to 302212 states and 403864 transitions. [2019-09-10 06:59:34,602 INFO L78 Accepts]: Start accepts. Automaton has 302212 states and 403864 transitions. Word has length 87 [2019-09-10 06:59:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:34,602 INFO L475 AbstractCegarLoop]: Abstraction has 302212 states and 403864 transitions. [2019-09-10 06:59:34,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:59:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 302212 states and 403864 transitions. [2019-09-10 06:59:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 06:59:34,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:34,624 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:34,624 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:34,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1392616462, now seen corresponding path program 1 times [2019-09-10 06:59:34,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:34,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:34,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:34,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:59:34,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-10 06:59:34,709 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], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 06:59:34,711 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:59:34,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:59:34,722 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:59:34,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:59:34,883 INFO L272 AbstractInterpreter]: Visited 77 different actions 568 times. Merged at 45 different actions 431 times. Widened at 17 different actions 69 times. Performed 1860 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1860 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 14 different actions. Largest state had 122 variables. [2019-09-10 06:59:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:34,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:59:34,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:34,884 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:59:34,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:34,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:59:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:34,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 06:59:34,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:59:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:35,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:59:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:35,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:59:35,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 06:59:35,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:59:35,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:59:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:59:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:59:35,127 INFO L87 Difference]: Start difference. First operand 302212 states and 403864 transitions. Second operand 11 states. [2019-09-10 06:59:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:37,745 INFO L93 Difference]: Finished difference Result 591867 states and 788966 transitions. [2019-09-10 06:59:37,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:37,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 06:59:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:38,453 INFO L225 Difference]: With dead ends: 591867 [2019-09-10 06:59:38,453 INFO L226 Difference]: Without dead ends: 591867 [2019-09-10 06:59:38,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:59:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591867 states. [2019-09-10 06:59:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591867 to 324907. [2019-09-10 06:59:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324907 states. [2019-09-10 06:59:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324907 states to 324907 states and 435111 transitions. [2019-09-10 06:59:48,496 INFO L78 Accepts]: Start accepts. Automaton has 324907 states and 435111 transitions. Word has length 87 [2019-09-10 06:59:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:48,497 INFO L475 AbstractCegarLoop]: Abstraction has 324907 states and 435111 transitions. [2019-09-10 06:59:48,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:59:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 324907 states and 435111 transitions. [2019-09-10 06:59:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 06:59:48,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:48,519 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:48,519 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:48,519 INFO L82 PathProgramCache]: Analyzing trace with hash -80864488, now seen corresponding path program 1 times [2019-09-10 06:59:48,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:48,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:48,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:48,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:48,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:48,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:48,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:59:48,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-10 06:59:48,590 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], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 06:59:48,591 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:59:48,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:59:48,602 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:59:48,809 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:59:48,809 INFO L272 AbstractInterpreter]: Visited 77 different actions 534 times. Merged at 45 different actions 400 times. Widened at 16 different actions 65 times. Performed 1829 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1829 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 14 different actions. Largest state had 122 variables. [2019-09-10 06:59:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:48,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:59:48,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:48,810 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:59:48,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:48,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:59:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:48,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 06:59:48,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:59:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:49,022 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:59:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:49,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:59:49,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 06:59:49,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:59:49,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:59:49,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:59:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:59:49,078 INFO L87 Difference]: Start difference. First operand 324907 states and 435111 transitions. Second operand 11 states. [2019-09-10 06:59:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:55,649 INFO L93 Difference]: Finished difference Result 611931 states and 819771 transitions. [2019-09-10 06:59:55,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:55,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 06:59:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:56,444 INFO L225 Difference]: With dead ends: 611931 [2019-09-10 06:59:56,444 INFO L226 Difference]: Without dead ends: 611931 [2019-09-10 06:59:56,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:59:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611931 states. [2019-09-10 07:00:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611931 to 353211. [2019-09-10 07:00:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353211 states. [2019-09-10 07:00:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353211 states to 353211 states and 474212 transitions. [2019-09-10 07:00:04,911 INFO L78 Accepts]: Start accepts. Automaton has 353211 states and 474212 transitions. Word has length 87 [2019-09-10 07:00:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:04,912 INFO L475 AbstractCegarLoop]: Abstraction has 353211 states and 474212 transitions. [2019-09-10 07:00:04,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:00:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 353211 states and 474212 transitions. [2019-09-10 07:00:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:00:04,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:04,939 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:00:04,939 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:04,939 INFO L82 PathProgramCache]: Analyzing trace with hash 427156896, now seen corresponding path program 1 times [2019-09-10 07:00:04,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:04,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:04,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:04,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:04,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:05,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:00:05,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:00:05,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-10 07:00:05,166 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], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 07:00:05,167 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:00:05,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:00:05,178 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:00:05,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:00:05,458 INFO L272 AbstractInterpreter]: Visited 83 different actions 728 times. Merged at 52 different actions 570 times. Widened at 21 different actions 108 times. Performed 2395 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2395 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 65 fixpoints after 22 different actions. Largest state had 123 variables. [2019-09-10 07:00:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:05,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:00:05,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:00:05,459 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:00:05,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:05,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:00:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:05,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:00:05,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:00:05,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:00:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:06,083 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:00:06,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:00:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:07,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:00:07,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 07:00:07,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:00:07,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:00:07,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:00:07,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:00:07,086 INFO L87 Difference]: Start difference. First operand 353211 states and 474212 transitions. Second operand 17 states. [2019-09-10 07:00:13,234 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-10 07:00:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:27,090 INFO L93 Difference]: Finished difference Result 2294463 states and 3067340 transitions. [2019-09-10 07:00:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 07:00:27,091 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-10 07:00:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:31,426 INFO L225 Difference]: With dead ends: 2294463 [2019-09-10 07:00:31,427 INFO L226 Difference]: Without dead ends: 2294421 [2019-09-10 07:00:31,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1564, Invalid=4916, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 07:00:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294421 states.