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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:25:26,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:25:26,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:25:26,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:25:26,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:25:26,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:25:26,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:25:26,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:25:26,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:25:26,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:25:26,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:25:26,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:25:26,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:25:26,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:25:26,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:25:26,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:25:26,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:25:26,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:25:26,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:25:26,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:25:26,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:25:26,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:25:26,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:25:26,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:25:26,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:25:26,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:25:26,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:25:26,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:25:26,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:25:26,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:25:26,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:25:26,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:25:26,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:25:26,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:25:26,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:25:26,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:25:26,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:25:26,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:25:26,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:25:26,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:25:26,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:25:26,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:25:26,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:25:26,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:25:26,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:25:26,362 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:25:26,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:25:26,363 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:25:26,363 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:25:26,363 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:25:26,364 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:25:26,364 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:25:26,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:25:26,365 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:25:26,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:25:26,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:25:26,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:25:26,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:25:26,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:25:26,366 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:25:26,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:25:26,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:25:26,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:25:26,367 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:25:26,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:25:26,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:25:26,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:25:26,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:25:26,368 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:25:26,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:25:26,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:25:26,368 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:25:26,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:25:26,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:25:26,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:25:26,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:25:26,416 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:25:26,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 07:25:26,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61d10b37/3c03ba6305ff4ad5b99134673fd4ab73/FLAG0d5e04f64 [2019-09-10 07:25:27,074 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:25:27,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 07:25:27,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61d10b37/3c03ba6305ff4ad5b99134673fd4ab73/FLAG0d5e04f64 [2019-09-10 07:25:27,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61d10b37/3c03ba6305ff4ad5b99134673fd4ab73 [2019-09-10 07:25:27,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:25:27,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:25:27,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:27,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:25:27,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:25:27,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:27" (1/1) ... [2019-09-10 07:25:27,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10822750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:27, skipping insertion in model container [2019-09-10 07:25:27,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:27" (1/1) ... [2019-09-10 07:25:27,401 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:25:27,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:25:27,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:27,946 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:25:28,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:28,166 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:25:28,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28 WrapperNode [2019-09-10 07:25:28,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:28,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:25:28,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:25:28,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:25:28,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (1/1) ... [2019-09-10 07:25:28,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (1/1) ... [2019-09-10 07:25:28,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (1/1) ... [2019-09-10 07:25:28,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (1/1) ... [2019-09-10 07:25:28,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (1/1) ... [2019-09-10 07:25:28,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (1/1) ... [2019-09-10 07:25:28,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (1/1) ... [2019-09-10 07:25:28,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:25:28,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:25:28,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:25:28,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:25:28,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:25:28,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:25:28,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:25:28,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:25:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:25:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:25:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:25:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:25:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:25:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:25:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:25:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:25:28,335 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:25:28,335 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:25:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:25:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:25:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:25:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:25:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:25:29,619 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:25:29,619 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:25:29,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:29 BoogieIcfgContainer [2019-09-10 07:25:29,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:25:29,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:25:29,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:25:29,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:25:29,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:25:27" (1/3) ... [2019-09-10 07:25:29,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b28269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:29, skipping insertion in model container [2019-09-10 07:25:29,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:28" (2/3) ... [2019-09-10 07:25:29,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b28269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:29, skipping insertion in model container [2019-09-10 07:25:29,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:29" (3/3) ... [2019-09-10 07:25:29,629 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-10 07:25:29,640 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:25:29,651 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 07:25:29,670 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 07:25:29,706 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:25:29,707 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:25:29,707 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:25:29,707 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:25:29,708 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:25:29,708 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:25:29,708 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:25:29,708 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:25:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2019-09-10 07:25:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:25:29,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:29,778 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] [2019-09-10 07:25:29,780 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:29,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:29,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1048414333, now seen corresponding path program 1 times [2019-09-10 07:25:29,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:29,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:29,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:29,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:29,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:30,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:30,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:30,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:30,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:30,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:30,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:30,301 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 5 states. [2019-09-10 07:25:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:30,772 INFO L93 Difference]: Finished difference Result 275 states and 439 transitions. [2019-09-10 07:25:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:30,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-10 07:25:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:30,806 INFO L225 Difference]: With dead ends: 275 [2019-09-10 07:25:30,806 INFO L226 Difference]: Without dead ends: 263 [2019-09-10 07:25:30,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-10 07:25:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2019-09-10 07:25:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-10 07:25:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 310 transitions. [2019-09-10 07:25:30,916 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 310 transitions. Word has length 51 [2019-09-10 07:25:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:30,918 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 310 transitions. [2019-09-10 07:25:30,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 310 transitions. [2019-09-10 07:25:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:25:30,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:30,929 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 07:25:30,930 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash 314314412, now seen corresponding path program 1 times [2019-09-10 07:25:30,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:30,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:30,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:31,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:31,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:31,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:31,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:31,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:31,131 INFO L87 Difference]: Start difference. First operand 239 states and 310 transitions. Second operand 5 states. [2019-09-10 07:25:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:31,377 INFO L93 Difference]: Finished difference Result 229 states and 296 transitions. [2019-09-10 07:25:31,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:31,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-10 07:25:31,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:31,380 INFO L225 Difference]: With dead ends: 229 [2019-09-10 07:25:31,380 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 07:25:31,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 07:25:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-09-10 07:25:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-10 07:25:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2019-09-10 07:25:31,415 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 52 [2019-09-10 07:25:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:31,416 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2019-09-10 07:25:31,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2019-09-10 07:25:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 07:25:31,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:31,418 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 07:25:31,419 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1548947995, now seen corresponding path program 1 times [2019-09-10 07:25:31,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:31,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:31,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:31,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:31,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:31,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:31,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:31,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:31,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:31,532 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand 5 states. [2019-09-10 07:25:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:31,686 INFO L93 Difference]: Finished difference Result 221 states and 285 transitions. [2019-09-10 07:25:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:31,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-10 07:25:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:31,690 INFO L225 Difference]: With dead ends: 221 [2019-09-10 07:25:31,690 INFO L226 Difference]: Without dead ends: 221 [2019-09-10 07:25:31,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-10 07:25:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-09-10 07:25:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:25:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 285 transitions. [2019-09-10 07:25:31,711 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 285 transitions. Word has length 53 [2019-09-10 07:25:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:31,712 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 285 transitions. [2019-09-10 07:25:31,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 285 transitions. [2019-09-10 07:25:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:25:31,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:31,714 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 07:25:31,714 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash -911204178, now seen corresponding path program 1 times [2019-09-10 07:25:31,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:31,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:31,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:32,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:32,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:25:32,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:32,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:25:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:25:32,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:25:32,014 INFO L87 Difference]: Start difference. First operand 221 states and 285 transitions. Second operand 9 states. [2019-09-10 07:25:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:32,808 INFO L93 Difference]: Finished difference Result 531 states and 727 transitions. [2019-09-10 07:25:32,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:25:32,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-10 07:25:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:32,812 INFO L225 Difference]: With dead ends: 531 [2019-09-10 07:25:32,812 INFO L226 Difference]: Without dead ends: 531 [2019-09-10 07:25:32,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:25:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-10 07:25:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 221. [2019-09-10 07:25:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:25:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2019-09-10 07:25:32,823 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 54 [2019-09-10 07:25:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:32,824 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2019-09-10 07:25:32,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:25:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2019-09-10 07:25:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:25:32,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:32,825 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 07:25:32,826 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:32,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:32,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1468636978, now seen corresponding path program 1 times [2019-09-10 07:25:32,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:32,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:32,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:32,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:32,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:32,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:33,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:25:33,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:33,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:25:33,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:25:33,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:25:33,001 INFO L87 Difference]: Start difference. First operand 221 states and 284 transitions. Second operand 9 states. [2019-09-10 07:25:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:33,897 INFO L93 Difference]: Finished difference Result 527 states and 719 transitions. [2019-09-10 07:25:33,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:25:33,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-10 07:25:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:33,902 INFO L225 Difference]: With dead ends: 527 [2019-09-10 07:25:33,902 INFO L226 Difference]: Without dead ends: 527 [2019-09-10 07:25:33,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:25:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-10 07:25:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 221. [2019-09-10 07:25:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:25:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 283 transitions. [2019-09-10 07:25:33,914 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 283 transitions. Word has length 54 [2019-09-10 07:25:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:33,914 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 283 transitions. [2019-09-10 07:25:33,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:25:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 283 transitions. [2019-09-10 07:25:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:25:33,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:33,916 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 07:25:33,916 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:33,916 INFO L82 PathProgramCache]: Analyzing trace with hash 52430183, now seen corresponding path program 1 times [2019-09-10 07:25:33,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:33,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:33,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:34,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:34,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:25:34,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:34,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:25:34,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:25:34,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:34,039 INFO L87 Difference]: Start difference. First operand 221 states and 283 transitions. Second operand 8 states. [2019-09-10 07:25:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:34,558 INFO L93 Difference]: Finished difference Result 341 states and 441 transitions. [2019-09-10 07:25:34,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:25:34,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-09-10 07:25:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:34,562 INFO L225 Difference]: With dead ends: 341 [2019-09-10 07:25:34,562 INFO L226 Difference]: Without dead ends: 341 [2019-09-10 07:25:34,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:25:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-10 07:25:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 221. [2019-09-10 07:25:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:25:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 282 transitions. [2019-09-10 07:25:34,571 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 282 transitions. Word has length 54 [2019-09-10 07:25:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:34,572 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 282 transitions. [2019-09-10 07:25:34,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:25:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 282 transitions. [2019-09-10 07:25:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:25:34,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:34,578 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 07:25:34,578 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:34,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1510346154, now seen corresponding path program 1 times [2019-09-10 07:25:34,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:34,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:35,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:35,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:25:35,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:35,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:25:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:25:35,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:25:35,490 INFO L87 Difference]: Start difference. First operand 221 states and 282 transitions. Second operand 16 states. [2019-09-10 07:25:36,053 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:25:36,662 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 07:25:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:37,261 INFO L93 Difference]: Finished difference Result 388 states and 496 transitions. [2019-09-10 07:25:37,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:25:37,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-09-10 07:25:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:37,264 INFO L225 Difference]: With dead ends: 388 [2019-09-10 07:25:37,264 INFO L226 Difference]: Without dead ends: 388 [2019-09-10 07:25:37,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:25:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-10 07:25:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 225. [2019-09-10 07:25:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-10 07:25:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 288 transitions. [2019-09-10 07:25:37,270 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 288 transitions. Word has length 56 [2019-09-10 07:25:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:37,271 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 288 transitions. [2019-09-10 07:25:37,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:25:37,271 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 288 transitions. [2019-09-10 07:25:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:25:37,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:37,272 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 07:25:37,272 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:37,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1148696630, now seen corresponding path program 1 times [2019-09-10 07:25:37,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:37,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:37,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:37,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:37,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:37,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:37,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:25:37,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:37,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:25:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:25:37,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:25:37,885 INFO L87 Difference]: Start difference. First operand 225 states and 288 transitions. Second operand 15 states. [2019-09-10 07:25:38,500 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:25:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:39,329 INFO L93 Difference]: Finished difference Result 349 states and 470 transitions. [2019-09-10 07:25:39,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:25:39,330 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-09-10 07:25:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:39,333 INFO L225 Difference]: With dead ends: 349 [2019-09-10 07:25:39,333 INFO L226 Difference]: Without dead ends: 349 [2019-09-10 07:25:39,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:25:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-10 07:25:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2019-09-10 07:25:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-10 07:25:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 274 transitions. [2019-09-10 07:25:39,340 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 274 transitions. Word has length 56 [2019-09-10 07:25:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:39,341 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 274 transitions. [2019-09-10 07:25:39,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:25:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 274 transitions. [2019-09-10 07:25:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:25:39,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:39,342 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 07:25:39,343 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash 129284665, now seen corresponding path program 1 times [2019-09-10 07:25:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:39,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:39,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:39,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:39,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:39,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:39,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:25:39,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:39,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:25:39,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:25:39,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:25:39,513 INFO L87 Difference]: Start difference. First operand 214 states and 274 transitions. Second operand 9 states. [2019-09-10 07:25:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:40,246 INFO L93 Difference]: Finished difference Result 436 states and 598 transitions. [2019-09-10 07:25:40,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:25:40,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-10 07:25:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:40,249 INFO L225 Difference]: With dead ends: 436 [2019-09-10 07:25:40,249 INFO L226 Difference]: Without dead ends: 436 [2019-09-10 07:25:40,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:25:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-10 07:25:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 214. [2019-09-10 07:25:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-10 07:25:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2019-09-10 07:25:40,257 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 57 [2019-09-10 07:25:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:40,257 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2019-09-10 07:25:40,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:25:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2019-09-10 07:25:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:25:40,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:40,258 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 07:25:40,259 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1929422544, now seen corresponding path program 1 times [2019-09-10 07:25:40,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:40,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:40,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:40,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:40,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:40,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:40,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:25:40,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:40,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:25:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:25:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:25:40,375 INFO L87 Difference]: Start difference. First operand 214 states and 272 transitions. Second operand 9 states. [2019-09-10 07:25:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:40,843 INFO L93 Difference]: Finished difference Result 334 states and 437 transitions. [2019-09-10 07:25:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:25:40,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-10 07:25:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:40,846 INFO L225 Difference]: With dead ends: 334 [2019-09-10 07:25:40,846 INFO L226 Difference]: Without dead ends: 334 [2019-09-10 07:25:40,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:25:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-10 07:25:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 214. [2019-09-10 07:25:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-10 07:25:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2019-09-10 07:25:40,852 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 57 [2019-09-10 07:25:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:40,853 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2019-09-10 07:25:40,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:25:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2019-09-10 07:25:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:25:40,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:40,854 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 07:25:40,854 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1236153109, now seen corresponding path program 1 times [2019-09-10 07:25:40,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:40,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:40,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:41,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:41,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:25:41,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:41,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:25:41,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:25:41,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:25:41,470 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand 13 states. [2019-09-10 07:25:41,939 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 07:25:42,084 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 07:25:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:42,628 INFO L93 Difference]: Finished difference Result 648 states and 914 transitions. [2019-09-10 07:25:42,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:25:42,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-09-10 07:25:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:42,634 INFO L225 Difference]: With dead ends: 648 [2019-09-10 07:25:42,634 INFO L226 Difference]: Without dead ends: 648 [2019-09-10 07:25:42,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:25:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-10 07:25:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 194. [2019-09-10 07:25:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-10 07:25:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2019-09-10 07:25:42,643 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 57 [2019-09-10 07:25:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:42,644 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2019-09-10 07:25:42,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:25:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2019-09-10 07:25:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:25:42,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:42,645 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 07:25:42,645 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:42,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1017147876, now seen corresponding path program 1 times [2019-09-10 07:25:42,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:42,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:42,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:42,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:42,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:43,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:43,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:25:43,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:43,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:25:43,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:25:43,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:25:43,095 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 12 states. [2019-09-10 07:25:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:43,896 INFO L93 Difference]: Finished difference Result 398 states and 538 transitions. [2019-09-10 07:25:43,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:25:43,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-09-10 07:25:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:43,899 INFO L225 Difference]: With dead ends: 398 [2019-09-10 07:25:43,899 INFO L226 Difference]: Without dead ends: 398 [2019-09-10 07:25:43,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:25:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-09-10 07:25:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 190. [2019-09-10 07:25:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 07:25:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 242 transitions. [2019-09-10 07:25:43,908 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 242 transitions. Word has length 57 [2019-09-10 07:25:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:43,908 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 242 transitions. [2019-09-10 07:25:43,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:25:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 242 transitions. [2019-09-10 07:25:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:25:43,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:43,910 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] [2019-09-10 07:25:43,910 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:43,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1774022695, now seen corresponding path program 1 times [2019-09-10 07:25:43,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:43,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:43,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:44,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:44,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:25:44,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:44,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:25:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:25:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:25:44,101 INFO L87 Difference]: Start difference. First operand 190 states and 242 transitions. Second operand 10 states. [2019-09-10 07:25:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:44,940 INFO L93 Difference]: Finished difference Result 392 states and 532 transitions. [2019-09-10 07:25:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:25:44,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-10 07:25:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:44,943 INFO L225 Difference]: With dead ends: 392 [2019-09-10 07:25:44,943 INFO L226 Difference]: Without dead ends: 392 [2019-09-10 07:25:44,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:25:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-10 07:25:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 190. [2019-09-10 07:25:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 07:25:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 241 transitions. [2019-09-10 07:25:44,955 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 241 transitions. Word has length 58 [2019-09-10 07:25:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:44,955 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 241 transitions. [2019-09-10 07:25:44,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:25:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2019-09-10 07:25:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:25:44,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:44,957 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 07:25:44,958 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash 334190176, now seen corresponding path program 1 times [2019-09-10 07:25:44,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:44,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:44,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:44,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:45,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:45,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:25:45,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:45,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:25:45,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:25:45,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:25:45,382 INFO L87 Difference]: Start difference. First operand 190 states and 241 transitions. Second operand 18 states. [2019-09-10 07:25:45,525 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:25:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:46,889 INFO L93 Difference]: Finished difference Result 386 states and 522 transitions. [2019-09-10 07:25:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:25:46,890 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-09-10 07:25:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:46,892 INFO L225 Difference]: With dead ends: 386 [2019-09-10 07:25:46,892 INFO L226 Difference]: Without dead ends: 386 [2019-09-10 07:25:46,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:25:46,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-10 07:25:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 196. [2019-09-10 07:25:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-10 07:25:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 249 transitions. [2019-09-10 07:25:46,902 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 249 transitions. Word has length 59 [2019-09-10 07:25:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:46,902 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 249 transitions. [2019-09-10 07:25:46,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:25:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 249 transitions. [2019-09-10 07:25:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:25:46,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:46,903 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 07:25:46,904 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash 514928378, now seen corresponding path program 1 times [2019-09-10 07:25:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:46,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:46,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:46,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:46,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:47,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:47,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:25:47,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:47,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:25:47,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:25:47,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:25:47,995 INFO L87 Difference]: Start difference. First operand 196 states and 249 transitions. Second operand 19 states. [2019-09-10 07:25:48,742 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:25:48,913 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:25:49,086 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:25:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:50,205 INFO L93 Difference]: Finished difference Result 391 states and 526 transitions. [2019-09-10 07:25:50,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:25:50,205 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-09-10 07:25:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:50,208 INFO L225 Difference]: With dead ends: 391 [2019-09-10 07:25:50,209 INFO L226 Difference]: Without dead ends: 391 [2019-09-10 07:25:50,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:25:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-10 07:25:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 190. [2019-09-10 07:25:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 07:25:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 240 transitions. [2019-09-10 07:25:50,216 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 240 transitions. Word has length 60 [2019-09-10 07:25:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:50,216 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 240 transitions. [2019-09-10 07:25:50,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:25:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 240 transitions. [2019-09-10 07:25:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:25:50,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:50,217 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 07:25:50,218 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1498365057, now seen corresponding path program 1 times [2019-09-10 07:25:50,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:50,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:50,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:50,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:50,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:50,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:25:50,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:50,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:25:50,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:25:50,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:25:50,621 INFO L87 Difference]: Start difference. First operand 190 states and 240 transitions. Second operand 12 states. [2019-09-10 07:25:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:51,497 INFO L93 Difference]: Finished difference Result 490 states and 670 transitions. [2019-09-10 07:25:51,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:25:51,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-09-10 07:25:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:51,503 INFO L225 Difference]: With dead ends: 490 [2019-09-10 07:25:51,503 INFO L226 Difference]: Without dead ends: 490 [2019-09-10 07:25:51,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:25:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-10 07:25:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 184. [2019-09-10 07:25:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-10 07:25:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 234 transitions. [2019-09-10 07:25:51,512 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 234 transitions. Word has length 60 [2019-09-10 07:25:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:51,512 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 234 transitions. [2019-09-10 07:25:51,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:25:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 234 transitions. [2019-09-10 07:25:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:25:51,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:51,519 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 07:25:51,519 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1413076030, now seen corresponding path program 1 times [2019-09-10 07:25:51,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:51,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:51,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:51,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:52,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:52,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:25:52,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:52,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:25:52,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:25:52,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:25:52,368 INFO L87 Difference]: Start difference. First operand 184 states and 234 transitions. Second operand 18 states. [2019-09-10 07:25:53,092 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:25:53,235 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:25:53,399 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:25:53,557 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:25:53,740 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:25:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:54,401 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2019-09-10 07:25:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:25:54,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-09-10 07:25:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:54,403 INFO L225 Difference]: With dead ends: 184 [2019-09-10 07:25:54,403 INFO L226 Difference]: Without dead ends: 184 [2019-09-10 07:25:54,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:25:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-10 07:25:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-10 07:25:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-10 07:25:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 233 transitions. [2019-09-10 07:25:54,410 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 233 transitions. Word has length 60 [2019-09-10 07:25:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:54,410 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 233 transitions. [2019-09-10 07:25:54,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:25:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2019-09-10 07:25:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:25:54,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:54,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:54,412 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:54,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1314143621, now seen corresponding path program 1 times [2019-09-10 07:25:54,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:54,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:54,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:54,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:54,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:54,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:54,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:25:54,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:54,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:25:54,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:25:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:25:54,823 INFO L87 Difference]: Start difference. First operand 184 states and 233 transitions. Second operand 11 states. [2019-09-10 07:25:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:55,793 INFO L93 Difference]: Finished difference Result 686 states and 987 transitions. [2019-09-10 07:25:55,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:25:55,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-09-10 07:25:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:55,798 INFO L225 Difference]: With dead ends: 686 [2019-09-10 07:25:55,798 INFO L226 Difference]: Without dead ends: 686 [2019-09-10 07:25:55,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:25:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-10 07:25:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 166. [2019-09-10 07:25:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-10 07:25:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2019-09-10 07:25:55,808 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 61 [2019-09-10 07:25:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:55,809 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2019-09-10 07:25:55,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:25:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2019-09-10 07:25:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:25:55,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:55,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:55,811 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:55,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1247665849, now seen corresponding path program 1 times [2019-09-10 07:25:55,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:55,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:55,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:55,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:55,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:55,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:55,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:55,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:55,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:55,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:55,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:55,869 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand 3 states. [2019-09-10 07:25:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:55,891 INFO L93 Difference]: Finished difference Result 242 states and 323 transitions. [2019-09-10 07:25:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:55,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:25:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:55,893 INFO L225 Difference]: With dead ends: 242 [2019-09-10 07:25:55,893 INFO L226 Difference]: Without dead ends: 242 [2019-09-10 07:25:55,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-10 07:25:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-09-10 07:25:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-10 07:25:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 322 transitions. [2019-09-10 07:25:55,899 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 322 transitions. Word has length 77 [2019-09-10 07:25:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:55,899 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 322 transitions. [2019-09-10 07:25:55,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 322 transitions. [2019-09-10 07:25:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:25:55,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:55,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:55,901 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash -574990682, now seen corresponding path program 1 times [2019-09-10 07:25:55,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:55,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:56,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:56,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:25:56,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:56,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:25:56,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:25:56,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:56,010 INFO L87 Difference]: Start difference. First operand 240 states and 322 transitions. Second operand 7 states. [2019-09-10 07:25:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:56,342 INFO L93 Difference]: Finished difference Result 570 states and 785 transitions. [2019-09-10 07:25:56,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:25:56,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 07:25:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:56,345 INFO L225 Difference]: With dead ends: 570 [2019-09-10 07:25:56,345 INFO L226 Difference]: Without dead ends: 570 [2019-09-10 07:25:56,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:25:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-10 07:25:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 292. [2019-09-10 07:25:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-10 07:25:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 396 transitions. [2019-09-10 07:25:56,354 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 396 transitions. Word has length 79 [2019-09-10 07:25:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:56,355 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 396 transitions. [2019-09-10 07:25:56,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:25:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 396 transitions. [2019-09-10 07:25:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:25:56,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:56,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:56,357 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1123393510, now seen corresponding path program 1 times [2019-09-10 07:25:56,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:56,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:56,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:25:56,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:56,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:25:56,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:25:56,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:56,450 INFO L87 Difference]: Start difference. First operand 292 states and 396 transitions. Second operand 7 states. [2019-09-10 07:25:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:56,781 INFO L93 Difference]: Finished difference Result 834 states and 1153 transitions. [2019-09-10 07:25:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:25:56,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 07:25:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:56,785 INFO L225 Difference]: With dead ends: 834 [2019-09-10 07:25:56,785 INFO L226 Difference]: Without dead ends: 834 [2019-09-10 07:25:56,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:25:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-09-10 07:25:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 540. [2019-09-10 07:25:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-10 07:25:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 758 transitions. [2019-09-10 07:25:56,800 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 758 transitions. Word has length 79 [2019-09-10 07:25:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:56,801 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 758 transitions. [2019-09-10 07:25:56,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:25:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 758 transitions. [2019-09-10 07:25:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:25:56,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:56,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:56,803 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1884477720, now seen corresponding path program 1 times [2019-09-10 07:25:56,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:56,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:56,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:56,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:56,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:56,855 INFO L87 Difference]: Start difference. First operand 540 states and 758 transitions. Second operand 3 states. [2019-09-10 07:25:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:56,878 INFO L93 Difference]: Finished difference Result 934 states and 1299 transitions. [2019-09-10 07:25:56,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:56,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:25:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:56,884 INFO L225 Difference]: With dead ends: 934 [2019-09-10 07:25:56,884 INFO L226 Difference]: Without dead ends: 934 [2019-09-10 07:25:56,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-09-10 07:25:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 932. [2019-09-10 07:25:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2019-09-10 07:25:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1298 transitions. [2019-09-10 07:25:56,905 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1298 transitions. Word has length 79 [2019-09-10 07:25:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:56,906 INFO L475 AbstractCegarLoop]: Abstraction has 932 states and 1298 transitions. [2019-09-10 07:25:56,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1298 transitions. [2019-09-10 07:25:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:25:56,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:56,907 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:56,908 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737399, now seen corresponding path program 1 times [2019-09-10 07:25:56,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:56,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:56,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:56,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:56,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:56,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:56,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:56,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:56,967 INFO L87 Difference]: Start difference. First operand 932 states and 1298 transitions. Second operand 3 states. [2019-09-10 07:25:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:57,004 INFO L93 Difference]: Finished difference Result 1374 states and 1903 transitions. [2019-09-10 07:25:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:57,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:25:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:57,010 INFO L225 Difference]: With dead ends: 1374 [2019-09-10 07:25:57,011 INFO L226 Difference]: Without dead ends: 1374 [2019-09-10 07:25:57,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-09-10 07:25:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1372. [2019-09-10 07:25:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-10 07:25:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1902 transitions. [2019-09-10 07:25:57,039 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1902 transitions. Word has length 79 [2019-09-10 07:25:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:57,039 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1902 transitions. [2019-09-10 07:25:57,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1902 transitions. [2019-09-10 07:25:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:25:57,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:57,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:57,042 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1854658784, now seen corresponding path program 1 times [2019-09-10 07:25:57,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:57,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:57,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:57,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:57,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:57,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:57,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:25:57,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:57,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:25:57,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:25:57,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:57,169 INFO L87 Difference]: Start difference. First operand 1372 states and 1902 transitions. Second operand 7 states. [2019-09-10 07:25:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:57,558 INFO L93 Difference]: Finished difference Result 3754 states and 5186 transitions. [2019-09-10 07:25:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:25:57,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 07:25:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:57,575 INFO L225 Difference]: With dead ends: 3754 [2019-09-10 07:25:57,575 INFO L226 Difference]: Without dead ends: 3754 [2019-09-10 07:25:57,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:25:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2019-09-10 07:25:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 2384. [2019-09-10 07:25:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2384 states. [2019-09-10 07:25:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3328 transitions. [2019-09-10 07:25:57,646 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3328 transitions. Word has length 79 [2019-09-10 07:25:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:57,647 INFO L475 AbstractCegarLoop]: Abstraction has 2384 states and 3328 transitions. [2019-09-10 07:25:57,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:25:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3328 transitions. [2019-09-10 07:25:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:25:57,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:57,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:57,649 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2127178523, now seen corresponding path program 1 times [2019-09-10 07:25:57,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:57,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:57,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:57,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:57,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:57,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:57,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:57,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:57,709 INFO L87 Difference]: Start difference. First operand 2384 states and 3328 transitions. Second operand 3 states. [2019-09-10 07:25:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:57,737 INFO L93 Difference]: Finished difference Result 2176 states and 2979 transitions. [2019-09-10 07:25:57,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:57,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:25:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:57,747 INFO L225 Difference]: With dead ends: 2176 [2019-09-10 07:25:57,747 INFO L226 Difference]: Without dead ends: 2176 [2019-09-10 07:25:57,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2019-09-10 07:25:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 1764. [2019-09-10 07:25:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2019-09-10 07:25:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2411 transitions. [2019-09-10 07:25:57,789 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2411 transitions. Word has length 80 [2019-09-10 07:25:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:57,789 INFO L475 AbstractCegarLoop]: Abstraction has 1764 states and 2411 transitions. [2019-09-10 07:25:57,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2411 transitions. [2019-09-10 07:25:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:25:57,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:57,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:57,791 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash -582107602, now seen corresponding path program 1 times [2019-09-10 07:25:57,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:57,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:57,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:57,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:57,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:57,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:57,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:57,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:57,849 INFO L87 Difference]: Start difference. First operand 1764 states and 2411 transitions. Second operand 3 states. [2019-09-10 07:25:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:57,878 INFO L93 Difference]: Finished difference Result 2462 states and 3305 transitions. [2019-09-10 07:25:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:57,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:25:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:57,889 INFO L225 Difference]: With dead ends: 2462 [2019-09-10 07:25:57,889 INFO L226 Difference]: Without dead ends: 2462 [2019-09-10 07:25:57,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-09-10 07:25:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2232. [2019-09-10 07:25:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-09-10 07:25:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3028 transitions. [2019-09-10 07:25:57,934 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3028 transitions. Word has length 81 [2019-09-10 07:25:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:57,935 INFO L475 AbstractCegarLoop]: Abstraction has 2232 states and 3028 transitions. [2019-09-10 07:25:57,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3028 transitions. [2019-09-10 07:25:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:25:57,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:57,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:57,937 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1038081524, now seen corresponding path program 1 times [2019-09-10 07:25:57,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:57,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:57,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:57,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:57,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:57,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:57,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:57,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:57,990 INFO L87 Difference]: Start difference. First operand 2232 states and 3028 transitions. Second operand 3 states. [2019-09-10 07:25:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:58,017 INFO L93 Difference]: Finished difference Result 2568 states and 3447 transitions. [2019-09-10 07:25:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:58,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:25:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:58,030 INFO L225 Difference]: With dead ends: 2568 [2019-09-10 07:25:58,030 INFO L226 Difference]: Without dead ends: 2568 [2019-09-10 07:25:58,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-09-10 07:25:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2486. [2019-09-10 07:25:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-09-10 07:25:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3336 transitions. [2019-09-10 07:25:58,095 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3336 transitions. Word has length 82 [2019-09-10 07:25:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:58,096 INFO L475 AbstractCegarLoop]: Abstraction has 2486 states and 3336 transitions. [2019-09-10 07:25:58,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3336 transitions. [2019-09-10 07:25:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:25:58,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:58,098 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:58,099 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:58,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:58,099 INFO L82 PathProgramCache]: Analyzing trace with hash 339548442, now seen corresponding path program 1 times [2019-09-10 07:25:58,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:58,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:58,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:58,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:58,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:58,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:58,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:58,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:58,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:58,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:58,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:58,152 INFO L87 Difference]: Start difference. First operand 2486 states and 3336 transitions. Second operand 3 states. [2019-09-10 07:25:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:58,188 INFO L93 Difference]: Finished difference Result 2714 states and 3621 transitions. [2019-09-10 07:25:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:58,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:25:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:58,201 INFO L225 Difference]: With dead ends: 2714 [2019-09-10 07:25:58,202 INFO L226 Difference]: Without dead ends: 2714 [2019-09-10 07:25:58,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2019-09-10 07:25:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2712. [2019-09-10 07:25:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2712 states. [2019-09-10 07:25:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3620 transitions. [2019-09-10 07:25:58,262 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3620 transitions. Word has length 83 [2019-09-10 07:25:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:58,263 INFO L475 AbstractCegarLoop]: Abstraction has 2712 states and 3620 transitions. [2019-09-10 07:25:58,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3620 transitions. [2019-09-10 07:25:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:25:58,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:58,264 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:58,265 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1321048598, now seen corresponding path program 1 times [2019-09-10 07:25:58,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:58,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:58,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:58,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:58,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:58,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:58,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:25:58,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:58,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:25:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:25:58,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:25:58,347 INFO L87 Difference]: Start difference. First operand 2712 states and 3620 transitions. Second operand 6 states. [2019-09-10 07:25:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:58,426 INFO L93 Difference]: Finished difference Result 3876 states and 5101 transitions. [2019-09-10 07:25:58,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:25:58,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 07:25:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:58,445 INFO L225 Difference]: With dead ends: 3876 [2019-09-10 07:25:58,445 INFO L226 Difference]: Without dead ends: 3876 [2019-09-10 07:25:58,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:25:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2019-09-10 07:25:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 2760. [2019-09-10 07:25:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-09-10 07:25:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3652 transitions. [2019-09-10 07:25:58,501 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3652 transitions. Word has length 83 [2019-09-10 07:25:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:58,501 INFO L475 AbstractCegarLoop]: Abstraction has 2760 states and 3652 transitions. [2019-09-10 07:25:58,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:25:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3652 transitions. [2019-09-10 07:25:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:25:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:58,504 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:58,504 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1380496519, now seen corresponding path program 1 times [2019-09-10 07:25:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:58,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:58,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:25:58,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:58,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:58,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:58,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:58,610 INFO L87 Difference]: Start difference. First operand 2760 states and 3652 transitions. Second operand 5 states. [2019-09-10 07:25:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:58,682 INFO L93 Difference]: Finished difference Result 4630 states and 6096 transitions. [2019-09-10 07:25:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:58,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 07:25:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:58,704 INFO L225 Difference]: With dead ends: 4630 [2019-09-10 07:25:58,704 INFO L226 Difference]: Without dead ends: 4630 [2019-09-10 07:25:58,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:25:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2019-09-10 07:25:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 3658. [2019-09-10 07:25:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3658 states. [2019-09-10 07:25:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4844 transitions. [2019-09-10 07:25:58,765 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4844 transitions. Word has length 104 [2019-09-10 07:25:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:58,765 INFO L475 AbstractCegarLoop]: Abstraction has 3658 states and 4844 transitions. [2019-09-10 07:25:58,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4844 transitions. [2019-09-10 07:25:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:25:58,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:58,768 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:58,769 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:58,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1928899347, now seen corresponding path program 1 times [2019-09-10 07:25:58,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:58,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:58,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:58,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:58,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:25:58,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:58,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:58,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:58,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:58,925 INFO L87 Difference]: Start difference. First operand 3658 states and 4844 transitions. Second operand 5 states. [2019-09-10 07:25:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:59,001 INFO L93 Difference]: Finished difference Result 9006 states and 11861 transitions. [2019-09-10 07:25:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:59,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 07:25:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:59,018 INFO L225 Difference]: With dead ends: 9006 [2019-09-10 07:25:59,018 INFO L226 Difference]: Without dead ends: 9006 [2019-09-10 07:25:59,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9006 states. [2019-09-10 07:25:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9006 to 5422. [2019-09-10 07:25:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-09-10 07:25:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 7148 transitions. [2019-09-10 07:25:59,116 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 7148 transitions. Word has length 104 [2019-09-10 07:25:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:59,117 INFO L475 AbstractCegarLoop]: Abstraction has 5422 states and 7148 transitions. [2019-09-10 07:25:59,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 7148 transitions. [2019-09-10 07:25:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:25:59,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:59,120 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:59,120 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1634802675, now seen corresponding path program 1 times [2019-09-10 07:25:59,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:59,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:59,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:25:59,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:59,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:59,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:59,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:59,216 INFO L87 Difference]: Start difference. First operand 5422 states and 7148 transitions. Second operand 5 states. [2019-09-10 07:25:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:59,311 INFO L93 Difference]: Finished difference Result 10842 states and 14267 transitions. [2019-09-10 07:25:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:59,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 07:25:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:59,333 INFO L225 Difference]: With dead ends: 10842 [2019-09-10 07:25:59,333 INFO L226 Difference]: Without dead ends: 10842 [2019-09-10 07:25:59,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-09-10 07:25:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 8052. [2019-09-10 07:25:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-09-10 07:25:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 10564 transitions. [2019-09-10 07:25:59,460 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 10564 transitions. Word has length 104 [2019-09-10 07:25:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:59,460 INFO L475 AbstractCegarLoop]: Abstraction has 8052 states and 10564 transitions. [2019-09-10 07:25:59,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 10564 transitions. [2019-09-10 07:25:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:25:59,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:59,464 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:59,464 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1368665944, now seen corresponding path program 1 times [2019-09-10 07:25:59,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:59,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:59,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:59,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:59,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:25:59,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:25:59,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:25:59,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 07:25:59,593 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [128], [130], [132], [135], [145], [148], [152], [155], [158], [162], [164], [167], [170], [178], [180], [183], [191], [193], [196], [204], [206], [209], [212], [216], [218], [220], [223], [224], [226], [228], [230], [235], [237], [240], [253], [255], [258], [261], [263], [278], [280], [283], [286], [288], [303], [305], [308], [311], [313], [349], [754], [755], [759], [760], [761] [2019-09-10 07:25:59,648 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:25:59,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:25:59,801 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:00,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:00,405 INFO L272 AbstractInterpreter]: Visited 97 different actions 474 times. Merged at 39 different actions 325 times. Widened at 18 different actions 57 times. Performed 1787 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1787 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 56 fixpoints after 15 different actions. Largest state had 147 variables. [2019-09-10 07:26:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:00,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:00,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:00,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:26:00,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:00,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:26:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:00,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:26:00,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:00,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:00,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:00,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:00,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:01,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:01,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:01,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:01,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:01,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:02,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:26:02,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:26:02,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 23 [2019-09-10 07:26:02,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:26:02,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:26:02,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:26:02,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:26:02,179 INFO L87 Difference]: Start difference. First operand 8052 states and 10564 transitions. Second operand 14 states. [2019-09-10 07:26:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:06,658 INFO L93 Difference]: Finished difference Result 53302 states and 69393 transitions. [2019-09-10 07:26:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 07:26:06,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2019-09-10 07:26:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:06,781 INFO L225 Difference]: With dead ends: 53302 [2019-09-10 07:26:06,782 INFO L226 Difference]: Without dead ends: 53302 [2019-09-10 07:26:06,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 170 SyntacticMatches, 25 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1229, Invalid=4777, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 07:26:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53302 states. [2019-09-10 07:26:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53302 to 23029. [2019-09-10 07:26:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23029 states. [2019-09-10 07:26:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 30177 transitions. [2019-09-10 07:26:07,482 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 30177 transitions. Word has length 105 [2019-09-10 07:26:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:07,482 INFO L475 AbstractCegarLoop]: Abstraction has 23029 states and 30177 transitions. [2019-09-10 07:26:07,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:26:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 30177 transitions. [2019-09-10 07:26:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:07,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:07,487 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:07,487 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash 75351500, now seen corresponding path program 1 times [2019-09-10 07:26:07,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:07,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:07,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:07,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:07,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 07:26:07,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:07,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:26:07,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:07,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:26:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:26:07,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:26:07,651 INFO L87 Difference]: Start difference. First operand 23029 states and 30177 transitions. Second operand 9 states. [2019-09-10 07:26:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:08,336 INFO L93 Difference]: Finished difference Result 47022 states and 61311 transitions. [2019-09-10 07:26:08,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:26:08,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-09-10 07:26:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:08,429 INFO L225 Difference]: With dead ends: 47022 [2019-09-10 07:26:08,429 INFO L226 Difference]: Without dead ends: 47022 [2019-09-10 07:26:08,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:26:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47022 states. [2019-09-10 07:26:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47022 to 23029. [2019-09-10 07:26:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23029 states. [2019-09-10 07:26:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 30175 transitions. [2019-09-10 07:26:09,802 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 30175 transitions. Word has length 106 [2019-09-10 07:26:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:09,802 INFO L475 AbstractCegarLoop]: Abstraction has 23029 states and 30175 transitions. [2019-09-10 07:26:09,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:26:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 30175 transitions. [2019-09-10 07:26:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:26:09,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:09,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:09,807 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:09,808 INFO L82 PathProgramCache]: Analyzing trace with hash 94830107, now seen corresponding path program 1 times [2019-09-10 07:26:09,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:09,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:09,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:10,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:10,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:10,096 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:26:10,097 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [128], [130], [132], [135], [138], [141], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [178], [180], [183], [191], [193], [196], [199], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [246], [249], [255], [258], [261], [263], [278], [280], [283], [286], [288], [296], [299], [305], [308], [311], [313], [754], [755], [759], [760], [761] [2019-09-10 07:26:10,106 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:10,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:10,136 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:10,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:10,501 INFO L272 AbstractInterpreter]: Visited 101 different actions 471 times. Merged at 41 different actions 328 times. Widened at 13 different actions 45 times. Performed 1818 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1818 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 11 different actions. Largest state had 147 variables. [2019-09-10 07:26:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:10,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:10,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:10,501 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 07:26:10,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:10,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:26:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:10,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:26:10,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:10,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:10,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:11,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:11,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:11,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:13,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:13,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:26:13,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 07:26:13,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:26:13,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:26:13,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:26:13,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:26:13,433 INFO L87 Difference]: Start difference. First operand 23029 states and 30175 transitions. Second operand 18 states. [2019-09-10 07:26:14,054 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:26:14,331 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:26:14,690 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:26:14,922 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:26:15,236 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:26:15,392 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:26:15,876 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:26:16,075 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:26:16,277 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:26:16,723 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:26:16,893 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:26:17,209 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:26:19,681 WARN L188 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:26:19,849 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:26:20,002 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:26:20,300 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:26:20,588 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:26:20,989 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:26:21,422 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:26:22,322 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 07:26:22,533 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:26:22,666 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-10 07:26:22,818 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:26:23,124 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 07:26:23,324 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:26:23,765 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:26:24,095 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:26:24,242 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:26:24,506 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:26:24,810 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 07:26:25,470 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 07:26:25,719 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 07:26:26,006 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 07:26:26,282 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:26:26,550 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:26:26,820 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:26:26,988 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:26:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:27,138 INFO L93 Difference]: Finished difference Result 82410 states and 105148 transitions. [2019-09-10 07:26:27,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 07:26:27,138 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 108 [2019-09-10 07:26:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:27,265 INFO L225 Difference]: With dead ends: 82410 [2019-09-10 07:26:27,266 INFO L226 Difference]: Without dead ends: 82410 [2019-09-10 07:26:27,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 178 SyntacticMatches, 27 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1138, Invalid=3832, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 07:26:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82410 states. [2019-09-10 07:26:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82410 to 38473. [2019-09-10 07:26:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38473 states. [2019-09-10 07:26:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38473 states to 38473 states and 50085 transitions. [2019-09-10 07:26:28,103 INFO L78 Accepts]: Start accepts. Automaton has 38473 states and 50085 transitions. Word has length 108 [2019-09-10 07:26:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:28,103 INFO L475 AbstractCegarLoop]: Abstraction has 38473 states and 50085 transitions. [2019-09-10 07:26:28,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:26:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 38473 states and 50085 transitions. [2019-09-10 07:26:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:26:28,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:28,109 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:28,109 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash -636435167, now seen corresponding path program 1 times [2019-09-10 07:26:28,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:28,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:28,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:28,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:28,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:28,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:26:28,433 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [128], [130], [132], [135], [138], [141], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [178], [180], [183], [186], [191], [193], [196], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [253], [255], [258], [261], [263], [271], [274], [280], [283], [286], [288], [296], [299], [305], [308], [311], [313], [754], [755], [759], [760], [761] [2019-09-10 07:26:28,436 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:28,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:28,457 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:28,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:28,719 INFO L272 AbstractInterpreter]: Visited 101 different actions 455 times. Merged at 41 different actions 314 times. Widened at 13 different actions 38 times. Performed 1759 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1759 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 11 different actions. Largest state had 147 variables. [2019-09-10 07:26:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:28,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:28,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:28,720 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) [2019-09-10 07:26:28,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:28,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:26:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:28,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:26:28,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:29,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:29,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:29,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:29,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:31,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:31,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:26:31,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:26:31,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:26:31,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:26:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:26:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:26:31,166 INFO L87 Difference]: Start difference. First operand 38473 states and 50085 transitions. Second operand 20 states. [2019-09-10 07:26:31,374 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:26:31,965 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:26:32,175 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:26:32,766 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:26:32,960 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:26:33,218 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:26:33,373 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:26:33,671 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:26:34,103 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:26:34,615 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:26:34,823 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:26:35,227 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:26:35,585 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:26:35,850 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:26:36,156 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:26:36,391 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:26:36,573 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:26:36,816 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:26:37,073 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:26:37,465 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:26:37,776 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:26:38,144 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:26:38,672 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:26:38,918 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:26:39,162 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:26:39,355 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:26:39,606 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:26:39,938 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:26:40,155 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:26:40,403 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:26:40,850 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:26:41,040 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:26:41,276 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:26:41,516 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:26:41,883 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:26:42,295 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:26:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:42,607 INFO L93 Difference]: Finished difference Result 200362 states and 255639 transitions. [2019-09-10 07:26:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 07:26:42,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-09-10 07:26:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:42,853 INFO L225 Difference]: With dead ends: 200362 [2019-09-10 07:26:42,853 INFO L226 Difference]: Without dead ends: 200362 [2019-09-10 07:26:42,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 187 SyntacticMatches, 16 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1173, Invalid=2987, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 07:26:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200362 states. [2019-09-10 07:26:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200362 to 94821. [2019-09-10 07:26:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94821 states. [2019-09-10 07:26:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94821 states to 94821 states and 123375 transitions. [2019-09-10 07:26:46,225 INFO L78 Accepts]: Start accepts. Automaton has 94821 states and 123375 transitions. Word has length 108 [2019-09-10 07:26:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:46,225 INFO L475 AbstractCegarLoop]: Abstraction has 94821 states and 123375 transitions. [2019-09-10 07:26:46,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:26:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 94821 states and 123375 transitions. [2019-09-10 07:26:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:26:46,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:46,237 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:46,246 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1305569259, now seen corresponding path program 1 times [2019-09-10 07:26:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:46,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:46,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:46,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:46,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:26:46,530 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 07:26:46,531 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [128], [130], [132], [135], [138], [141], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [178], [180], [183], [186], [191], [193], [196], [199], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [246], [249], [255], [258], [261], [263], [271], [274], [280], [283], [286], [288], [303], [305], [308], [311], [313], [754], [755], [759], [760], [761] [2019-09-10 07:26:46,541 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:26:46,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:26:46,560 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:26:46,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:26:46,782 INFO L272 AbstractInterpreter]: Visited 101 different actions 430 times. Merged at 41 different actions 291 times. Widened at 12 different actions 30 times. Performed 1555 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1555 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 12 different actions. Largest state had 147 variables. [2019-09-10 07:26:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:46,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:26:46,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:26:46,782 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 07:26:46,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:46,798 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 07:26:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:46,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:26:46,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:26:47,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:49,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:26:49,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:50,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:50,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:50,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:50,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:50,885 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-10 07:26:51,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:26:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:26:52,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:26:52,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:26:52,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:26:52,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:26:52,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:26:52,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:26:52,137 INFO L87 Difference]: Start difference. First operand 94821 states and 123375 transitions. Second operand 20 states. [2019-09-10 07:26:54,513 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-09-10 07:26:54,860 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 07:26:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:56,064 INFO L93 Difference]: Finished difference Result 233092 states and 300350 transitions. [2019-09-10 07:26:56,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:26:56,065 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-09-10 07:26:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:56,359 INFO L225 Difference]: With dead ends: 233092 [2019-09-10 07:26:56,360 INFO L226 Difference]: Without dead ends: 233092 [2019-09-10 07:26:56,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 171 SyntacticMatches, 32 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=836, Invalid=2244, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:26:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233092 states. [2019-09-10 07:27:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233092 to 97948. [2019-09-10 07:27:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97948 states. [2019-09-10 07:27:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97948 states to 97948 states and 127534 transitions. [2019-09-10 07:27:00,366 INFO L78 Accepts]: Start accepts. Automaton has 97948 states and 127534 transitions. Word has length 108 [2019-09-10 07:27:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:00,366 INFO L475 AbstractCegarLoop]: Abstraction has 97948 states and 127534 transitions. [2019-09-10 07:27:00,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:27:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 97948 states and 127534 transitions. [2019-09-10 07:27:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:27:00,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:00,376 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:00,377 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash -30315983, now seen corresponding path program 1 times [2019-09-10 07:27:00,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:00,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:27:00,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:00,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:27:00,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:00,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:27:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:27:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:00,428 INFO L87 Difference]: Start difference. First operand 97948 states and 127534 transitions. Second operand 3 states. [2019-09-10 07:27:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:00,690 INFO L93 Difference]: Finished difference Result 78650 states and 100622 transitions. [2019-09-10 07:27:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:27:00,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:27:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:00,807 INFO L225 Difference]: With dead ends: 78650 [2019-09-10 07:27:00,807 INFO L226 Difference]: Without dead ends: 78650 [2019-09-10 07:27:00,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78650 states. [2019-09-10 07:27:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78650 to 78650. [2019-09-10 07:27:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78650 states. [2019-09-10 07:27:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78650 states to 78650 states and 100622 transitions. [2019-09-10 07:27:01,924 INFO L78 Accepts]: Start accepts. Automaton has 78650 states and 100622 transitions. Word has length 109 [2019-09-10 07:27:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:01,924 INFO L475 AbstractCegarLoop]: Abstraction has 78650 states and 100622 transitions. [2019-09-10 07:27:01,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:27:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 78650 states and 100622 transitions. [2019-09-10 07:27:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:27:01,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:01,932 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:01,932 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1279232707, now seen corresponding path program 1 times [2019-09-10 07:27:01,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:01,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:01,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:01,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:01,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:01,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:01,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:27:01,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:01,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:27:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:27:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:01,989 INFO L87 Difference]: Start difference. First operand 78650 states and 100622 transitions. Second operand 3 states. [2019-09-10 07:27:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:02,111 INFO L93 Difference]: Finished difference Result 52352 states and 64081 transitions. [2019-09-10 07:27:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:27:02,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:27:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:02,164 INFO L225 Difference]: With dead ends: 52352 [2019-09-10 07:27:02,164 INFO L226 Difference]: Without dead ends: 52352 [2019-09-10 07:27:02,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52352 states. [2019-09-10 07:27:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52352 to 48640. [2019-09-10 07:27:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48640 states. [2019-09-10 07:27:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48640 states to 48640 states and 60000 transitions. [2019-09-10 07:27:02,616 INFO L78 Accepts]: Start accepts. Automaton has 48640 states and 60000 transitions. Word has length 109 [2019-09-10 07:27:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:02,618 INFO L475 AbstractCegarLoop]: Abstraction has 48640 states and 60000 transitions. [2019-09-10 07:27:02,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:27:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 48640 states and 60000 transitions. [2019-09-10 07:27:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:27:02,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:02,624 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:02,625 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash 467603715, now seen corresponding path program 1 times [2019-09-10 07:27:02,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:02,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:02,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:02,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:02,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:03,517 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-09-10 07:27:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:03,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:03,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:27:03,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:27:03,551 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [128], [130], [132], [135], [138], [141], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [176], [178], [180], [183], [186], [191], [193], [196], [199], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [246], [249], [255], [258], [261], [263], [271], [274], [280], [283], [286], [288], [305], [308], [311], [313], [754], [755], [759], [760], [761] [2019-09-10 07:27:03,553 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:27:03,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:27:03,573 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:27:03,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:27:03,833 INFO L272 AbstractInterpreter]: Visited 102 different actions 469 times. Merged at 42 different actions 327 times. Widened at 12 different actions 40 times. Performed 1764 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1764 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 11 different actions. Largest state had 147 variables. [2019-09-10 07:27:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:03,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:27:03,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:03,833 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) [2019-09-10 07:27:03,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:03,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:27:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:03,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 07:27:03,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:27:04,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:04,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:04,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:05,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:27:06,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:06,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:27:07,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:27:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:07,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:27:07,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 44 [2019-09-10 07:27:07,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:27:07,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 07:27:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 07:27:07,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1758, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:27:07,409 INFO L87 Difference]: Start difference. First operand 48640 states and 60000 transitions. Second operand 30 states. [2019-09-10 07:27:07,630 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 07:27:08,576 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-10 07:27:09,004 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:27:12,833 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 07:27:15,161 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:27:16,021 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:27:20,333 WARN L188 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:27:20,720 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:27:21,882 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:27:24,532 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:27:25,980 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:27:26,525 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:27:31,131 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-10 07:27:32,088 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:27:32,434 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:27:33,117 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:27:36,535 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:27:39,391 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:27:42,925 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-10 07:27:43,825 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:27:45,871 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:27:46,947 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:27:47,664 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-10 07:27:49,577 WARN L188 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:27:57,883 WARN L188 SmtUtils]: Spent 826.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-09-10 07:28:03,749 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:28:05,655 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:28:09,170 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:28:09,746 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:28:11,143 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:28:16,442 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:28:16,870 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:28:18,015 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:28:22,874 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:28:24,349 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:28:26,319 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:28:27,375 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:28:27,966 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:28:28,924 WARN L188 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:28:33,484 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-10 07:28:34,913 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-10 07:28:38,792 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:28:42,980 WARN L188 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:28:44,865 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-10 07:28:48,649 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:28:51,103 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:28:53,167 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:28:54,803 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-10 07:28:59,495 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-10 07:29:03,486 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 07:29:21,351 WARN L188 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:29:25,380 WARN L188 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:29:26,657 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:29:32,496 WARN L188 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:29:33,086 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:29:38,106 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:29:39,959 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:29:51,100 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:29:52,944 WARN L188 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:29:57,997 WARN L188 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:29:59,872 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:30:03,167 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:30:03,693 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:30:05,639 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:30:06,440 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 07:30:07,131 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:30:08,471 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:30:10,289 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:30:14,983 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:30:15,738 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-10 07:30:23,455 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:30:24,556 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-10 07:30:26,088 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:30:26,458 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-09-10 07:30:28,971 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:30:31,746 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:30:32,984 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:30:38,660 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:30:39,569 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:30:41,298 WARN L188 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:30:44,754 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:30:45,322 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:30:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:45,804 INFO L93 Difference]: Finished difference Result 140578 states and 170847 transitions. [2019-09-10 07:30:45,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-09-10 07:30:45,804 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 109 [2019-09-10 07:30:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:45,982 INFO L225 Difference]: With dead ends: 140578 [2019-09-10 07:30:45,982 INFO L226 Difference]: Without dead ends: 140578 [2019-09-10 07:30:45,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 177 SyntacticMatches, 15 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18801 ImplicationChecksByTransitivity, 114.8s TimeCoverageRelationStatistics Valid=6584, Invalid=47938, Unknown=0, NotChecked=0, Total=54522 [2019-09-10 07:30:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140578 states. [2019-09-10 07:30:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140578 to 76562. [2019-09-10 07:30:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76562 states. [2019-09-10 07:30:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76562 states to 76562 states and 94056 transitions. [2019-09-10 07:30:47,013 INFO L78 Accepts]: Start accepts. Automaton has 76562 states and 94056 transitions. Word has length 109 [2019-09-10 07:30:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:47,013 INFO L475 AbstractCegarLoop]: Abstraction has 76562 states and 94056 transitions. [2019-09-10 07:30:47,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 07:30:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 76562 states and 94056 transitions. [2019-09-10 07:30:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:30:47,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:47,018 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:30:47,018 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1780734919, now seen corresponding path program 1 times [2019-09-10 07:30:47,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:47,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:47,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:47,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:47,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:47,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:47,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:30:47,211 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 07:30:47,211 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [130], [132], [135], [138], [141], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [178], [180], [183], [186], [191], [193], [196], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [253], [255], [258], [261], [263], [271], [274], [280], [283], [286], [288], [296], [299], [305], [308], [311], [313], [352], [406], [754], [755], [759], [760], [761] [2019-09-10 07:30:47,214 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:30:47,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:30:47,231 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:30:47,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:30:47,439 INFO L272 AbstractInterpreter]: Visited 102 different actions 448 times. Merged at 41 different actions 306 times. Widened at 14 different actions 45 times. Performed 1694 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1694 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 10 different actions. Largest state had 147 variables. [2019-09-10 07:30:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:47,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:30:47,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:47,440 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:30:47,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:47,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:30:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:47,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:30:47,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:30:47,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:47,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:47,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:47,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:47,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:30:47,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:30:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:30:48,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:30:48,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:30:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:30:48,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:30:48,694 INFO L87 Difference]: Start difference. First operand 76562 states and 94056 transitions. Second operand 20 states. [2019-09-10 07:30:49,806 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-09-10 07:30:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:56,580 INFO L93 Difference]: Finished difference Result 194171 states and 234688 transitions. [2019-09-10 07:30:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 07:30:56,580 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-09-10 07:30:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:56,780 INFO L225 Difference]: With dead ends: 194171 [2019-09-10 07:30:56,780 INFO L226 Difference]: Without dead ends: 194171 [2019-09-10 07:30:56,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 186 SyntacticMatches, 13 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2287 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1524, Invalid=6132, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 07:30:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194171 states. [2019-09-10 07:30:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194171 to 85765. [2019-09-10 07:30:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85765 states. [2019-09-10 07:30:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85765 states to 85765 states and 105229 transitions. [2019-09-10 07:30:59,897 INFO L78 Accepts]: Start accepts. Automaton has 85765 states and 105229 transitions. Word has length 109 [2019-09-10 07:30:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:59,897 INFO L475 AbstractCegarLoop]: Abstraction has 85765 states and 105229 transitions. [2019-09-10 07:30:59,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:30:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 85765 states and 105229 transitions. [2019-09-10 07:30:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:30:59,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:59,901 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:30:59,902 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1505847849, now seen corresponding path program 1 times [2019-09-10 07:30:59,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:59,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:59,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:00,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:00,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:00,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:31:00,283 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [128], [130], [132], [135], [138], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [178], [180], [183], [186], [189], [191], [193], [196], [199], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [246], [249], [255], [258], [261], [263], [280], [283], [286], [288], [296], [299], [305], [308], [311], [313], [325], [347], [754], [755], [759], [760], [761] [2019-09-10 07:31:00,285 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:00,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:00,303 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:00,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:00,527 INFO L272 AbstractInterpreter]: Visited 103 different actions 463 times. Merged at 42 different actions 321 times. Widened at 12 different actions 38 times. Performed 1741 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1741 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 9 different actions. Largest state had 147 variables. [2019-09-10 07:31:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:00,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:00,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:00,527 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:31:00,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:00,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:00,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:31:00,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:00,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:00,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:00,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:00,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:01,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:31:01,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:01,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 33 [2019-09-10 07:31:01,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:01,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:31:01,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:31:01,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:31:01,392 INFO L87 Difference]: Start difference. First operand 85765 states and 105229 transitions. Second operand 25 states. [2019-09-10 07:31:03,683 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:31:04,520 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:31:05,919 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:31:07,161 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:31:07,694 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:31:08,935 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:31:10,323 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:31:10,577 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:31:10,907 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:31:11,095 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:31:11,251 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:31:12,019 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:31:12,993 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:31:16,698 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:31:17,332 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:31:18,469 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:31:19,376 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:31:20,559 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:31:21,177 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:31:21,379 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:31:23,756 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:31:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:24,085 INFO L93 Difference]: Finished difference Result 238979 states and 290737 transitions. [2019-09-10 07:31:24,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-10 07:31:24,085 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2019-09-10 07:31:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:24,368 INFO L225 Difference]: With dead ends: 238979 [2019-09-10 07:31:24,368 INFO L226 Difference]: Without dead ends: 238979 [2019-09-10 07:31:24,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10908 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=4318, Invalid=28262, Unknown=0, NotChecked=0, Total=32580 [2019-09-10 07:31:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238979 states. [2019-09-10 07:31:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238979 to 113432. [2019-09-10 07:31:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113432 states. [2019-09-10 07:31:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113432 states to 113432 states and 139362 transitions. [2019-09-10 07:31:26,671 INFO L78 Accepts]: Start accepts. Automaton has 113432 states and 139362 transitions. Word has length 110 [2019-09-10 07:31:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:26,672 INFO L475 AbstractCegarLoop]: Abstraction has 113432 states and 139362 transitions. [2019-09-10 07:31:26,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:31:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 113432 states and 139362 transitions. [2019-09-10 07:31:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:31:26,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:26,677 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:26,677 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2079265863, now seen corresponding path program 1 times [2019-09-10 07:31:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:26,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:26,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:27,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:27,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:27,008 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:31:27,009 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [128], [130], [132], [135], [138], [141], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [178], [180], [183], [186], [189], [191], [193], [196], [199], [202], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [242], [255], [258], [261], [263], [280], [283], [286], [288], [296], [299], [305], [308], [311], [313], [754], [755], [759], [760], [761] [2019-09-10 07:31:27,010 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:27,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:27,023 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:27,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:27,343 INFO L272 AbstractInterpreter]: Visited 101 different actions 485 times. Merged at 41 different actions 341 times. Widened at 14 different actions 42 times. Performed 1893 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1893 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 15 different actions. Largest state had 147 variables. [2019-09-10 07:31:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:27,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:27,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:27,344 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:31:27,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:27,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:27,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 07:31:27,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:27,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:28,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:29,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:29,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:29,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:29,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:29,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 48 [2019-09-10 07:31:29,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:29,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 07:31:29,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 07:31:29,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2059, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 07:31:29,610 INFO L87 Difference]: Start difference. First operand 113432 states and 139362 transitions. Second operand 33 states. [2019-09-10 07:31:29,802 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:31:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:41,934 INFO L93 Difference]: Finished difference Result 241629 states and 297338 transitions. [2019-09-10 07:31:41,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 07:31:41,935 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 110 [2019-09-10 07:31:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:42,243 INFO L225 Difference]: With dead ends: 241629 [2019-09-10 07:31:42,243 INFO L226 Difference]: Without dead ends: 241629 [2019-09-10 07:31:42,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 186 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1351, Invalid=9991, Unknown=0, NotChecked=0, Total=11342 [2019-09-10 07:31:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241629 states. [2019-09-10 07:31:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241629 to 124126. [2019-09-10 07:31:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124126 states. [2019-09-10 07:31:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124126 states to 124126 states and 153086 transitions. [2019-09-10 07:31:44,027 INFO L78 Accepts]: Start accepts. Automaton has 124126 states and 153086 transitions. Word has length 110 [2019-09-10 07:31:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:44,028 INFO L475 AbstractCegarLoop]: Abstraction has 124126 states and 153086 transitions. [2019-09-10 07:31:44,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 07:31:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 124126 states and 153086 transitions. [2019-09-10 07:31:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:31:44,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:44,033 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:44,034 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1909534947, now seen corresponding path program 1 times [2019-09-10 07:31:44,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:44,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:44,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:44,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:44,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:44,541 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:31:44,541 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [130], [132], [135], [138], [141], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [176], [178], [180], [183], [186], [191], [193], [196], [199], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [246], [249], [255], [258], [261], [263], [271], [274], [280], [283], [286], [288], [305], [308], [311], [313], [352], [406], [754], [755], [759], [760], [761] [2019-09-10 07:31:44,543 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:44,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:44,554 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:44,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:44,734 INFO L272 AbstractInterpreter]: Visited 103 different actions 392 times. Merged at 42 different actions 257 times. Widened at 11 different actions 23 times. Performed 1491 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1491 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 147 variables. [2019-09-10 07:31:44,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:44,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:44,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:44,735 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:31:44,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:44,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:44,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:31:44,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:44,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:44,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:44,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:45,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:46,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:31:46,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:46,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 31 [2019-09-10 07:31:46,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:46,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:31:46,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:31:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:31:46,258 INFO L87 Difference]: Start difference. First operand 124126 states and 153086 transitions. Second operand 25 states. [2019-09-10 07:31:48,830 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-09-10 07:31:49,517 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-09-10 07:31:49,719 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-09-10 07:31:50,327 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-09-10 07:31:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:50,895 INFO L93 Difference]: Finished difference Result 236128 states and 287963 transitions. [2019-09-10 07:31:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 07:31:50,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2019-09-10 07:31:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:51,178 INFO L225 Difference]: With dead ends: 236128 [2019-09-10 07:31:51,178 INFO L226 Difference]: Without dead ends: 236128 [2019-09-10 07:31:51,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 202 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=805, Invalid=2977, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 07:31:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236128 states. [2019-09-10 07:31:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236128 to 124864. [2019-09-10 07:31:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124864 states. [2019-09-10 07:31:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124864 states to 124864 states and 153696 transitions. [2019-09-10 07:31:55,944 INFO L78 Accepts]: Start accepts. Automaton has 124864 states and 153696 transitions. Word has length 110 [2019-09-10 07:31:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:55,945 INFO L475 AbstractCegarLoop]: Abstraction has 124864 states and 153696 transitions. [2019-09-10 07:31:55,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:31:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 124864 states and 153696 transitions. [2019-09-10 07:31:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:31:55,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:55,949 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:55,949 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1961251977, now seen corresponding path program 1 times [2019-09-10 07:31:55,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:55,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:55,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:55,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:55,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:58,144 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-09-10 07:32:02,214 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-09-10 07:32:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:02,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:32:02,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:32:02,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:32:02,332 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [117], [119], [122], [125], [128], [130], [132], [135], [138], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [178], [180], [183], [191], [193], [196], [199], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [246], [249], [255], [258], [261], [263], [278], [280], [283], [286], [288], [296], [299], [305], [308], [311], [313], [325], [347], [411], [525], [754], [755], [759], [760], [761] [2019-09-10 07:32:02,334 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:32:02,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:32:02,346 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:32:02,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:32:02,562 INFO L272 AbstractInterpreter]: Visited 103 different actions 465 times. Merged at 41 different actions 321 times. Widened at 12 different actions 44 times. Performed 1795 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1795 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 9 different actions. Largest state had 147 variables. [2019-09-10 07:32:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:02,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:32:02,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:32:02,563 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:32:02,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:02,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:32:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:02,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:32:02,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:32:02,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:02,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:02,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:02,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:03,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:32:03,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:03,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:03,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:32:03,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 25 [2019-09-10 07:32:03,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:32:03,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:32:03,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:32:03,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:32:03,455 INFO L87 Difference]: Start difference. First operand 124864 states and 153696 transitions. Second operand 21 states. [2019-09-10 07:32:06,588 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:32:17,085 WARN L188 SmtUtils]: Spent 10.22 s on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 07:32:21,551 WARN L188 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-09-10 07:32:21,871 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:32:32,584 WARN L188 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:32:34,877 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-09-10 07:32:35,267 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:32:35,619 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-10 07:32:37,968 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:32:40,319 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:32:52,724 WARN L188 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-09-10 07:32:53,457 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-10 07:32:55,711 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:32:55,933 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-10 07:32:56,461 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:32:56,676 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 07:32:57,346 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 07:32:58,103 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-10 07:32:58,508 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:32:59,764 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 07:32:59,978 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-10 07:33:00,473 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-10 07:33:02,214 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 07:33:02,935 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:33:03,525 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 07:33:03,738 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 07:33:04,236 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 07:33:04,724 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 07:33:05,071 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 07:33:05,240 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-10 07:33:05,408 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-10 07:33:07,860 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 07:33:16,227 WARN L188 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 07:33:16,832 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:33:24,003 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:33:28,395 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 07:33:30,957 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:33:31,761 WARN L188 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 07:33:31,979 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-09-10 07:33:32,319 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-09-10 07:33:36,879 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-09-10 07:33:45,204 WARN L188 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 07:33:45,587 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:33:45,827 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 07:33:46,021 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 07:33:46,179 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-10 07:33:52,414 WARN L188 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:34:00,815 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:34:07,090 WARN L188 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:34:11,579 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:34:11,904 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 07:34:12,217 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-09-10 07:34:12,430 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-10 07:34:12,967 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 07:34:13,223 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 07:34:13,550 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:34:13,883 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 07:34:16,109 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:34:16,642 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-10 07:34:17,159 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-10 07:34:21,382 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:34:21,653 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 07:34:23,968 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-10 07:34:26,641 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 07:34:27,133 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-10 07:34:33,452 WARN L188 SmtUtils]: Spent 6.20 s on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:34:33,905 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 07:34:34,192 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 07:34:34,468 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 07:34:34,731 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-10 07:34:34,962 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-10 07:34:35,241 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 07:34:44,056 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-09-10 07:34:44,561 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:34:46,901 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 07:34:47,165 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 07:34:53,553 WARN L188 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:34:59,811 WARN L188 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:34:59,965 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-10 07:35:06,974 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:35:07,158 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:35:14,265 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-09-10 07:35:18,563 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-09-10 07:35:48,871 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 07:35:53,406 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:35:56,036 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 07:35:58,522 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:36:02,956 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 07:36:03,291 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 07:36:07,900 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-09-10 07:36:08,235 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:36:17,126 WARN L188 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:36:31,514 WARN L188 SmtUtils]: Spent 14.27 s on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:36:31,951 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 07:36:38,452 WARN L188 SmtUtils]: Spent 6.34 s on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-10 07:36:40,588 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 56 [2019-09-10 07:36:43,294 WARN L188 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 07:36:48,056 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-09-10 07:36:52,604 WARN L188 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:36:52,851 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:36:55,494 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-09-10 07:36:55,828 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:36:56,148 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-10 07:36:56,474 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2019-09-10 07:36:57,088 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 07:36:59,370 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:37:05,922 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-09-10 07:37:18,405 WARN L188 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 07:37:27,352 WARN L188 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:37:28,090 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 07:37:34,686 WARN L188 SmtUtils]: Spent 6.51 s on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-09-10 07:37:37,184 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2019-09-10 07:37:43,586 WARN L188 SmtUtils]: Spent 6.31 s on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:37:45,798 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 07:37:58,512 WARN L188 SmtUtils]: Spent 12.65 s on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:38:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:05,288 INFO L93 Difference]: Finished difference Result 462580 states and 560135 transitions. [2019-09-10 07:38:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-10 07:38:05,288 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 110 [2019-09-10 07:38:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:05,821 INFO L225 Difference]: With dead ends: 462580 [2019-09-10 07:38:05,821 INFO L226 Difference]: Without dead ends: 462580 [2019-09-10 07:38:05,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17134 ImplicationChecksByTransitivity, 266.7s TimeCoverageRelationStatistics Valid=5731, Invalid=39001, Unknown=0, NotChecked=0, Total=44732 [2019-09-10 07:38:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462580 states. [2019-09-10 07:38:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462580 to 169831. [2019-09-10 07:38:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169831 states. [2019-09-10 07:38:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169831 states to 169831 states and 208820 transitions. [2019-09-10 07:38:08,880 INFO L78 Accepts]: Start accepts. Automaton has 169831 states and 208820 transitions. Word has length 110 [2019-09-10 07:38:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:08,880 INFO L475 AbstractCegarLoop]: Abstraction has 169831 states and 208820 transitions. [2019-09-10 07:38:08,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:38:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 169831 states and 208820 transitions. [2019-09-10 07:38:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:38:08,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:08,885 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:08,885 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:08,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash 933315953, now seen corresponding path program 1 times [2019-09-10 07:38:08,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:08,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:08,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:09,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:09,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:38:09,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 07:38:09,202 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [117], [119], [122], [125], [128], [130], [132], [135], [138], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [178], [180], [183], [186], [191], [193], [196], [199], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [246], [249], [255], [258], [261], [263], [271], [274], [280], [283], [286], [288], [303], [305], [308], [311], [313], [325], [347], [411], [525], [754], [755], [759], [760], [761] [2019-09-10 07:38:09,204 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:38:09,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:38:09,223 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:38:09,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:38:09,456 INFO L272 AbstractInterpreter]: Visited 103 different actions 437 times. Merged at 41 different actions 296 times. Widened at 13 different actions 34 times. Performed 1618 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1618 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 9 different actions. Largest state had 147 variables. [2019-09-10 07:38:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:09,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:38:09,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:09,456 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:38:09,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:09,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:38:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:09,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:38:09,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:38:09,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:09,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:09,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:38:10,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:10,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:10,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:10,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:10,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:38:10,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 20 [2019-09-10 07:38:10,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:38:10,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:38:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:38:10,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:38:10,107 INFO L87 Difference]: Start difference. First operand 169831 states and 208820 transitions. Second operand 17 states. [2019-09-10 07:38:10,238 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-09-10 07:38:10,525 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:38:10,673 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:38:14,132 WARN L188 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 07:38:14,850 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 07:38:15,243 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:38:16,187 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 07:38:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:17,174 INFO L93 Difference]: Finished difference Result 267502 states and 327921 transitions. [2019-09-10 07:38:17,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 07:38:17,175 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2019-09-10 07:38:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:17,466 INFO L225 Difference]: With dead ends: 267502 [2019-09-10 07:38:17,466 INFO L226 Difference]: Without dead ends: 267502 [2019-09-10 07:38:17,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=566, Invalid=1884, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:38:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267502 states. [2019-09-10 07:38:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267502 to 156777. [2019-09-10 07:38:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156777 states. [2019-09-10 07:38:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156777 states to 156777 states and 192678 transitions. [2019-09-10 07:38:22,895 INFO L78 Accepts]: Start accepts. Automaton has 156777 states and 192678 transitions. Word has length 110 [2019-09-10 07:38:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:22,895 INFO L475 AbstractCegarLoop]: Abstraction has 156777 states and 192678 transitions. [2019-09-10 07:38:22,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:38:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 156777 states and 192678 transitions. [2019-09-10 07:38:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:38:22,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:22,901 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:22,901 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1549397964, now seen corresponding path program 1 times [2019-09-10 07:38:22,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:22,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:22,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:22,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:23,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:23,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:38:23,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 07:38:23,269 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [130], [132], [135], [138], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [176], [178], [180], [183], [186], [191], [193], [196], [199], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [244], [246], [249], [255], [258], [261], [263], [271], [274], [280], [283], [286], [288], [305], [308], [311], [313], [325], [347], [352], [406], [754], [755], [759], [760], [761] [2019-09-10 07:38:23,271 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:38:23,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:38:23,289 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:38:23,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:38:23,526 INFO L272 AbstractInterpreter]: Visited 104 different actions 416 times. Merged at 42 different actions 278 times. Widened at 11 different actions 30 times. Performed 1592 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1592 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 9 different actions. Largest state had 147 variables. [2019-09-10 07:38:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:23,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:38:23,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:23,527 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:38:23,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:23,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:38:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:23,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:38:23,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:38:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:24,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:38:24,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:24,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:38:24,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 34 [2019-09-10 07:38:24,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:38:24,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 07:38:24,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 07:38:24,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:38:24,786 INFO L87 Difference]: Start difference. First operand 156777 states and 192678 transitions. Second operand 26 states. [2019-09-10 07:38:26,251 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-10 07:38:26,962 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 07:38:27,474 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 07:38:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:38:27,943 INFO L93 Difference]: Finished difference Result 177532 states and 216923 transitions. [2019-09-10 07:38:27,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:38:27,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-09-10 07:38:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:38:28,125 INFO L225 Difference]: With dead ends: 177532 [2019-09-10 07:38:28,125 INFO L226 Difference]: Without dead ends: 177532 [2019-09-10 07:38:28,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 198 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=629, Invalid=2451, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:38:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177532 states. [2019-09-10 07:38:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177532 to 162970. [2019-09-10 07:38:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162970 states. [2019-09-10 07:38:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162970 states to 162970 states and 199787 transitions. [2019-09-10 07:38:30,185 INFO L78 Accepts]: Start accepts. Automaton has 162970 states and 199787 transitions. Word has length 111 [2019-09-10 07:38:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:38:30,185 INFO L475 AbstractCegarLoop]: Abstraction has 162970 states and 199787 transitions. [2019-09-10 07:38:30,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 07:38:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 162970 states and 199787 transitions. [2019-09-10 07:38:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:38:30,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:38:30,193 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:38:30,193 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:38:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1898414078, now seen corresponding path program 1 times [2019-09-10 07:38:30,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:38:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:30,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:38:30,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:38:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:30,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:30,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:38:30,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 07:38:30,736 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [68], [71], [74], [78], [81], [84], [87], [91], [94], [97], [101], [103], [106], [109], [112], [115], [117], [119], [122], [125], [130], [132], [135], [138], [141], [143], [145], [148], [152], [155], [158], [162], [164], [167], [170], [173], [176], [178], [180], [183], [186], [191], [193], [196], [199], [202], [204], [206], [209], [216], [218], [220], [223], [224], [226], [228], [237], [240], [242], [255], [258], [261], [263], [271], [274], [280], [283], [286], [288], [305], [308], [311], [313], [352], [406], [754], [755], [759], [760], [761] [2019-09-10 07:38:30,739 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:38:30,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:38:30,752 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:38:30,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:38:30,926 INFO L272 AbstractInterpreter]: Visited 102 different actions 385 times. Merged at 41 different actions 253 times. Widened at 10 different actions 21 times. Performed 1496 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1496 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 147 variables. [2019-09-10 07:38:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:38:30,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:38:30,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:38:30,926 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:38:30,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:38:30,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:38:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:38:31,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 07:38:31,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:38:31,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:32,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:32,667 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:38:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:36,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:36,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:36,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:36,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:37,260 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 07:38:37,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:38:37,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:37,784 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-09-10 07:38:38,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-10 07:38:38,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:38:39,174 WARN L188 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 130 [2019-09-10 07:38:42,299 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-09-10 07:38:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-09-10 07:38:42,866 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 60 [2019-09-10 07:38:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:38:43,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:38:43,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 57 [2019-09-10 07:38:43,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:38:43,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 07:38:43,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 07:38:43,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2916, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:38:43,744 INFO L87 Difference]: Start difference. First operand 162970 states and 199787 transitions. Second operand 39 states. [2019-09-10 07:38:48,554 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:38:53,982 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:39:00,822 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44