java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:54:51,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:54:51,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:54:51,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:54:51,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:54:51,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:54:51,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:54:51,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:54:51,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:54:51,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:54:51,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:54:51,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:54:51,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:54:51,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:54:51,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:54:51,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:54:51,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:54:51,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:54:51,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:54:51,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:54:51,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:54:51,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:54:51,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:54:51,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:54:51,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:54:51,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:54:51,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:54:51,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:54:51,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:54:51,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:54:51,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:54:51,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:54:51,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:54:51,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:54:51,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:54:51,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:54:51,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:54:51,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:54:51,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:54:51,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:54:51,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:54:51,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:54:51,392 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:54:51,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:54:51,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:54:51,396 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:54:51,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:54:51,397 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:54:51,397 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:54:51,397 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:54:51,398 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:54:51,398 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:54:51,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:54:51,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:54:51,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:54:51,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:54:51,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:54:51,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:54:51,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:54:51,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:54:51,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:54:51,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:54:51,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:54:51,403 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:54:51,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:54:51,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:54:51,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:54:51,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:54:51,404 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:54:51,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:54:51,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:54:51,405 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:54:51,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:54:51,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:54:51,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:54:51,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:54:51,476 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:54:51,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:54:51,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f687d4b/34b499104d234689bb7319dadaab2848/FLAG6a5a8f12a [2019-09-10 06:54:52,054 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:54:52,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:54:52,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f687d4b/34b499104d234689bb7319dadaab2848/FLAG6a5a8f12a [2019-09-10 06:54:52,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f687d4b/34b499104d234689bb7319dadaab2848 [2019-09-10 06:54:52,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:54:52,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:54:52,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:54:52,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:54:52,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:54:52,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc34360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52, skipping insertion in model container [2019-09-10 06:54:52,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:54:52,459 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:54:52,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:54:52,840 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:54:52,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:54:52,924 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:54:52,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52 WrapperNode [2019-09-10 06:54:52,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:54:52,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:54:52,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:54:52,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:54:52,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (1/1) ... [2019-09-10 06:54:52,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:54:52,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:54:52,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:54:52,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:54:52,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:54:53,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:54:53,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:54:53,042 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:54:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:54:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:54:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:54:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:54:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:54:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:54:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:54:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:54:53,044 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:54:53,044 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:54:53,044 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:54:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:54:53,045 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:54:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:54:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:54:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:54:53,683 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:54:53,684 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:54:53,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:54:53 BoogieIcfgContainer [2019-09-10 06:54:53,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:54:53,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:54:53,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:54:53,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:54:53,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:54:52" (1/3) ... [2019-09-10 06:54:53,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5cd1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:54:53, skipping insertion in model container [2019-09-10 06:54:53,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:54:52" (2/3) ... [2019-09-10 06:54:53,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5cd1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:54:53, skipping insertion in model container [2019-09-10 06:54:53,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:54:53" (3/3) ... [2019-09-10 06:54:53,700 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:54:53,711 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:54:53,734 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:54:53,753 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:54:53,786 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:54:53,786 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:54:53,786 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:54:53,786 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:54:53,787 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:54:53,787 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:54:53,787 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:54:53,787 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:54:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-09-10 06:54:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 06:54:53,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:53,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:53,821 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:53,826 INFO L82 PathProgramCache]: Analyzing trace with hash 516591794, now seen corresponding path program 1 times [2019-09-10 06:54:53,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:53,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:53,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:53,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:54,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:54,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:54,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:54,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:54,294 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2019-09-10 06:54:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:54,372 INFO L93 Difference]: Finished difference Result 178 states and 283 transitions. [2019-09-10 06:54:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:54,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 06:54:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:54,393 INFO L225 Difference]: With dead ends: 178 [2019-09-10 06:54:54,393 INFO L226 Difference]: Without dead ends: 170 [2019-09-10 06:54:54,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-10 06:54:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-09-10 06:54:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-10 06:54:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-09-10 06:54:54,457 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 52 [2019-09-10 06:54:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:54,458 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-09-10 06:54:54,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-09-10 06:54:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 06:54:54,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:54,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:54,463 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1442159431, now seen corresponding path program 1 times [2019-09-10 06:54:54,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:54,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:54,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:54,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:54,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:54,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:54,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:54,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:54,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:54,636 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 3 states. [2019-09-10 06:54:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:54,678 INFO L93 Difference]: Finished difference Result 273 states and 413 transitions. [2019-09-10 06:54:54,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:54,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 06:54:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:54,688 INFO L225 Difference]: With dead ends: 273 [2019-09-10 06:54:54,688 INFO L226 Difference]: Without dead ends: 273 [2019-09-10 06:54:54,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-10 06:54:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-09-10 06:54:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-10 06:54:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-09-10 06:54:54,738 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 52 [2019-09-10 06:54:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:54,739 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-09-10 06:54:54,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-09-10 06:54:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 06:54:54,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:54,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:54,743 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:54,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:54,743 INFO L82 PathProgramCache]: Analyzing trace with hash -455539237, now seen corresponding path program 1 times [2019-09-10 06:54:54,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:54,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:54,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:54,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:54,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:54,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:54,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:54,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:54,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:54,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:54,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:54,853 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-09-10 06:54:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:54,896 INFO L93 Difference]: Finished difference Result 447 states and 685 transitions. [2019-09-10 06:54:54,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:54,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 06:54:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:54,909 INFO L225 Difference]: With dead ends: 447 [2019-09-10 06:54:54,909 INFO L226 Difference]: Without dead ends: 447 [2019-09-10 06:54:54,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-09-10 06:54:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2019-09-10 06:54:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-09-10 06:54:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 684 transitions. [2019-09-10 06:54:54,951 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 684 transitions. Word has length 53 [2019-09-10 06:54:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:54,953 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 684 transitions. [2019-09-10 06:54:54,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 684 transitions. [2019-09-10 06:54:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:54:54,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:54,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:54,955 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:54,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash 224665030, now seen corresponding path program 1 times [2019-09-10 06:54:54,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:54,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:54,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:54,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:55,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:55,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:55,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:55,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:55,064 INFO L87 Difference]: Start difference. First operand 445 states and 684 transitions. Second operand 3 states. [2019-09-10 06:54:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:55,094 INFO L93 Difference]: Finished difference Result 731 states and 1121 transitions. [2019-09-10 06:54:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:55,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-10 06:54:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:55,100 INFO L225 Difference]: With dead ends: 731 [2019-09-10 06:54:55,100 INFO L226 Difference]: Without dead ends: 731 [2019-09-10 06:54:55,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-10 06:54:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2019-09-10 06:54:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-09-10 06:54:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1120 transitions. [2019-09-10 06:54:55,125 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1120 transitions. Word has length 54 [2019-09-10 06:54:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:55,126 INFO L475 AbstractCegarLoop]: Abstraction has 729 states and 1120 transitions. [2019-09-10 06:54:55,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1120 transitions. [2019-09-10 06:54:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:54:55,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:55,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:55,134 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -973467484, now seen corresponding path program 1 times [2019-09-10 06:54:55,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:55,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:55,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:55,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:55,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:55,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:55,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:55,314 INFO L87 Difference]: Start difference. First operand 729 states and 1120 transitions. Second operand 6 states. [2019-09-10 06:54:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:55,499 INFO L93 Difference]: Finished difference Result 3521 states and 5444 transitions. [2019-09-10 06:54:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:54:55,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-10 06:54:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:55,519 INFO L225 Difference]: With dead ends: 3521 [2019-09-10 06:54:55,519 INFO L226 Difference]: Without dead ends: 3521 [2019-09-10 06:54:55,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:54:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-09-10 06:54:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 1425. [2019-09-10 06:54:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-09-10 06:54:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2176 transitions. [2019-09-10 06:54:55,592 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2176 transitions. Word has length 55 [2019-09-10 06:54:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:55,592 INFO L475 AbstractCegarLoop]: Abstraction has 1425 states and 2176 transitions. [2019-09-10 06:54:55,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2176 transitions. [2019-09-10 06:54:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:54:55,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:55,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:55,595 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:55,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:55,595 INFO L82 PathProgramCache]: Analyzing trace with hash -131253693, now seen corresponding path program 1 times [2019-09-10 06:54:55,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:55,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:55,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:55,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:55,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:55,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:55,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:55,761 INFO L87 Difference]: Start difference. First operand 1425 states and 2176 transitions. Second operand 6 states. [2019-09-10 06:54:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:55,892 INFO L93 Difference]: Finished difference Result 4791 states and 7235 transitions. [2019-09-10 06:54:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:54:55,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:54:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:55,916 INFO L225 Difference]: With dead ends: 4791 [2019-09-10 06:54:55,916 INFO L226 Difference]: Without dead ends: 4791 [2019-09-10 06:54:55,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2019-09-10 06:54:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 4785. [2019-09-10 06:54:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4785 states. [2019-09-10 06:54:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 7232 transitions. [2019-09-10 06:54:56,025 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 7232 transitions. Word has length 56 [2019-09-10 06:54:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:56,026 INFO L475 AbstractCegarLoop]: Abstraction has 4785 states and 7232 transitions. [2019-09-10 06:54:56,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 7232 transitions. [2019-09-10 06:54:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:54:56,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:56,027 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 06:54:56,028 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:56,028 INFO L82 PathProgramCache]: Analyzing trace with hash 394656300, now seen corresponding path program 1 times [2019-09-10 06:54:56,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:56,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:56,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:56,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:56,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:56,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:56,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:56,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:56,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:56,115 INFO L87 Difference]: Start difference. First operand 4785 states and 7232 transitions. Second operand 6 states. [2019-09-10 06:54:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:56,459 INFO L93 Difference]: Finished difference Result 13957 states and 20962 transitions. [2019-09-10 06:54:56,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:54:56,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-09-10 06:54:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:56,551 INFO L225 Difference]: With dead ends: 13957 [2019-09-10 06:54:56,551 INFO L226 Difference]: Without dead ends: 13957 [2019-09-10 06:54:56,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:54:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13957 states. [2019-09-10 06:54:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13957 to 13953. [2019-09-10 06:54:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13953 states. [2019-09-10 06:54:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13953 states to 13953 states and 20960 transitions. [2019-09-10 06:54:56,913 INFO L78 Accepts]: Start accepts. Automaton has 13953 states and 20960 transitions. Word has length 58 [2019-09-10 06:54:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:56,914 INFO L475 AbstractCegarLoop]: Abstraction has 13953 states and 20960 transitions. [2019-09-10 06:54:56,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 13953 states and 20960 transitions. [2019-09-10 06:54:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:54:56,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:56,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, 1, 1, 1, 1] [2019-09-10 06:54:56,916 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:56,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash -419755695, now seen corresponding path program 1 times [2019-09-10 06:54:56,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:56,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:56,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:56,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:56,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:57,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 06:54:57,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:57,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:54:57,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:57,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:54:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:54:57,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:54:57,010 INFO L87 Difference]: Start difference. First operand 13953 states and 20960 transitions. Second operand 5 states. [2019-09-10 06:54:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:57,235 INFO L93 Difference]: Finished difference Result 28641 states and 42272 transitions. [2019-09-10 06:54:57,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:54:57,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-10 06:54:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:57,295 INFO L225 Difference]: With dead ends: 28641 [2019-09-10 06:54:57,295 INFO L226 Difference]: Without dead ends: 28641 [2019-09-10 06:54:57,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28641 states. [2019-09-10 06:54:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28641 to 14721. [2019-09-10 06:54:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14721 states. [2019-09-10 06:54:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14721 states to 14721 states and 21728 transitions. [2019-09-10 06:54:57,637 INFO L78 Accepts]: Start accepts. Automaton has 14721 states and 21728 transitions. Word has length 58 [2019-09-10 06:54:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:57,637 INFO L475 AbstractCegarLoop]: Abstraction has 14721 states and 21728 transitions. [2019-09-10 06:54:57,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:54:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 14721 states and 21728 transitions. [2019-09-10 06:54:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:54:57,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:57,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:57,639 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash -117904923, now seen corresponding path program 1 times [2019-09-10 06:54:57,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:57,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:57,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:57,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:57,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:57,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:57,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:57,704 INFO L87 Difference]: Start difference. First operand 14721 states and 21728 transitions. Second operand 3 states. [2019-09-10 06:54:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:57,781 INFO L93 Difference]: Finished difference Result 20937 states and 30683 transitions. [2019-09-10 06:54:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:57,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:54:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:57,827 INFO L225 Difference]: With dead ends: 20937 [2019-09-10 06:54:57,827 INFO L226 Difference]: Without dead ends: 20937 [2019-09-10 06:54:57,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20937 states. [2019-09-10 06:54:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20937 to 20935. [2019-09-10 06:54:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20935 states. [2019-09-10 06:54:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20935 states to 20935 states and 30682 transitions. [2019-09-10 06:54:58,551 INFO L78 Accepts]: Start accepts. Automaton has 20935 states and 30682 transitions. Word has length 59 [2019-09-10 06:54:58,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:58,552 INFO L475 AbstractCegarLoop]: Abstraction has 20935 states and 30682 transitions. [2019-09-10 06:54:58,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 20935 states and 30682 transitions. [2019-09-10 06:54:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:54:58,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:58,560 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] [2019-09-10 06:54:58,560 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 649308805, now seen corresponding path program 1 times [2019-09-10 06:54:58,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:58,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:58,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:58,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:58,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:54:58,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:58,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:54:58,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2019-09-10 06:54:58,687 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [159], [164], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 06:54:58,729 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:54:58,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:54:58,855 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:54:59,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:54:59,466 INFO L272 AbstractInterpreter]: Visited 73 different actions 504 times. Merged at 42 different actions 369 times. Widened at 15 different actions 61 times. Performed 1736 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1736 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 51 fixpoints after 14 different actions. Largest state had 121 variables. [2019-09-10 06:54:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:59,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:54:59,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:54:59,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:54:59,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:59,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:54:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:59,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 06:54:59,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:54:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:54:59,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:54:59,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:55:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:55:00,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:55:00,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 17 [2019-09-10 06:55:00,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:55:00,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:55:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:55:00,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:55:00,160 INFO L87 Difference]: Start difference. First operand 20935 states and 30682 transitions. Second operand 10 states. [2019-09-10 06:55:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:00,425 INFO L93 Difference]: Finished difference Result 37772 states and 55029 transitions. [2019-09-10 06:55:00,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:55:00,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-09-10 06:55:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:00,515 INFO L225 Difference]: With dead ends: 37772 [2019-09-10 06:55:00,515 INFO L226 Difference]: Without dead ends: 37772 [2019-09-10 06:55:00,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:55:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37772 states. [2019-09-10 06:55:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37772 to 34759. [2019-09-10 06:55:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34759 states. [2019-09-10 06:55:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34759 states to 34759 states and 50650 transitions. [2019-09-10 06:55:01,204 INFO L78 Accepts]: Start accepts. Automaton has 34759 states and 50650 transitions. Word has length 80 [2019-09-10 06:55:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:01,205 INFO L475 AbstractCegarLoop]: Abstraction has 34759 states and 50650 transitions. [2019-09-10 06:55:01,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:55:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 34759 states and 50650 transitions. [2019-09-10 06:55:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:55:01,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:01,214 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:01,214 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1922086913, now seen corresponding path program 1 times [2019-09-10 06:55:01,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:01,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:01,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:55:01,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:55:01,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 06:55:01,325 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 06:55:01,333 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:55:01,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:55:01,361 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:55:01,550 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:55:01,551 INFO L272 AbstractInterpreter]: Visited 70 different actions 360 times. Merged at 36 different actions 243 times. Widened at 12 different actions 31 times. Performed 1309 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1309 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 121 variables. [2019-09-10 06:55:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:01,551 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:55:01,780 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 81.82% of their original sizes. [2019-09-10 06:55:01,780 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:55:04,633 INFO L420 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2019-09-10 06:55:04,633 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:55:04,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:55:04,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 06:55:04,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:04,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 06:55:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 06:55:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1917, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:55:04,637 INFO L87 Difference]: Start difference. First operand 34759 states and 50650 transitions. Second operand 47 states. [2019-09-10 06:56:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:17,655 INFO L93 Difference]: Finished difference Result 91490 states and 128634 transitions. [2019-09-10 06:56:17,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 447 states. [2019-09-10 06:56:17,656 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 81 [2019-09-10 06:56:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:17,792 INFO L225 Difference]: With dead ends: 91490 [2019-09-10 06:56:17,793 INFO L226 Difference]: Without dead ends: 91490 [2019-09-10 06:56:17,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96279 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=23485, Invalid=198827, Unknown=0, NotChecked=0, Total=222312 [2019-09-10 06:56:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91490 states. [2019-09-10 06:56:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91490 to 50996. [2019-09-10 06:56:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50996 states. [2019-09-10 06:56:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50996 states to 50996 states and 73010 transitions. [2019-09-10 06:56:18,742 INFO L78 Accepts]: Start accepts. Automaton has 50996 states and 73010 transitions. Word has length 81 [2019-09-10 06:56:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:18,742 INFO L475 AbstractCegarLoop]: Abstraction has 50996 states and 73010 transitions. [2019-09-10 06:56:18,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 06:56:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 50996 states and 73010 transitions. [2019-09-10 06:56:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:56:18,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:18,754 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:18,755 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash 443636064, now seen corresponding path program 1 times [2019-09-10 06:56:18,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:18,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:18,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:18,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:18,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:18,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:18,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:18,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:18,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:18,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:18,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:18,813 INFO L87 Difference]: Start difference. First operand 50996 states and 73010 transitions. Second operand 3 states. [2019-09-10 06:56:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:19,037 INFO L93 Difference]: Finished difference Result 64465 states and 90706 transitions. [2019-09-10 06:56:19,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:19,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 06:56:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:19,132 INFO L225 Difference]: With dead ends: 64465 [2019-09-10 06:56:19,133 INFO L226 Difference]: Without dead ends: 64465 [2019-09-10 06:56:19,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64465 states. [2019-09-10 06:56:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64465 to 60545. [2019-09-10 06:56:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60545 states. [2019-09-10 06:56:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60545 states to 60545 states and 85441 transitions. [2019-09-10 06:56:21,337 INFO L78 Accepts]: Start accepts. Automaton has 60545 states and 85441 transitions. Word has length 81 [2019-09-10 06:56:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:21,338 INFO L475 AbstractCegarLoop]: Abstraction has 60545 states and 85441 transitions. [2019-09-10 06:56:21,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 60545 states and 85441 transitions. [2019-09-10 06:56:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:56:21,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:21,353 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:21,353 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:21,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash 794730493, now seen corresponding path program 1 times [2019-09-10 06:56:21,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:21,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:21,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:21,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:21,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:21,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:21,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:21,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:21,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:21,418 INFO L87 Difference]: Start difference. First operand 60545 states and 85441 transitions. Second operand 3 states. [2019-09-10 06:56:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:21,620 INFO L93 Difference]: Finished difference Result 79049 states and 110032 transitions. [2019-09-10 06:56:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:21,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 06:56:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:21,728 INFO L225 Difference]: With dead ends: 79049 [2019-09-10 06:56:21,728 INFO L226 Difference]: Without dead ends: 79049 [2019-09-10 06:56:21,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79049 states. [2019-09-10 06:56:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79049 to 77466. [2019-09-10 06:56:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77466 states. [2019-09-10 06:56:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77466 states to 77466 states and 108098 transitions. [2019-09-10 06:56:22,588 INFO L78 Accepts]: Start accepts. Automaton has 77466 states and 108098 transitions. Word has length 81 [2019-09-10 06:56:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:22,588 INFO L475 AbstractCegarLoop]: Abstraction has 77466 states and 108098 transitions. [2019-09-10 06:56:22,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 77466 states and 108098 transitions. [2019-09-10 06:56:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:56:22,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:22,607 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:22,607 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:22,608 INFO L82 PathProgramCache]: Analyzing trace with hash -683720356, now seen corresponding path program 1 times [2019-09-10 06:56:22,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:22,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:22,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:22,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:22,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:22,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:22,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:56:22,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 06:56:22,695 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 06:56:22,698 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:56:22,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:56:22,717 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:56:22,872 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:56:22,872 INFO L272 AbstractInterpreter]: Visited 70 different actions 399 times. Merged at 36 different actions 277 times. Widened at 14 different actions 41 times. Performed 1492 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1492 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 121 variables. [2019-09-10 06:56:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:22,873 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:56:23,392 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 81.93% of their original sizes. [2019-09-10 06:56:23,392 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:56:25,804 INFO L420 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2019-09-10 06:56:25,804 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:56:25,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:56:25,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [7] total 51 [2019-09-10 06:56:25,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:25,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 06:56:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 06:56:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1822, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:56:25,807 INFO L87 Difference]: Start difference. First operand 77466 states and 108098 transitions. Second operand 46 states. [2019-09-10 06:57:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:30,754 INFO L93 Difference]: Finished difference Result 165095 states and 224550 transitions. [2019-09-10 06:57:30,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 331 states. [2019-09-10 06:57:30,755 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 81 [2019-09-10 06:57:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:30,934 INFO L225 Difference]: With dead ends: 165095 [2019-09-10 06:57:30,934 INFO L226 Difference]: Without dead ends: 165095 [2019-09-10 06:57:30,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54123 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=16379, Invalid=107173, Unknown=0, NotChecked=0, Total=123552 [2019-09-10 06:57:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165095 states. [2019-09-10 06:57:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165095 to 95503. [2019-09-10 06:57:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95503 states. [2019-09-10 06:57:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95503 states to 95503 states and 131347 transitions. [2019-09-10 06:57:32,440 INFO L78 Accepts]: Start accepts. Automaton has 95503 states and 131347 transitions. Word has length 81 [2019-09-10 06:57:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:32,441 INFO L475 AbstractCegarLoop]: Abstraction has 95503 states and 131347 transitions. [2019-09-10 06:57:32,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 06:57:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 95503 states and 131347 transitions. [2019-09-10 06:57:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:57:32,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:32,459 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:32,460 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1170556187, now seen corresponding path program 1 times [2019-09-10 06:57:32,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:32,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:32,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:32,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:32,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:32,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:32,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:32,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:32,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:32,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:32,513 INFO L87 Difference]: Start difference. First operand 95503 states and 131347 transitions. Second operand 3 states. [2019-09-10 06:57:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:32,737 INFO L93 Difference]: Finished difference Result 104176 states and 140604 transitions. [2019-09-10 06:57:32,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:32,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 06:57:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:32,894 INFO L225 Difference]: With dead ends: 104176 [2019-09-10 06:57:32,894 INFO L226 Difference]: Without dead ends: 88633 [2019-09-10 06:57:32,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88633 states. [2019-09-10 06:57:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88633 to 83151. [2019-09-10 06:57:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83151 states. [2019-09-10 06:57:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83151 states to 83151 states and 112877 transitions. [2019-09-10 06:57:33,629 INFO L78 Accepts]: Start accepts. Automaton has 83151 states and 112877 transitions. Word has length 81 [2019-09-10 06:57:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:33,630 INFO L475 AbstractCegarLoop]: Abstraction has 83151 states and 112877 transitions. [2019-09-10 06:57:33,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 83151 states and 112877 transitions. [2019-09-10 06:57:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:57:33,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:33,645 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:33,646 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1000151721, now seen corresponding path program 1 times [2019-09-10 06:57:33,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:33,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:33,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:33,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:33,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:33,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:33,760 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 06:57:33,762 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 06:57:33,769 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:33,769 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:33,784 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:33,923 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:57:33,924 INFO L272 AbstractInterpreter]: Visited 70 different actions 375 times. Merged at 36 different actions 257 times. Widened at 11 different actions 29 times. Performed 1378 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1378 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 06:57:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:33,925 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:57:34,022 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 81.59% of their original sizes. [2019-09-10 06:57:34,022 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:57:36,367 INFO L420 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2019-09-10 06:57:36,368 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:57:36,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:57:36,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [7] total 53 [2019-09-10 06:57:36,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:36,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 06:57:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 06:57:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1997, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:57:36,369 INFO L87 Difference]: Start difference. First operand 83151 states and 112877 transitions. Second operand 48 states. [2019-09-10 06:58:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:12,460 INFO L93 Difference]: Finished difference Result 136852 states and 186226 transitions. [2019-09-10 06:58:12,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-10 06:58:12,461 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 81 [2019-09-10 06:58:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:12,679 INFO L225 Difference]: With dead ends: 136852 [2019-09-10 06:58:12,680 INFO L226 Difference]: Without dead ends: 136852 [2019-09-10 06:58:12,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8344 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3811, Invalid=20369, Unknown=0, NotChecked=0, Total=24180 [2019-09-10 06:58:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136852 states. [2019-09-10 06:58:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136852 to 88582. [2019-09-10 06:58:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88582 states. [2019-09-10 06:58:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88582 states to 88582 states and 119841 transitions. [2019-09-10 06:58:14,040 INFO L78 Accepts]: Start accepts. Automaton has 88582 states and 119841 transitions. Word has length 81 [2019-09-10 06:58:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:14,040 INFO L475 AbstractCegarLoop]: Abstraction has 88582 states and 119841 transitions. [2019-09-10 06:58:14,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 06:58:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 88582 states and 119841 transitions. [2019-09-10 06:58:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:58:14,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:14,052 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:14,052 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:14,053 INFO L82 PathProgramCache]: Analyzing trace with hash -435344244, now seen corresponding path program 1 times [2019-09-10 06:58:14,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:14,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:14,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:14,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:14,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:14,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:14,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:14,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:14,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:14,110 INFO L87 Difference]: Start difference. First operand 88582 states and 119841 transitions. Second operand 3 states. [2019-09-10 06:58:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:14,399 INFO L93 Difference]: Finished difference Result 136499 states and 182880 transitions. [2019-09-10 06:58:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:14,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 06:58:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:14,576 INFO L225 Difference]: With dead ends: 136499 [2019-09-10 06:58:14,577 INFO L226 Difference]: Without dead ends: 135952 [2019-09-10 06:58:14,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135952 states. [2019-09-10 06:58:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135952 to 135783. [2019-09-10 06:58:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135783 states. [2019-09-10 06:58:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135783 states to 135783 states and 181971 transitions. [2019-09-10 06:58:15,734 INFO L78 Accepts]: Start accepts. Automaton has 135783 states and 181971 transitions. Word has length 81 [2019-09-10 06:58:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:15,735 INFO L475 AbstractCegarLoop]: Abstraction has 135783 states and 181971 transitions. [2019-09-10 06:58:15,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 135783 states and 181971 transitions. [2019-09-10 06:58:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:58:15,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:15,748 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:15,748 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash -308441745, now seen corresponding path program 1 times [2019-09-10 06:58:15,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:15,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:15,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:58:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:15,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:58:15,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:15,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:58:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:58:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:58:15,807 INFO L87 Difference]: Start difference. First operand 135783 states and 181971 transitions. Second operand 5 states. [2019-09-10 06:58:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:17,082 INFO L93 Difference]: Finished difference Result 187229 states and 248410 transitions. [2019-09-10 06:58:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:17,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 06:58:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:17,355 INFO L225 Difference]: With dead ends: 187229 [2019-09-10 06:58:17,355 INFO L226 Difference]: Without dead ends: 187229 [2019-09-10 06:58:17,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:58:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187229 states. [2019-09-10 06:58:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187229 to 135718. [2019-09-10 06:58:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135718 states. [2019-09-10 06:58:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135718 states to 135718 states and 180812 transitions. [2019-09-10 06:58:18,855 INFO L78 Accepts]: Start accepts. Automaton has 135718 states and 180812 transitions. Word has length 82 [2019-09-10 06:58:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:18,856 INFO L475 AbstractCegarLoop]: Abstraction has 135718 states and 180812 transitions. [2019-09-10 06:58:18,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:58:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 135718 states and 180812 transitions. [2019-09-10 06:58:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:58:18,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:18,868 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:18,869 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1384260372, now seen corresponding path program 1 times [2019-09-10 06:58:18,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:18,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:18,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:18,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:18,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:58:18,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 06:58:18,966 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [327], [330], [338], [341], [344], [347], [349], [351], [388], [389], [393], [394], [395] [2019-09-10 06:58:18,968 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:58:18,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:58:18,981 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:58:19,098 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:58:19,098 INFO L272 AbstractInterpreter]: Visited 71 different actions 332 times. Merged at 37 different actions 220 times. Widened at 12 different actions 24 times. Performed 1191 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1191 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 06:58:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:19,099 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:58:19,217 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 80.79% of their original sizes. [2019-09-10 06:58:19,218 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:58:21,554 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 06:58:21,555 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:58:21,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:58:21,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 06:58:21,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:21,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 06:58:21,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 06:58:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1914, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:58:21,557 INFO L87 Difference]: Start difference. First operand 135718 states and 180812 transitions. Second operand 47 states. [2019-09-10 06:59:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:01,891 INFO L93 Difference]: Finished difference Result 220718 states and 294811 transitions. [2019-09-10 06:59:01,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-10 06:59:01,891 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 82 [2019-09-10 06:59:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:02,185 INFO L225 Difference]: With dead ends: 220718 [2019-09-10 06:59:02,185 INFO L226 Difference]: Without dead ends: 220700 [2019-09-10 06:59:02,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9480 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=4033, Invalid=24697, Unknown=0, NotChecked=0, Total=28730 [2019-09-10 06:59:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220700 states. [2019-09-10 06:59:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220700 to 139386. [2019-09-10 06:59:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139386 states. [2019-09-10 06:59:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139386 states to 139386 states and 185213 transitions. [2019-09-10 06:59:04,166 INFO L78 Accepts]: Start accepts. Automaton has 139386 states and 185213 transitions. Word has length 82 [2019-09-10 06:59:04,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:04,167 INFO L475 AbstractCegarLoop]: Abstraction has 139386 states and 185213 transitions. [2019-09-10 06:59:04,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 06:59:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 139386 states and 185213 transitions. [2019-09-10 06:59:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:59:04,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:04,179 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:04,180 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:04,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:04,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1699364015, now seen corresponding path program 1 times [2019-09-10 06:59:04,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:04,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:04,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:04,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:04,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:59:04,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 06:59:04,263 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [235], [238], [241], [243], [245], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 06:59:04,265 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:59:04,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:59:04,278 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:59:04,462 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:59:04,463 INFO L272 AbstractInterpreter]: Visited 72 different actions 398 times. Merged at 38 different actions 277 times. Widened at 13 different actions 38 times. Performed 1405 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 12 different actions. Largest state had 122 variables. [2019-09-10 06:59:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:04,463 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:59:04,566 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 82.49% of their original sizes. [2019-09-10 06:59:04,567 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:59:07,079 INFO L420 sIntCurrentIteration]: We unified 82 AI predicates to 82 [2019-09-10 06:59:07,080 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:59:07,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:59:07,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [7] total 53 [2019-09-10 06:59:07,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:07,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 06:59:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 06:59:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1991, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:59:07,082 INFO L87 Difference]: Start difference. First operand 139386 states and 185213 transitions. Second operand 48 states. [2019-09-10 07:00:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:15,777 INFO L93 Difference]: Finished difference Result 253808 states and 335126 transitions. [2019-09-10 07:00:15,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 398 states. [2019-09-10 07:00:15,777 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 83 [2019-09-10 07:00:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:16,136 INFO L225 Difference]: With dead ends: 253808 [2019-09-10 07:00:16,137 INFO L226 Difference]: Without dead ends: 253808 [2019-09-10 07:00:16,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76495 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=19638, Invalid=158024, Unknown=0, NotChecked=0, Total=177662 [2019-09-10 07:00:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253808 states. [2019-09-10 07:00:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253808 to 153743. [2019-09-10 07:00:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153743 states. [2019-09-10 07:00:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153743 states to 153743 states and 203431 transitions. [2019-09-10 07:00:18,305 INFO L78 Accepts]: Start accepts. Automaton has 153743 states and 203431 transitions. Word has length 83 [2019-09-10 07:00:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:18,305 INFO L475 AbstractCegarLoop]: Abstraction has 153743 states and 203431 transitions. [2019-09-10 07:00:18,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 07:00:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 153743 states and 203431 transitions. [2019-09-10 07:00:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:18,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:18,315 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:18,315 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash 220913166, now seen corresponding path program 1 times [2019-09-10 07:00:18,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:18,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:18,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:00:18,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:18,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:18,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:18,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:18,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:18,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:18,404 INFO L87 Difference]: Start difference. First operand 153743 states and 203431 transitions. Second operand 6 states. [2019-09-10 07:00:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:19,069 INFO L93 Difference]: Finished difference Result 254847 states and 343290 transitions. [2019-09-10 07:00:19,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:00:19,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 07:00:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:19,372 INFO L225 Difference]: With dead ends: 254847 [2019-09-10 07:00:19,373 INFO L226 Difference]: Without dead ends: 254834 [2019-09-10 07:00:19,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254834 states. [2019-09-10 07:00:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254834 to 193663. [2019-09-10 07:00:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193663 states. [2019-09-10 07:00:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193663 states to 193663 states and 257711 transitions. [2019-09-10 07:00:24,837 INFO L78 Accepts]: Start accepts. Automaton has 193663 states and 257711 transitions. Word has length 83 [2019-09-10 07:00:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:24,838 INFO L475 AbstractCegarLoop]: Abstraction has 193663 states and 257711 transitions. [2019-09-10 07:00:24,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 193663 states and 257711 transitions. [2019-09-10 07:00:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:24,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:24,847 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:24,847 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash -424895373, now seen corresponding path program 1 times [2019-09-10 07:00:24,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:24,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:24,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:24,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:24,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:24,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:00:24,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:00:24,928 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 07:00:24,928 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 07:00:24,930 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:00:24,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:00:24,941 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:00:25,097 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:00:25,098 INFO L272 AbstractInterpreter]: Visited 72 different actions 418 times. Merged at 38 different actions 294 times. Widened at 13 different actions 49 times. Performed 1444 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1444 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 11 different actions. Largest state had 122 variables. [2019-09-10 07:00:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:25,098 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:00:25,215 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 82.28% of their original sizes. [2019-09-10 07:00:25,216 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:00:27,909 INFO L420 sIntCurrentIteration]: We unified 82 AI predicates to 82 [2019-09-10 07:00:27,910 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:00:27,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:00:27,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 07:00:27,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:27,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 07:00:27,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 07:00:27,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2089, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:00:27,911 INFO L87 Difference]: Start difference. First operand 193663 states and 257711 transitions. Second operand 49 states. [2019-09-10 07:01:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:54,039 INFO L93 Difference]: Finished difference Result 319349 states and 423782 transitions. [2019-09-10 07:01:54,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 456 states. [2019-09-10 07:01:54,040 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 83 [2019-09-10 07:01:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:54,419 INFO L225 Difference]: With dead ends: 319349 [2019-09-10 07:01:54,419 INFO L226 Difference]: Without dead ends: 319349 [2019-09-10 07:01:54,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99029 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=25024, Invalid=205856, Unknown=0, NotChecked=0, Total=230880 [2019-09-10 07:01:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319349 states. [2019-09-10 07:01:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319349 to 205816. [2019-09-10 07:01:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205816 states. [2019-09-10 07:01:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205816 states to 205816 states and 272444 transitions. [2019-09-10 07:01:57,404 INFO L78 Accepts]: Start accepts. Automaton has 205816 states and 272444 transitions. Word has length 83 [2019-09-10 07:01:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:57,404 INFO L475 AbstractCegarLoop]: Abstraction has 205816 states and 272444 transitions. [2019-09-10 07:01:57,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 07:01:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 205816 states and 272444 transitions. [2019-09-10 07:01:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:01:57,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:57,417 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:57,417 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash 847024215, now seen corresponding path program 1 times [2019-09-10 07:01:57,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:57,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:57,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:01:57,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:57,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:57,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:57,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:57,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:57,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:57,499 INFO L87 Difference]: Start difference. First operand 205816 states and 272444 transitions. Second operand 6 states. [2019-09-10 07:01:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:58,229 INFO L93 Difference]: Finished difference Result 293667 states and 394288 transitions. [2019-09-10 07:01:58,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:58,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 07:01:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:58,590 INFO L225 Difference]: With dead ends: 293667 [2019-09-10 07:01:58,590 INFO L226 Difference]: Without dead ends: 293667 [2019-09-10 07:01:58,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293667 states. [2019-09-10 07:02:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293667 to 232496. [2019-09-10 07:02:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232496 states. [2019-09-10 07:02:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232496 states to 232496 states and 308844 transitions. [2019-09-10 07:02:05,461 INFO L78 Accepts]: Start accepts. Automaton has 232496 states and 308844 transitions. Word has length 83 [2019-09-10 07:02:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:05,462 INFO L475 AbstractCegarLoop]: Abstraction has 232496 states and 308844 transitions. [2019-09-10 07:02:05,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:02:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 232496 states and 308844 transitions. [2019-09-10 07:02:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:02:05,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:05,477 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:05,477 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1053499643, now seen corresponding path program 1 times [2019-09-10 07:02:05,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:05,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:05,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:05,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 07:02:05,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:05,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:02:05,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:05,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:02:05,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:02:05,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:02:05,550 INFO L87 Difference]: Start difference. First operand 232496 states and 308844 transitions. Second operand 6 states. [2019-09-10 07:02:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:07,028 INFO L93 Difference]: Finished difference Result 333385 states and 448187 transitions. [2019-09-10 07:02:07,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:02:07,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:02:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:07,490 INFO L225 Difference]: With dead ends: 333385 [2019-09-10 07:02:07,490 INFO L226 Difference]: Without dead ends: 333011 [2019-09-10 07:02:07,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333011 states. [2019-09-10 07:02:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333011 to 268298. [2019-09-10 07:02:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268298 states. [2019-09-10 07:02:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268298 states to 268298 states and 357621 transitions. [2019-09-10 07:02:17,441 INFO L78 Accepts]: Start accepts. Automaton has 268298 states and 357621 transitions. Word has length 84 [2019-09-10 07:02:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:17,442 INFO L475 AbstractCegarLoop]: Abstraction has 268298 states and 357621 transitions. [2019-09-10 07:02:17,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:02:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 268298 states and 357621 transitions. [2019-09-10 07:02:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:02:17,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:17,454 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:17,454 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:17,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:17,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1947684294, now seen corresponding path program 1 times [2019-09-10 07:02:17,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:17,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:17,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:17,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:17,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:17,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:02:17,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:02:17,525 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:02:17,525 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [288], [291], [294], [296], [298], [327], [330], [338], [341], [344], [347], [349], [351], [388], [389], [393], [394], [395] [2019-09-10 07:02:17,527 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:02:17,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:02:17,541 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:02:17,680 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:02:17,680 INFO L272 AbstractInterpreter]: Visited 73 different actions 387 times. Merged at 39 different actions 266 times. Widened at 15 different actions 40 times. Performed 1414 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1414 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 122 variables. [2019-09-10 07:02:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:17,681 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:02:17,776 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.22% of their original sizes. [2019-09-10 07:02:17,776 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:02:20,209 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 07:02:20,209 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:02:20,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:02:20,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 07:02:20,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:20,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 07:02:20,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 07:02:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2085, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:02:20,211 INFO L87 Difference]: Start difference. First operand 268298 states and 357621 transitions. Second operand 49 states. [2019-09-10 07:03:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:03,871 INFO L93 Difference]: Finished difference Result 414519 states and 554145 transitions. [2019-09-10 07:03:03,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-09-10 07:03:03,871 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 84 [2019-09-10 07:03:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:04,533 INFO L225 Difference]: With dead ends: 414519 [2019-09-10 07:03:04,533 INFO L226 Difference]: Without dead ends: 414510 [2019-09-10 07:03:04,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17006 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=6385, Invalid=40487, Unknown=0, NotChecked=0, Total=46872 [2019-09-10 07:03:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414510 states. [2019-09-10 07:03:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414510 to 274549. [2019-09-10 07:03:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274549 states. [2019-09-10 07:03:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274549 states to 274549 states and 365629 transitions. [2019-09-10 07:03:08,986 INFO L78 Accepts]: Start accepts. Automaton has 274549 states and 365629 transitions. Word has length 84 [2019-09-10 07:03:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:08,986 INFO L475 AbstractCegarLoop]: Abstraction has 274549 states and 365629 transitions. [2019-09-10 07:03:08,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 07:03:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 274549 states and 365629 transitions. [2019-09-10 07:03:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:03:08,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:08,998 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:08,998 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash 820327874, now seen corresponding path program 1 times [2019-09-10 07:03:08,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:08,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:08,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:09,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:09,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:03:09,083 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:03:09,083 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [327], [330], [338], [341], [344], [347], [349], [351], [388], [389], [393], [394], [395] [2019-09-10 07:03:09,086 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:03:09,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:03:09,097 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:03:09,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:03:09,218 INFO L272 AbstractInterpreter]: Visited 73 different actions 367 times. Merged at 39 different actions 250 times. Widened at 14 different actions 33 times. Performed 1320 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 11 different actions. Largest state had 122 variables. [2019-09-10 07:03:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:09,219 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:03:09,295 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.36% of their original sizes. [2019-09-10 07:03:09,295 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:03:11,705 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 07:03:11,705 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:03:11,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:03:11,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [7] total 53 [2019-09-10 07:03:11,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:11,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 07:03:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 07:03:11,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1985, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 07:03:11,707 INFO L87 Difference]: Start difference. First operand 274549 states and 365629 transitions. Second operand 48 states. [2019-09-10 07:03:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:48,995 INFO L93 Difference]: Finished difference Result 421245 states and 562669 transitions. [2019-09-10 07:03:48,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2019-09-10 07:03:48,995 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 84 [2019-09-10 07:03:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:50,189 INFO L225 Difference]: With dead ends: 421245 [2019-09-10 07:03:50,189 INFO L226 Difference]: Without dead ends: 421245 [2019-09-10 07:03:50,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15989 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=5893, Invalid=38839, Unknown=0, NotChecked=0, Total=44732 [2019-09-10 07:03:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421245 states. [2019-09-10 07:03:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421245 to 279438. [2019-09-10 07:03:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279438 states. [2019-09-10 07:03:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279438 states to 279438 states and 371725 transitions. [2019-09-10 07:03:54,367 INFO L78 Accepts]: Start accepts. Automaton has 279438 states and 371725 transitions. Word has length 84 [2019-09-10 07:03:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:54,367 INFO L475 AbstractCegarLoop]: Abstraction has 279438 states and 371725 transitions. [2019-09-10 07:03:54,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 07:03:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 279438 states and 371725 transitions. [2019-09-10 07:03:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:03:54,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:54,378 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:54,378 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1303931514, now seen corresponding path program 1 times [2019-09-10 07:03:54,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:54,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:54,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:54,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:54,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:03:54,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:54,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:54,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:54,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:54,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:54,456 INFO L87 Difference]: Start difference. First operand 279438 states and 371725 transitions. Second operand 6 states. [2019-09-10 07:03:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:56,500 INFO L93 Difference]: Finished difference Result 376615 states and 505763 transitions. [2019-09-10 07:03:56,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:03:56,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:03:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:56,990 INFO L225 Difference]: With dead ends: 376615 [2019-09-10 07:03:56,991 INFO L226 Difference]: Without dead ends: 376337 [2019-09-10 07:03:56,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376337 states. [2019-09-10 07:04:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376337 to 302720. [2019-09-10 07:04:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302720 states. [2019-09-10 07:04:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302720 states to 302720 states and 403445 transitions. [2019-09-10 07:04:06,181 INFO L78 Accepts]: Start accepts. Automaton has 302720 states and 403445 transitions. Word has length 84 [2019-09-10 07:04:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:06,181 INFO L475 AbstractCegarLoop]: Abstraction has 302720 states and 403445 transitions. [2019-09-10 07:04:06,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:04:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 302720 states and 403445 transitions. [2019-09-10 07:04:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:04:06,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:06,195 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:06,195 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash 958369169, now seen corresponding path program 1 times [2019-09-10 07:04:06,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:06,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:06,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:06,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:06,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:06,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:04:06,269 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2019-09-10 07:04:06,269 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 07:04:06,271 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:04:06,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:04:06,282 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:04:06,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:04:06,403 INFO L272 AbstractInterpreter]: Visited 76 different actions 380 times. Merged at 42 different actions 262 times. Widened at 12 different actions 18 times. Performed 1342 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1342 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 12 different actions. Largest state had 122 variables. [2019-09-10 07:04:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:06,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:04:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:06,404 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) [2019-09-10 07:04:06,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:06,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:04:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:06,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:04:06,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:04:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:06,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:04:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:06,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:04:06,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 07:04:06,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:04:06,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:04:06,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:04:06,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:04:06,676 INFO L87 Difference]: Start difference. First operand 302720 states and 403445 transitions. Second operand 11 states. [2019-09-10 07:04:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:13,741 INFO L93 Difference]: Finished difference Result 538651 states and 711694 transitions. [2019-09-10 07:04:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:04:13,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-09-10 07:04:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:14,586 INFO L225 Difference]: With dead ends: 538651 [2019-09-10 07:04:14,586 INFO L226 Difference]: Without dead ends: 538651 [2019-09-10 07:04:14,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:04:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538651 states. [2019-09-10 07:04:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538651 to 324981. [2019-09-10 07:04:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324981 states. [2019-09-10 07:04:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324981 states to 324981 states and 433270 transitions. [2019-09-10 07:04:19,129 INFO L78 Accepts]: Start accepts. Automaton has 324981 states and 433270 transitions. Word has length 86 [2019-09-10 07:04:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:19,129 INFO L475 AbstractCegarLoop]: Abstraction has 324981 states and 433270 transitions. [2019-09-10 07:04:19,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:04:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 324981 states and 433270 transitions. [2019-09-10 07:04:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:04:19,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:19,144 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:19,144 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash -768347175, now seen corresponding path program 1 times [2019-09-10 07:04:19,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:19,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:19,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:19,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:19,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:04:19,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-10 07:04:19,222 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [327], [330], [338], [341], [344], [347], [349], [351], [388], [389], [393], [394], [395] [2019-09-10 07:04:19,224 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:04:19,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:04:19,235 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:04:19,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:04:19,397 INFO L272 AbstractInterpreter]: Visited 77 different actions 428 times. Merged at 45 different actions 304 times. Widened at 12 different actions 35 times. Performed 1450 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1450 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 10 different actions. Largest state had 122 variables. [2019-09-10 07:04:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:19,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:04:19,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:19,397 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:04:19,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:19,430 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:04:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:19,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:04:19,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:04:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:19,621 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:04:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:19,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:04:19,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 07:04:19,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:04:19,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:04:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:04:19,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:04:19,693 INFO L87 Difference]: Start difference. First operand 324981 states and 433270 transitions. Second operand 11 states. [2019-09-10 07:04:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:25,523 INFO L93 Difference]: Finished difference Result 618115 states and 819327 transitions. [2019-09-10 07:04:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:04:25,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 07:04:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:26,574 INFO L225 Difference]: With dead ends: 618115 [2019-09-10 07:04:26,575 INFO L226 Difference]: Without dead ends: 618115 [2019-09-10 07:04:26,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:04:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618115 states. [2019-09-10 07:04:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618115 to 362527. [2019-09-10 07:04:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362527 states. [2019-09-10 07:04:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362527 states to 362527 states and 483762 transitions. [2019-09-10 07:04:36,410 INFO L78 Accepts]: Start accepts. Automaton has 362527 states and 483762 transitions. Word has length 87 [2019-09-10 07:04:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:36,410 INFO L475 AbstractCegarLoop]: Abstraction has 362527 states and 483762 transitions. [2019-09-10 07:04:36,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:04:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 362527 states and 483762 transitions. [2019-09-10 07:04:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:04:36,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:36,432 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:36,432 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1767745621, now seen corresponding path program 1 times [2019-09-10 07:04:36,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:36,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:36,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:36,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:36,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:36,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:36,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:04:36,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2019-09-10 07:04:36,506 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [182], [185], [188], [190], [192], [221], [224], [232], [235], [238], [241], [243], [245], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 07:04:36,509 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:04:36,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:04:36,521 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:04:36,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:04:36,690 INFO L272 AbstractInterpreter]: Visited 78 different actions 472 times. Merged at 44 different actions 336 times. Widened at 17 different actions 44 times. Performed 1619 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1619 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 13 different actions. Largest state had 123 variables. [2019-09-10 07:04:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:36,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:04:36,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:36,691 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:04:37,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:37,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:04:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:37,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:04:37,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:04:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:38,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:04:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:38,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:04:38,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 07:04:38,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:04:38,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:04:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:04:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:04:38,143 INFO L87 Difference]: Start difference. First operand 362527 states and 483762 transitions. Second operand 11 states. [2019-09-10 07:04:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:39,904 INFO L93 Difference]: Finished difference Result 554286 states and 738124 transitions. [2019-09-10 07:04:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:04:39,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-09-10 07:04:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:40,799 INFO L225 Difference]: With dead ends: 554286 [2019-09-10 07:04:40,799 INFO L226 Difference]: Without dead ends: 554286 [2019-09-10 07:04:40,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 168 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:04:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554286 states. [2019-09-10 07:04:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554286 to 362066. [2019-09-10 07:04:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362066 states. [2019-09-10 07:04:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362066 states to 362066 states and 483644 transitions. [2019-09-10 07:04:55,342 INFO L78 Accepts]: Start accepts. Automaton has 362066 states and 483644 transitions. Word has length 88 [2019-09-10 07:04:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:55,342 INFO L475 AbstractCegarLoop]: Abstraction has 362066 states and 483644 transitions. [2019-09-10 07:04:55,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:04:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 362066 states and 483644 transitions. [2019-09-10 07:04:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:04:55,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:55,361 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:55,361 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:55,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1641287711, now seen corresponding path program 1 times [2019-09-10 07:04:55,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:55,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:55,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:55,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:55,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:55,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:55,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:04:55,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2019-09-10 07:04:55,568 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [388], [389], [393], [394], [395] [2019-09-10 07:04:55,571 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:04:55,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:04:55,579 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:04:55,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:04:55,814 INFO L272 AbstractInterpreter]: Visited 82 different actions 617 times. Merged at 51 different actions 468 times. Widened at 17 different actions 80 times. Performed 2137 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 47 fixpoints after 15 different actions. Largest state had 123 variables. [2019-09-10 07:04:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:55,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:04:55,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:55,815 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:04:55,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:55,835 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:04:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:55,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 07:04:55,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:04:56,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:04:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:57,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:04:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:57,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:04:57,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 15] total 40 [2019-09-10 07:04:57,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:04:57,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 07:04:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 07:04:57,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1413, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:04:57,988 INFO L87 Difference]: Start difference. First operand 362066 states and 483644 transitions. Second operand 27 states. [2019-09-10 07:05:01,085 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 07:05:03,030 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-10 07:05:03,191 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 07:05:07,321 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:05:07,674 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:05:08,036 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:05:08,273 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:05:08,598 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 07:05:08,993 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:05:11,950 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 07:05:13,007 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:05:15,616 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:05:19,395 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:05:19,559 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:05:19,846 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 07:05:20,843 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:05:22,043 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:05:22,253 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:05:22,759 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:05:23,040 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:05:23,314 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:05:23,556 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:05:23,761 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:05:25,081 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:05:26,743 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:05:26,937 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:05:27,276 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:05:27,539 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:05:29,048 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:05:29,493 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:05:29,744 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:05:30,655 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:05:32,283 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:05:32,615 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:05:32,813 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:05:34,588 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:05:34,753 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:05:35,002 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:05:35,556 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:05:36,674 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 07:05:37,274 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:05:37,742 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:05:38,599 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:05:38,835 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:05:39,181 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:05:40,802 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:05:40,951 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:05:41,526 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:05:42,121 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:05:42,371 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:05:43,164 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:05:43,705 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:05:45,725 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:05:46,258 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:05:46,418 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:05:47,023 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:05:47,650 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:05:47,956 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:05:50,168 WARN L188 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:05:51,235 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:05:51,501 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:05:51,954 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:05:52,190 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:05:52,727 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:05:54,992 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:05:55,203 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:05:55,588 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:05:55,938 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:05:57,056 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:05:57,294 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:05:57,581 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:05:57,840 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:05:58,041 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:05:58,533 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:05:58,732 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:05:59,045 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:05:59,506 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:05:59,730 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:06:00,971 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:06:01,148 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:06:01,324 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:06:01,732 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:06:02,779 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:06:02,998 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:06:03,187 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:06:03,402 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:06:03,627 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:06:03,967 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:06:04,283 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:06:04,739 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:06:04,927 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:06:05,461 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:06:05,990 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 07:06:06,842 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:06:07,217 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:06:07,619 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:06:08,262 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:06:08,907 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:06:09,074 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:06:09,297 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:06:09,718 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:06:10,536 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:06:10,819 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:06:11,173 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:06:11,405 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:06:11,676 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:06:11,972 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:06:12,137 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:06:12,306 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:06:12,793 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:06:13,103 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:06:15,060 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:06:15,407 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:06:15,831 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:06:16,145 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 07:06:16,704 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 07:06:16,891 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:06:17,057 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:06:17,271 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:06:17,526 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:06:18,066 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:06:18,429 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:06:19,351 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:06:19,635 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 07:06:20,056 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:06:20,331 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:06:20,538 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:06:20,718 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:06:21,526 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:06:22,430 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:06:23,026 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:06:23,345 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:06:23,582 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:06:23,814 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:06:24,036 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:06:24,658 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:06:24,872 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:06:25,502 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:06:25,739 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:06:26,006 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:06:26,215 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:06:26,556 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:06:26,757 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:06:27,501 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:06:27,713 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:06:28,413 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:06:29,353 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:06:29,570 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:06:30,018 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:06:33,971 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:06:35,412 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:06:42,677 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:06:42,881 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:06:44,260 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:06:44,478 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:06:45,382 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:06:45,736 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:06:46,719 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:06:47,034 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:06:48,284 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:06:49,694 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:06:50,039 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:06:50,569 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:06:51,141 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:06:51,541 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:06:53,409 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:06:53,877 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:06:54,253 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:06:55,292 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:06:55,609 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:06:56,032 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:06:56,426 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:06:56,913 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:06:57,173 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:06:57,780 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:06:58,260 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 07:06:58,546 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:06:58,748 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:06:59,565 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 07:07:00,312 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:07:00,468 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:07:00,735 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:07:01,319 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:07:01,739 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:07:02,464 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:07:03,391 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:07:03,668 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:07:03,953 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:07:04,192 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:07:04,994 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:07:05,191 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:07:05,547 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:07:06,450 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:07:06,890 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:07:07,928 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:07:08,711 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:07:09,275 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:07:09,843 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 07:07:10,059 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:07:10,727 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:07:10,990 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:07:11,607 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:07:11,961 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:07:12,655 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:07:12,856 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:07:13,369 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:07:13,664 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:07:14,773 WARN L188 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 07:07:16,481 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:07:16,733 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:07:16,937 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:07:17,517 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:07:17,922 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:07:18,265 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:07:18,501 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:07:19,045 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:07:19,336 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48