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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:51:59,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:51:59,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:51:59,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:51:59,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:51:59,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:51:59,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:51:59,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:51:59,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:51:59,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:51:59,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:51:59,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:51:59,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:51:59,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:51:59,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:51:59,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:51:59,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:51:59,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:51:59,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:51:59,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:51:59,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:51:59,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:51:59,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:51:59,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:51:59,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:51:59,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:51:59,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:51:59,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:51:59,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:51:59,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:51:59,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:51:59,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:51:59,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:51:59,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:51:59,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:51:59,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:51:59,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:51:59,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:51:59,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:51:59,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:51:59,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:51:59,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:51:59,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:51:59,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:51:59,351 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:51:59,351 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:51:59,352 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:51:59,352 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:51:59,352 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:51:59,352 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:51:59,353 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:51:59,353 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:51:59,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:51:59,354 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:51:59,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:51:59,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:51:59,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:51:59,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:51:59,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:51:59,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:51:59,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:51:59,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:51:59,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:51:59,357 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:51:59,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:51:59,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:51:59,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:51:59,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:51:59,358 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:51:59,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:51:59,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:51:59,359 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:51:59,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:51:59,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:51:59,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:51:59,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:51:59,425 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:51:59,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:51:59,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98eb61d/d281d117a2d0420eb5fcc17807f075cb/FLAG47e40229e [2019-09-10 07:51:59,969 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:51:59,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:51:59,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98eb61d/d281d117a2d0420eb5fcc17807f075cb/FLAG47e40229e [2019-09-10 07:52:00,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98eb61d/d281d117a2d0420eb5fcc17807f075cb [2019-09-10 07:52:00,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:52:00,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:52:00,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:52:00,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:52:00,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:52:00,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5c22f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00, skipping insertion in model container [2019-09-10 07:52:00,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,312 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:52:00,367 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:52:00,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:52:00,810 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:52:00,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:52:00,936 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:52:00,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00 WrapperNode [2019-09-10 07:52:00,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:52:00,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:52:00,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:52:00,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:52:00,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (1/1) ... [2019-09-10 07:52:00,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:52:00,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:52:00,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:52:00,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:52:00,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:52:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:52:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:52:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:52:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:52:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:52:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:52:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:52:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:52:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:52:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:52:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:52:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:52:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:52:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:52:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:52:01,062 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:52:01,062 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:52:01,062 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:52:01,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:52:01,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:52:01,829 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:52:01,829 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:52:01,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:52:01 BoogieIcfgContainer [2019-09-10 07:52:01,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:52:01,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:52:01,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:52:01,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:52:01,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:52:00" (1/3) ... [2019-09-10 07:52:01,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21910faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:52:01, skipping insertion in model container [2019-09-10 07:52:01,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:00" (2/3) ... [2019-09-10 07:52:01,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21910faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:52:01, skipping insertion in model container [2019-09-10 07:52:01,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:52:01" (3/3) ... [2019-09-10 07:52:01,839 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:52:01,849 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:52:01,858 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:52:01,874 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:52:01,898 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:52:01,898 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:52:01,898 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:52:01,898 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:52:01,899 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:52:01,899 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:52:01,899 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:52:01,899 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:52:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2019-09-10 07:52:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:52:01,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:01,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:01,936 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:01,942 INFO L82 PathProgramCache]: Analyzing trace with hash 892664727, now seen corresponding path program 1 times [2019-09-10 07:52:01,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:01,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:01,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:01,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:02,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:02,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:02,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:02,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:02,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:02,450 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2019-09-10 07:52:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:02,581 INFO L93 Difference]: Finished difference Result 196 states and 319 transitions. [2019-09-10 07:52:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:02,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:52:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:02,598 INFO L225 Difference]: With dead ends: 196 [2019-09-10 07:52:02,598 INFO L226 Difference]: Without dead ends: 188 [2019-09-10 07:52:02,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-10 07:52:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-09-10 07:52:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-10 07:52:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2019-09-10 07:52:02,701 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 65 [2019-09-10 07:52:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:02,702 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2019-09-10 07:52:02,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2019-09-10 07:52:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:02,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:02,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:02,710 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash -863027836, now seen corresponding path program 1 times [2019-09-10 07:52:02,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:02,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:02,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:02,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:02,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:02,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:02,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:02,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:02,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:02,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:02,954 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand 5 states. [2019-09-10 07:52:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:03,170 INFO L93 Difference]: Finished difference Result 186 states and 264 transitions. [2019-09-10 07:52:03,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:03,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-10 07:52:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:03,174 INFO L225 Difference]: With dead ends: 186 [2019-09-10 07:52:03,174 INFO L226 Difference]: Without dead ends: 186 [2019-09-10 07:52:03,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-10 07:52:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-09-10 07:52:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-10 07:52:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2019-09-10 07:52:03,214 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 67 [2019-09-10 07:52:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:03,218 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2019-09-10 07:52:03,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2019-09-10 07:52:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:52:03,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:03,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:03,223 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:03,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash -469367140, now seen corresponding path program 1 times [2019-09-10 07:52:03,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:03,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:03,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:03,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:03,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:03,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:03,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:03,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:03,380 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand 5 states. [2019-09-10 07:52:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:03,554 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2019-09-10 07:52:03,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:03,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:52:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:03,558 INFO L225 Difference]: With dead ends: 186 [2019-09-10 07:52:03,558 INFO L226 Difference]: Without dead ends: 186 [2019-09-10 07:52:03,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-10 07:52:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-09-10 07:52:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-10 07:52:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 261 transitions. [2019-09-10 07:52:03,574 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 261 transitions. Word has length 68 [2019-09-10 07:52:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:03,575 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 261 transitions. [2019-09-10 07:52:03,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 261 transitions. [2019-09-10 07:52:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:52:03,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:03,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:03,581 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 299075236, now seen corresponding path program 1 times [2019-09-10 07:52:03,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:03,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:03,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:03,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:52:03,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:03,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:52:03,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:52:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:03,776 INFO L87 Difference]: Start difference. First operand 186 states and 261 transitions. Second operand 6 states. [2019-09-10 07:52:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:03,995 INFO L93 Difference]: Finished difference Result 284 states and 406 transitions. [2019-09-10 07:52:03,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:03,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 07:52:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:04,002 INFO L225 Difference]: With dead ends: 284 [2019-09-10 07:52:04,002 INFO L226 Difference]: Without dead ends: 284 [2019-09-10 07:52:04,002 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 07:52:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-10 07:52:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2019-09-10 07:52:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-10 07:52:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 405 transitions. [2019-09-10 07:52:04,027 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 405 transitions. Word has length 69 [2019-09-10 07:52:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:04,027 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 405 transitions. [2019-09-10 07:52:04,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:52:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 405 transitions. [2019-09-10 07:52:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:04,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:04,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:04,035 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1045896819, now seen corresponding path program 1 times [2019-09-10 07:52:04,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:04,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:04,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:04,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:04,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:04,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:04,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:04,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:04,164 INFO L87 Difference]: Start difference. First operand 282 states and 405 transitions. Second operand 5 states. [2019-09-10 07:52:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:04,316 INFO L93 Difference]: Finished difference Result 282 states and 400 transitions. [2019-09-10 07:52:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:04,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 07:52:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:04,319 INFO L225 Difference]: With dead ends: 282 [2019-09-10 07:52:04,319 INFO L226 Difference]: Without dead ends: 282 [2019-09-10 07:52:04,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-10 07:52:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-10 07:52:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-10 07:52:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 400 transitions. [2019-09-10 07:52:04,332 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 400 transitions. Word has length 70 [2019-09-10 07:52:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:04,333 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 400 transitions. [2019-09-10 07:52:04,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 400 transitions. [2019-09-10 07:52:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:04,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:04,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:04,337 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1929984870, now seen corresponding path program 1 times [2019-09-10 07:52:04,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:04,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:04,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:04,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:04,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:04,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:04,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:04,469 INFO L87 Difference]: Start difference. First operand 282 states and 400 transitions. Second operand 5 states. [2019-09-10 07:52:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:04,560 INFO L93 Difference]: Finished difference Result 563 states and 819 transitions. [2019-09-10 07:52:04,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:04,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:52:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:04,565 INFO L225 Difference]: With dead ends: 563 [2019-09-10 07:52:04,566 INFO L226 Difference]: Without dead ends: 563 [2019-09-10 07:52:04,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-10 07:52:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 376. [2019-09-10 07:52:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-10 07:52:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 543 transitions. [2019-09-10 07:52:04,579 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 543 transitions. Word has length 71 [2019-09-10 07:52:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:04,581 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 543 transitions. [2019-09-10 07:52:04,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 543 transitions. [2019-09-10 07:52:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:04,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:04,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:04,591 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash -165846340, now seen corresponding path program 1 times [2019-09-10 07:52:04,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:04,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:04,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:04,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:04,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:04,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:04,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:04,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:04,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:04,687 INFO L87 Difference]: Start difference. First operand 376 states and 543 transitions. Second operand 5 states. [2019-09-10 07:52:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:04,791 INFO L93 Difference]: Finished difference Result 728 states and 1071 transitions. [2019-09-10 07:52:04,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:04,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:52:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:04,796 INFO L225 Difference]: With dead ends: 728 [2019-09-10 07:52:04,796 INFO L226 Difference]: Without dead ends: 728 [2019-09-10 07:52:04,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-10 07:52:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 598. [2019-09-10 07:52:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 07:52:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 881 transitions. [2019-09-10 07:52:04,818 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 881 transitions. Word has length 71 [2019-09-10 07:52:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:04,819 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 881 transitions. [2019-09-10 07:52:04,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 881 transitions. [2019-09-10 07:52:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:04,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:04,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:04,821 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash -473955093, now seen corresponding path program 1 times [2019-09-10 07:52:04,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:04,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:04,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:04,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:04,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:04,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:04,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:04,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:04,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:04,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:04,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:04,970 INFO L87 Difference]: Start difference. First operand 598 states and 881 transitions. Second operand 5 states. [2019-09-10 07:52:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:05,054 INFO L93 Difference]: Finished difference Result 809 states and 1194 transitions. [2019-09-10 07:52:05,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:05,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:52:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:05,059 INFO L225 Difference]: With dead ends: 809 [2019-09-10 07:52:05,059 INFO L226 Difference]: Without dead ends: 809 [2019-09-10 07:52:05,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-09-10 07:52:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 698. [2019-09-10 07:52:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-09-10 07:52:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1033 transitions. [2019-09-10 07:52:05,080 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1033 transitions. Word has length 71 [2019-09-10 07:52:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:05,080 INFO L475 AbstractCegarLoop]: Abstraction has 698 states and 1033 transitions. [2019-09-10 07:52:05,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1033 transitions. [2019-09-10 07:52:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:05,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:05,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:05,082 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:05,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:05,082 INFO L82 PathProgramCache]: Analyzing trace with hash 500097299, now seen corresponding path program 1 times [2019-09-10 07:52:05,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:05,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:05,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:05,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:05,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:05,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:05,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:05,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:05,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:05,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:05,139 INFO L87 Difference]: Start difference. First operand 698 states and 1033 transitions. Second operand 3 states. [2019-09-10 07:52:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:05,181 INFO L93 Difference]: Finished difference Result 1210 states and 1766 transitions. [2019-09-10 07:52:05,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:05,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 07:52:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:05,188 INFO L225 Difference]: With dead ends: 1210 [2019-09-10 07:52:05,188 INFO L226 Difference]: Without dead ends: 1210 [2019-09-10 07:52:05,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-09-10 07:52:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1184. [2019-09-10 07:52:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-09-10 07:52:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1729 transitions. [2019-09-10 07:52:05,222 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1729 transitions. Word has length 71 [2019-09-10 07:52:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:05,223 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1729 transitions. [2019-09-10 07:52:05,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1729 transitions. [2019-09-10 07:52:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:05,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:05,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:05,225 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 671723250, now seen corresponding path program 1 times [2019-09-10 07:52:05,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:05,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:05,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:05,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:05,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:05,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:05,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:05,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:05,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:05,287 INFO L87 Difference]: Start difference. First operand 1184 states and 1729 transitions. Second operand 3 states. [2019-09-10 07:52:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:05,356 INFO L93 Difference]: Finished difference Result 1186 states and 1726 transitions. [2019-09-10 07:52:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:05,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 07:52:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:05,369 INFO L225 Difference]: With dead ends: 1186 [2019-09-10 07:52:05,369 INFO L226 Difference]: Without dead ends: 1186 [2019-09-10 07:52:05,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-09-10 07:52:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1184. [2019-09-10 07:52:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-09-10 07:52:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1725 transitions. [2019-09-10 07:52:05,416 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1725 transitions. Word has length 71 [2019-09-10 07:52:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:05,417 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1725 transitions. [2019-09-10 07:52:05,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1725 transitions. [2019-09-10 07:52:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:05,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:05,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:05,419 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:05,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1753966399, now seen corresponding path program 1 times [2019-09-10 07:52:05,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:05,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:05,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:05,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:05,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:05,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:05,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:05,548 INFO L87 Difference]: Start difference. First operand 1184 states and 1725 transitions. Second operand 5 states. [2019-09-10 07:52:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:05,693 INFO L93 Difference]: Finished difference Result 2737 states and 4006 transitions. [2019-09-10 07:52:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:05,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:52:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:05,708 INFO L225 Difference]: With dead ends: 2737 [2019-09-10 07:52:05,708 INFO L226 Difference]: Without dead ends: 2737 [2019-09-10 07:52:05,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2019-09-10 07:52:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2637. [2019-09-10 07:52:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-10 07:52:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3869 transitions. [2019-09-10 07:52:05,804 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3869 transitions. Word has length 71 [2019-09-10 07:52:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:05,804 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3869 transitions. [2019-09-10 07:52:05,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3869 transitions. [2019-09-10 07:52:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:52:05,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:05,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:05,806 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1515656525, now seen corresponding path program 1 times [2019-09-10 07:52:05,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:05,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:05,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:05,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:05,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:52:06,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:06,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:52:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:52:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:06,074 INFO L87 Difference]: Start difference. First operand 2637 states and 3869 transitions. Second operand 10 states. [2019-09-10 07:52:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:07,065 INFO L93 Difference]: Finished difference Result 5287 states and 7714 transitions. [2019-09-10 07:52:07,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:52:07,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 07:52:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:07,098 INFO L225 Difference]: With dead ends: 5287 [2019-09-10 07:52:07,099 INFO L226 Difference]: Without dead ends: 5287 [2019-09-10 07:52:07,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:52:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2019-09-10 07:52:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 2637. [2019-09-10 07:52:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-10 07:52:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3863 transitions. [2019-09-10 07:52:07,241 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3863 transitions. Word has length 72 [2019-09-10 07:52:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:07,241 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3863 transitions. [2019-09-10 07:52:07,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:52:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3863 transitions. [2019-09-10 07:52:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:52:07,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:07,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:07,244 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:07,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1460244248, now seen corresponding path program 1 times [2019-09-10 07:52:07,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:07,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:07,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:07,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:07,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:07,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:07,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:52:07,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:07,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:52:07,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:52:07,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:07,495 INFO L87 Difference]: Start difference. First operand 2637 states and 3863 transitions. Second operand 10 states. [2019-09-10 07:52:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:08,214 INFO L93 Difference]: Finished difference Result 5302 states and 7735 transitions. [2019-09-10 07:52:08,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:52:08,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-10 07:52:08,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:08,244 INFO L225 Difference]: With dead ends: 5302 [2019-09-10 07:52:08,244 INFO L226 Difference]: Without dead ends: 5302 [2019-09-10 07:52:08,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:52:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5302 states. [2019-09-10 07:52:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5302 to 2637. [2019-09-10 07:52:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-10 07:52:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3861 transitions. [2019-09-10 07:52:08,351 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3861 transitions. Word has length 73 [2019-09-10 07:52:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:08,352 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3861 transitions. [2019-09-10 07:52:08,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:52:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3861 transitions. [2019-09-10 07:52:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:52:08,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:08,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:08,354 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash 236126643, now seen corresponding path program 1 times [2019-09-10 07:52:08,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:08,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:08,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:08,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:08,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:08,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:08,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:52:08,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:08,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:52:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:52:08,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:08,544 INFO L87 Difference]: Start difference. First operand 2637 states and 3861 transitions. Second operand 9 states. [2019-09-10 07:52:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:09,018 INFO L93 Difference]: Finished difference Result 3906 states and 5725 transitions. [2019-09-10 07:52:09,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 07:52:09,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 07:52:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:09,036 INFO L225 Difference]: With dead ends: 3906 [2019-09-10 07:52:09,036 INFO L226 Difference]: Without dead ends: 3906 [2019-09-10 07:52:09,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:52:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-09-10 07:52:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 2637. [2019-09-10 07:52:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-10 07:52:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3860 transitions. [2019-09-10 07:52:09,138 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3860 transitions. Word has length 73 [2019-09-10 07:52:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:09,139 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3860 transitions. [2019-09-10 07:52:09,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:52:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3860 transitions. [2019-09-10 07:52:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:52:09,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:09,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:09,140 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:09,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1277245649, now seen corresponding path program 1 times [2019-09-10 07:52:09,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:09,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:09,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:09,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:52:09,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:09,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:52:09,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:52:09,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:09,347 INFO L87 Difference]: Start difference. First operand 2637 states and 3860 transitions. Second operand 10 states. [2019-09-10 07:52:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:10,229 INFO L93 Difference]: Finished difference Result 5296 states and 7720 transitions. [2019-09-10 07:52:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:52:10,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-10 07:52:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:10,252 INFO L225 Difference]: With dead ends: 5296 [2019-09-10 07:52:10,252 INFO L226 Difference]: Without dead ends: 5296 [2019-09-10 07:52:10,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:52:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-09-10 07:52:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 2637. [2019-09-10 07:52:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-10 07:52:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3856 transitions. [2019-09-10 07:52:10,327 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3856 transitions. Word has length 74 [2019-09-10 07:52:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:10,327 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3856 transitions. [2019-09-10 07:52:10,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:52:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3856 transitions. [2019-09-10 07:52:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:52:10,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:10,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:10,329 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:10,329 INFO L82 PathProgramCache]: Analyzing trace with hash -484955932, now seen corresponding path program 1 times [2019-09-10 07:52:10,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:10,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:10,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:10,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:10,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:11,145 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:52:11,620 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 07:52:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:12,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:12,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 07:52:12,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:12,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:52:12,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:52:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:52:12,270 INFO L87 Difference]: Start difference. First operand 2637 states and 3856 transitions. Second operand 23 states. [2019-09-10 07:52:12,444 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:52:13,034 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 07:52:13,311 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:52:13,579 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:52:13,884 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 07:52:14,284 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-09-10 07:52:14,822 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2019-09-10 07:52:15,474 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 139 [2019-09-10 07:52:15,793 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 07:52:16,146 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 07:52:16,352 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 07:52:16,754 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 07:52:17,815 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:52:18,168 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 07:52:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:21,211 INFO L93 Difference]: Finished difference Result 26644 states and 39220 transitions. [2019-09-10 07:52:21,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:52:21,212 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2019-09-10 07:52:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:21,265 INFO L225 Difference]: With dead ends: 26644 [2019-09-10 07:52:21,265 INFO L226 Difference]: Without dead ends: 26644 [2019-09-10 07:52:21,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 07:52:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26644 states. [2019-09-10 07:52:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26644 to 2672. [2019-09-10 07:52:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2672 states. [2019-09-10 07:52:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 3901 transitions. [2019-09-10 07:52:21,470 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 3901 transitions. Word has length 75 [2019-09-10 07:52:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:21,471 INFO L475 AbstractCegarLoop]: Abstraction has 2672 states and 3901 transitions. [2019-09-10 07:52:21,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:52:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3901 transitions. [2019-09-10 07:52:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:52:21,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:21,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:21,473 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:21,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1158728316, now seen corresponding path program 1 times [2019-09-10 07:52:21,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:21,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:21,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:23,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:23,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 07:52:23,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:23,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 07:52:23,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 07:52:23,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:52:23,056 INFO L87 Difference]: Start difference. First operand 2672 states and 3901 transitions. Second operand 24 states. [2019-09-10 07:52:23,203 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:52:23,854 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:52:24,005 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:52:24,148 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:52:24,331 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:52:24,585 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:52:24,874 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:52:25,259 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-10 07:52:25,701 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 103 [2019-09-10 07:52:26,229 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2019-09-10 07:52:26,471 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 07:52:26,738 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 07:52:26,983 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 07:52:27,530 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:52:27,991 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 07:52:28,272 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 07:52:28,654 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 07:52:29,932 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 07:52:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:30,317 INFO L93 Difference]: Finished difference Result 12821 states and 18841 transitions. [2019-09-10 07:52:30,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 07:52:30,317 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-10 07:52:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:30,344 INFO L225 Difference]: With dead ends: 12821 [2019-09-10 07:52:30,344 INFO L226 Difference]: Without dead ends: 12821 [2019-09-10 07:52:30,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=538, Invalid=2114, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 07:52:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12821 states. [2019-09-10 07:52:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12821 to 2684. [2019-09-10 07:52:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-09-10 07:52:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3912 transitions. [2019-09-10 07:52:30,449 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3912 transitions. Word has length 75 [2019-09-10 07:52:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:30,450 INFO L475 AbstractCegarLoop]: Abstraction has 2684 states and 3912 transitions. [2019-09-10 07:52:30,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 07:52:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3912 transitions. [2019-09-10 07:52:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:52:30,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:30,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:30,452 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:30,452 INFO L82 PathProgramCache]: Analyzing trace with hash 671297890, now seen corresponding path program 1 times [2019-09-10 07:52:30,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:30,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:30,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:30,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:30,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:31,294 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:52:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:31,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:31,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:52:31,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:31,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:52:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:52:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:52:31,820 INFO L87 Difference]: Start difference. First operand 2684 states and 3912 transitions. Second operand 22 states. [2019-09-10 07:52:32,810 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:52:32,997 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-09-10 07:52:33,258 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 66 [2019-09-10 07:52:33,573 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-09-10 07:52:33,928 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 87 [2019-09-10 07:52:34,137 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:52:34,356 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:52:34,703 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 07:52:34,911 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:52:35,153 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:52:35,512 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:52:35,767 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:52:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:39,177 INFO L93 Difference]: Finished difference Result 12450 states and 18288 transitions. [2019-09-10 07:52:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:52:39,178 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2019-09-10 07:52:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:39,204 INFO L225 Difference]: With dead ends: 12450 [2019-09-10 07:52:39,204 INFO L226 Difference]: Without dead ends: 12450 [2019-09-10 07:52:39,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:52:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12450 states. [2019-09-10 07:52:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12450 to 2685. [2019-09-10 07:52:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2019-09-10 07:52:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3911 transitions. [2019-09-10 07:52:39,324 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3911 transitions. Word has length 75 [2019-09-10 07:52:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:39,324 INFO L475 AbstractCegarLoop]: Abstraction has 2685 states and 3911 transitions. [2019-09-10 07:52:39,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:52:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3911 transitions. [2019-09-10 07:52:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:52:39,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:39,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:39,326 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:39,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash -766941881, now seen corresponding path program 1 times [2019-09-10 07:52:39,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:39,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:39,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:39,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:39,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:39,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:39,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:52:39,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:39,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:52:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:52:39,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:52:39,436 INFO L87 Difference]: Start difference. First operand 2685 states and 3911 transitions. Second operand 4 states. [2019-09-10 07:52:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:39,489 INFO L93 Difference]: Finished difference Result 3816 states and 5529 transitions. [2019-09-10 07:52:39,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:39,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-10 07:52:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:39,496 INFO L225 Difference]: With dead ends: 3816 [2019-09-10 07:52:39,497 INFO L226 Difference]: Without dead ends: 3816 [2019-09-10 07:52:39,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2019-09-10 07:52:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3788. [2019-09-10 07:52:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3788 states. [2019-09-10 07:52:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5502 transitions. [2019-09-10 07:52:39,549 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5502 transitions. Word has length 76 [2019-09-10 07:52:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:39,549 INFO L475 AbstractCegarLoop]: Abstraction has 3788 states and 5502 transitions. [2019-09-10 07:52:39,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:52:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5502 transitions. [2019-09-10 07:52:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:52:39,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:39,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:39,551 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:39,551 INFO L82 PathProgramCache]: Analyzing trace with hash 95389579, now seen corresponding path program 1 times [2019-09-10 07:52:39,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:39,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:39,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:39,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:39,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:39,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:39,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:39,669 INFO L87 Difference]: Start difference. First operand 3788 states and 5502 transitions. Second operand 5 states. [2019-09-10 07:52:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:39,737 INFO L93 Difference]: Finished difference Result 6063 states and 8769 transitions. [2019-09-10 07:52:39,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:52:39,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 07:52:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:39,752 INFO L225 Difference]: With dead ends: 6063 [2019-09-10 07:52:39,752 INFO L226 Difference]: Without dead ends: 6063 [2019-09-10 07:52:39,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:52:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2019-09-10 07:52:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3824. [2019-09-10 07:52:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3824 states. [2019-09-10 07:52:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5526 transitions. [2019-09-10 07:52:39,847 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5526 transitions. Word has length 76 [2019-09-10 07:52:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:39,848 INFO L475 AbstractCegarLoop]: Abstraction has 3824 states and 5526 transitions. [2019-09-10 07:52:39,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5526 transitions. [2019-09-10 07:52:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:52:39,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:39,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:39,850 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash 318042292, now seen corresponding path program 1 times [2019-09-10 07:52:39,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:39,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:39,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:40,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:40,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:52:40,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:40,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:52:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:52:40,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:52:40,488 INFO L87 Difference]: Start difference. First operand 3824 states and 5526 transitions. Second operand 13 states. [2019-09-10 07:52:40,857 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-10 07:52:41,015 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:52:41,179 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:52:41,319 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:52:41,604 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:52:41,879 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 07:52:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:42,172 INFO L93 Difference]: Finished difference Result 14598 states and 21230 transitions. [2019-09-10 07:52:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:42,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-10 07:52:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:42,192 INFO L225 Difference]: With dead ends: 14598 [2019-09-10 07:52:42,192 INFO L226 Difference]: Without dead ends: 14598 [2019-09-10 07:52:42,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:52:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2019-09-10 07:52:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 3785. [2019-09-10 07:52:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3785 states. [2019-09-10 07:52:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5475 transitions. [2019-09-10 07:52:42,318 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5475 transitions. Word has length 76 [2019-09-10 07:52:42,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:42,319 INFO L475 AbstractCegarLoop]: Abstraction has 3785 states and 5475 transitions. [2019-09-10 07:52:42,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:52:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5475 transitions. [2019-09-10 07:52:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:52:42,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:42,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:42,320 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1249654324, now seen corresponding path program 1 times [2019-09-10 07:52:42,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:42,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:42,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:42,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:42,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:43,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:43,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:52:43,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:43,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:52:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:52:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:52:43,188 INFO L87 Difference]: Start difference. First operand 3785 states and 5475 transitions. Second operand 18 states. [2019-09-10 07:52:43,904 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 07:52:44,113 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 07:52:44,349 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 07:52:44,535 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:52:44,954 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:52:45,103 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:52:45,338 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:52:45,602 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:52:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:46,680 INFO L93 Difference]: Finished difference Result 25457 states and 37057 transitions. [2019-09-10 07:52:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:52:46,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2019-09-10 07:52:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:46,708 INFO L225 Difference]: With dead ends: 25457 [2019-09-10 07:52:46,709 INFO L226 Difference]: Without dead ends: 25457 [2019-09-10 07:52:46,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:52:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25457 states. [2019-09-10 07:52:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25457 to 3774. [2019-09-10 07:52:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2019-09-10 07:52:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 5461 transitions. [2019-09-10 07:52:46,927 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 5461 transitions. Word has length 76 [2019-09-10 07:52:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:46,927 INFO L475 AbstractCegarLoop]: Abstraction has 3774 states and 5461 transitions. [2019-09-10 07:52:46,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:52:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 5461 transitions. [2019-09-10 07:52:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:52:46,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:46,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:46,928 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash 58971285, now seen corresponding path program 1 times [2019-09-10 07:52:46,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:46,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:46,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:46,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:46,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:47,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:47,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:52:47,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:47,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:52:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:52:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:52:47,449 INFO L87 Difference]: Start difference. First operand 3774 states and 5461 transitions. Second operand 13 states. [2019-09-10 07:52:47,643 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-09-10 07:52:48,093 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 07:52:48,248 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:52:48,410 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:52:48,737 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 07:52:48,954 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 07:52:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:49,294 INFO L93 Difference]: Finished difference Result 14749 states and 21450 transitions. [2019-09-10 07:52:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:52:49,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-10 07:52:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:49,306 INFO L225 Difference]: With dead ends: 14749 [2019-09-10 07:52:49,306 INFO L226 Difference]: Without dead ends: 14749 [2019-09-10 07:52:49,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:52:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14749 states. [2019-09-10 07:52:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14749 to 3757. [2019-09-10 07:52:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2019-09-10 07:52:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 5439 transitions. [2019-09-10 07:52:49,413 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 5439 transitions. Word has length 76 [2019-09-10 07:52:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:49,414 INFO L475 AbstractCegarLoop]: Abstraction has 3757 states and 5439 transitions. [2019-09-10 07:52:49,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:52:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 5439 transitions. [2019-09-10 07:52:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:52:49,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:49,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:49,415 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -105565103, now seen corresponding path program 1 times [2019-09-10 07:52:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:49,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:49,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:49,869 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-09-10 07:52:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:50,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:52:50,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:50,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:52:50,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:52:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:52:50,310 INFO L87 Difference]: Start difference. First operand 3757 states and 5439 transitions. Second operand 16 states. [2019-09-10 07:52:51,034 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:52:51,163 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:52:51,295 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:52:51,511 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:52:51,640 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:52:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:53,110 INFO L93 Difference]: Finished difference Result 21067 states and 30677 transitions. [2019-09-10 07:52:53,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:52:53,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-09-10 07:52:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:53,129 INFO L225 Difference]: With dead ends: 21067 [2019-09-10 07:52:53,129 INFO L226 Difference]: Without dead ends: 21067 [2019-09-10 07:52:53,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:52:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21067 states. [2019-09-10 07:52:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21067 to 3753. [2019-09-10 07:52:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2019-09-10 07:52:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 5434 transitions. [2019-09-10 07:52:53,228 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 5434 transitions. Word has length 76 [2019-09-10 07:52:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:53,228 INFO L475 AbstractCegarLoop]: Abstraction has 3753 states and 5434 transitions. [2019-09-10 07:52:53,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:52:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 5434 transitions. [2019-09-10 07:52:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:52:53,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:53,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:53,229 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:53,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1372189360, now seen corresponding path program 1 times [2019-09-10 07:52:53,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:53,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:53,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:53,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:53,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:53,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:53,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:52:53,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:53,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:52:53,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:52:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:52:53,856 INFO L87 Difference]: Start difference. First operand 3753 states and 5434 transitions. Second operand 14 states. [2019-09-10 07:52:54,492 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:52:54,669 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:52:54,863 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:52:55,038 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:52:55,209 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:52:55,379 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:52:55,607 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:52:55,754 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:52:55,954 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:52:56,468 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:52:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:56,620 INFO L93 Difference]: Finished difference Result 22005 states and 32032 transitions. [2019-09-10 07:52:56,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:52:56,621 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-09-10 07:52:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:56,638 INFO L225 Difference]: With dead ends: 22005 [2019-09-10 07:52:56,638 INFO L226 Difference]: Without dead ends: 22005 [2019-09-10 07:52:56,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:52:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22005 states. [2019-09-10 07:52:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22005 to 3737. [2019-09-10 07:52:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3737 states. [2019-09-10 07:52:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 5413 transitions. [2019-09-10 07:52:56,752 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 5413 transitions. Word has length 76 [2019-09-10 07:52:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:56,752 INFO L475 AbstractCegarLoop]: Abstraction has 3737 states and 5413 transitions. [2019-09-10 07:52:56,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:52:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 5413 transitions. [2019-09-10 07:52:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:52:56,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:56,753 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:56,754 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:56,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:56,754 INFO L82 PathProgramCache]: Analyzing trace with hash 508032095, now seen corresponding path program 1 times [2019-09-10 07:52:56,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:56,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:56,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:56,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:56,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:58,015 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:52:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:58,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:58,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 07:52:58,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:58,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:52:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:52:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:52:58,586 INFO L87 Difference]: Start difference. First operand 3737 states and 5413 transitions. Second operand 25 states. [2019-09-10 07:52:59,635 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:52:59,833 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:53:00,081 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:53:00,361 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:53:00,658 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:53:01,106 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 102 [2019-09-10 07:53:01,352 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:53:01,607 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 07:53:01,785 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:53:02,025 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:53:02,302 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:53:02,555 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 07:53:02,861 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 07:53:03,079 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:53:03,295 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:53:03,542 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:53:08,219 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:53:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:09,520 INFO L93 Difference]: Finished difference Result 50587 states and 73704 transitions. [2019-09-10 07:53:09,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 07:53:09,521 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-10 07:53:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:09,563 INFO L225 Difference]: With dead ends: 50587 [2019-09-10 07:53:09,564 INFO L226 Difference]: Without dead ends: 50587 [2019-09-10 07:53:09,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=483, Invalid=2273, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 07:53:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50587 states. [2019-09-10 07:53:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50587 to 3741. [2019-09-10 07:53:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3741 states. [2019-09-10 07:53:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5417 transitions. [2019-09-10 07:53:09,807 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5417 transitions. Word has length 77 [2019-09-10 07:53:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:09,807 INFO L475 AbstractCegarLoop]: Abstraction has 3741 states and 5417 transitions. [2019-09-10 07:53:09,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:53:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5417 transitions. [2019-09-10 07:53:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:53:09,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:09,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:09,809 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:09,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:09,809 INFO L82 PathProgramCache]: Analyzing trace with hash 127485420, now seen corresponding path program 1 times [2019-09-10 07:53:09,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:09,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:09,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:09,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:09,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:10,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:10,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:53:10,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:10,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:53:10,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:53:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:53:10,424 INFO L87 Difference]: Start difference. First operand 3741 states and 5417 transitions. Second operand 12 states. [2019-09-10 07:53:10,907 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:53:11,071 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:53:11,245 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:53:11,395 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:53:11,562 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:53:11,697 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 07:53:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:11,943 INFO L93 Difference]: Finished difference Result 10818 states and 15717 transitions. [2019-09-10 07:53:11,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:53:11,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2019-09-10 07:53:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:11,955 INFO L225 Difference]: With dead ends: 10818 [2019-09-10 07:53:11,956 INFO L226 Difference]: Without dead ends: 10818 [2019-09-10 07:53:11,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:53:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2019-09-10 07:53:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 3635. [2019-09-10 07:53:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-09-10 07:53:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5270 transitions. [2019-09-10 07:53:12,045 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5270 transitions. Word has length 78 [2019-09-10 07:53:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:12,046 INFO L475 AbstractCegarLoop]: Abstraction has 3635 states and 5270 transitions. [2019-09-10 07:53:12,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:53:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5270 transitions. [2019-09-10 07:53:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:53:12,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:12,050 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:12,050 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash -607662036, now seen corresponding path program 1 times [2019-09-10 07:53:12,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:12,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:12,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:12,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:12,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:12,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:12,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:12,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:12,218 INFO L87 Difference]: Start difference. First operand 3635 states and 5270 transitions. Second operand 3 states. [2019-09-10 07:53:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:12,261 INFO L93 Difference]: Finished difference Result 6877 states and 9823 transitions. [2019-09-10 07:53:12,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:12,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:53:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:12,271 INFO L225 Difference]: With dead ends: 6877 [2019-09-10 07:53:12,271 INFO L226 Difference]: Without dead ends: 6877 [2019-09-10 07:53:12,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2019-09-10 07:53:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 6555. [2019-09-10 07:53:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6555 states. [2019-09-10 07:53:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6555 states to 6555 states and 9422 transitions. [2019-09-10 07:53:12,379 INFO L78 Accepts]: Start accepts. Automaton has 6555 states and 9422 transitions. Word has length 101 [2019-09-10 07:53:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:12,379 INFO L475 AbstractCegarLoop]: Abstraction has 6555 states and 9422 transitions. [2019-09-10 07:53:12,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 6555 states and 9422 transitions. [2019-09-10 07:53:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:53:12,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:12,381 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:12,381 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 59337062, now seen corresponding path program 1 times [2019-09-10 07:53:12,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:12,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:12,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:12,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:12,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:12,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:12,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:12,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:12,442 INFO L87 Difference]: Start difference. First operand 6555 states and 9422 transitions. Second operand 3 states. [2019-09-10 07:53:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:12,477 INFO L93 Difference]: Finished difference Result 9181 states and 13085 transitions. [2019-09-10 07:53:12,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:12,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:53:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:12,488 INFO L225 Difference]: With dead ends: 9181 [2019-09-10 07:53:12,489 INFO L226 Difference]: Without dead ends: 9181 [2019-09-10 07:53:12,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9181 states. [2019-09-10 07:53:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9181 to 8755. [2019-09-10 07:53:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8755 states. [2019-09-10 07:53:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 12554 transitions. [2019-09-10 07:53:12,608 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 12554 transitions. Word has length 102 [2019-09-10 07:53:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:12,609 INFO L475 AbstractCegarLoop]: Abstraction has 8755 states and 12554 transitions. [2019-09-10 07:53:12,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 12554 transitions. [2019-09-10 07:53:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:53:12,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:12,610 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:12,611 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1237399417, now seen corresponding path program 1 times [2019-09-10 07:53:12,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:12,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:12,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:12,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:12,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:12,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:12,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:12,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:12,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:12,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:12,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:12,680 INFO L87 Difference]: Start difference. First operand 8755 states and 12554 transitions. Second operand 5 states. [2019-09-10 07:53:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:13,016 INFO L93 Difference]: Finished difference Result 19261 states and 26853 transitions. [2019-09-10 07:53:13,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:53:13,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:53:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:13,038 INFO L225 Difference]: With dead ends: 19261 [2019-09-10 07:53:13,039 INFO L226 Difference]: Without dead ends: 19261 [2019-09-10 07:53:13,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19261 states. [2019-09-10 07:53:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19261 to 9295. [2019-09-10 07:53:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9295 states. [2019-09-10 07:53:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9295 states to 9295 states and 13094 transitions. [2019-09-10 07:53:13,210 INFO L78 Accepts]: Start accepts. Automaton has 9295 states and 13094 transitions. Word has length 102 [2019-09-10 07:53:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:13,210 INFO L475 AbstractCegarLoop]: Abstraction has 9295 states and 13094 transitions. [2019-09-10 07:53:13,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9295 states and 13094 transitions. [2019-09-10 07:53:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:53:13,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:13,211 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:13,212 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash 48673997, now seen corresponding path program 1 times [2019-09-10 07:53:13,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:13,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:13,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:13,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:53:13,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:13,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:53:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:53:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:53:13,279 INFO L87 Difference]: Start difference. First operand 9295 states and 13094 transitions. Second operand 5 states. [2019-09-10 07:53:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:13,541 INFO L93 Difference]: Finished difference Result 36481 states and 49505 transitions. [2019-09-10 07:53:13,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:53:13,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:53:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:13,585 INFO L225 Difference]: With dead ends: 36481 [2019-09-10 07:53:13,585 INFO L226 Difference]: Without dead ends: 36481 [2019-09-10 07:53:13,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:53:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36481 states. [2019-09-10 07:53:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36481 to 19363. [2019-09-10 07:53:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19363 states. [2019-09-10 07:53:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19363 states to 19363 states and 26958 transitions. [2019-09-10 07:53:14,299 INFO L78 Accepts]: Start accepts. Automaton has 19363 states and 26958 transitions. Word has length 102 [2019-09-10 07:53:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:14,299 INFO L475 AbstractCegarLoop]: Abstraction has 19363 states and 26958 transitions. [2019-09-10 07:53:14,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:53:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 19363 states and 26958 transitions. [2019-09-10 07:53:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:53:14,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:14,304 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:14,305 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash -598394706, now seen corresponding path program 1 times [2019-09-10 07:53:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:14,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:14,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:14,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:14,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:14,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:14,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:14,368 INFO L87 Difference]: Start difference. First operand 19363 states and 26958 transitions. Second operand 3 states. [2019-09-10 07:53:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:14,486 INFO L93 Difference]: Finished difference Result 36477 states and 49503 transitions. [2019-09-10 07:53:14,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:14,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:53:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:14,535 INFO L225 Difference]: With dead ends: 36477 [2019-09-10 07:53:14,535 INFO L226 Difference]: Without dead ends: 36477 [2019-09-10 07:53:14,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36477 states. [2019-09-10 07:53:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36477 to 26083. [2019-09-10 07:53:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26083 states. [2019-09-10 07:53:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26083 states to 26083 states and 35530 transitions. [2019-09-10 07:53:14,896 INFO L78 Accepts]: Start accepts. Automaton has 26083 states and 35530 transitions. Word has length 126 [2019-09-10 07:53:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:14,896 INFO L475 AbstractCegarLoop]: Abstraction has 26083 states and 35530 transitions. [2019-09-10 07:53:14,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 26083 states and 35530 transitions. [2019-09-10 07:53:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:53:14,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:14,902 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:14,902 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:14,902 INFO L82 PathProgramCache]: Analyzing trace with hash 62618520, now seen corresponding path program 1 times [2019-09-10 07:53:14,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:14,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:14,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:14,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:14,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:14,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:53:14,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:53:14,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:53:14,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:53:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:53:14,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:14,967 INFO L87 Difference]: Start difference. First operand 26083 states and 35530 transitions. Second operand 3 states. [2019-09-10 07:53:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:15,046 INFO L93 Difference]: Finished difference Result 31509 states and 41943 transitions. [2019-09-10 07:53:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:53:15,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-10 07:53:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:15,082 INFO L225 Difference]: With dead ends: 31509 [2019-09-10 07:53:15,083 INFO L226 Difference]: Without dead ends: 31509 [2019-09-10 07:53:15,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:53:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31509 states. [2019-09-10 07:53:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31509 to 29779. [2019-09-10 07:53:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29779 states. [2019-09-10 07:53:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29779 states to 29779 states and 40214 transitions. [2019-09-10 07:53:16,149 INFO L78 Accepts]: Start accepts. Automaton has 29779 states and 40214 transitions. Word has length 127 [2019-09-10 07:53:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:16,149 INFO L475 AbstractCegarLoop]: Abstraction has 29779 states and 40214 transitions. [2019-09-10 07:53:16,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:53:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 29779 states and 40214 transitions. [2019-09-10 07:53:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:53:16,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:16,154 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:16,155 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:16,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:16,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1530675729, now seen corresponding path program 1 times [2019-09-10 07:53:16,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:16,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:16,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:16,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:16,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:16,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:16,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:16,428 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 07:53:16,430 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], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [193], [197], [199], [202], [203], [205], [208], [213], [221], [223], [226], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [321], [323], [326], [329], [331], [346], [348], [350], [353], [356], [358], [366], [371], [373], [376], [462], [463], [467], [468], [469] [2019-09-10 07:53:16,484 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:16,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:16,639 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:17,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:17,297 INFO L272 AbstractInterpreter]: Visited 114 different actions 592 times. Merged at 45 different actions 411 times. Widened at 16 different actions 58 times. Performed 2008 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 73 fixpoints after 19 different actions. Largest state had 126 variables. [2019-09-10 07:53:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:17,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:17,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:17,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:53:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:17,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:17,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:53:17,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:18,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:18,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:18,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:19,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:19,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:19,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2019-09-10 07:53:19,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:19,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:53:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:53:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:53:19,952 INFO L87 Difference]: Start difference. First operand 29779 states and 40214 transitions. Second operand 20 states. [2019-09-10 07:53:20,340 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:53:21,011 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:53:21,604 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:53:22,041 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:53:22,401 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:53:22,618 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:53:22,882 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:53:23,131 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:53:23,353 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:53:23,554 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:53:23,761 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:53:23,948 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:53:24,387 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:53:24,789 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:53:25,084 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:53:25,667 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 07:53:25,860 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:53:26,144 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:53:26,710 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:53:26,989 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:53:27,527 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:53:27,972 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:53:28,225 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:53:28,460 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:53:28,810 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 07:53:29,082 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:53:29,394 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:53:29,766 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:53:30,049 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 07:53:30,280 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:53:30,560 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 07:53:30,883 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:53:31,137 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:53:31,426 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:53:31,813 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 07:53:32,124 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 07:53:32,517 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:53:32,912 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:53:33,318 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:53:33,745 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:53:34,069 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:53:34,468 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:53:34,843 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:53:35,050 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:53:35,332 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:53:35,625 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 07:53:35,974 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:53:36,338 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 07:53:36,810 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:53:37,341 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:53:37,763 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:53:38,042 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:53:38,378 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:53:38,682 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:53:39,044 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:53:39,423 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 07:53:39,837 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:53:40,171 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:53:40,477 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:53:40,710 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:53:40,997 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 07:53:41,640 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:53:41,929 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:53:42,196 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:53:42,436 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:53:42,968 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:53:43,317 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:53:43,674 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:53:43,923 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:53:44,253 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:53:44,704 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:53:45,662 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:53:46,137 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:53:46,574 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 07:53:46,856 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:53:47,227 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 07:53:47,590 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 07:53:48,013 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:53:48,360 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:53:48,920 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:53:49,511 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:53:49,902 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:53:50,388 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:53:50,832 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:53:51,271 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 07:53:51,717 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:53:52,260 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-10 07:53:52,602 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:53:53,105 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-10 07:53:53,454 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:53:53,841 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 07:53:54,116 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 07:53:54,600 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:53:55,093 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:53:55,394 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:53:55,825 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-09-10 07:53:56,095 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:53:58,607 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:53:59,014 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 07:53:59,312 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:53:59,690 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:54:00,184 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:54:00,551 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 07:54:00,975 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:54:01,388 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:54:01,827 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 07:54:02,222 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:54:02,557 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 07:54:03,081 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:54:03,444 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:54:03,809 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:54:04,242 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:54:04,678 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:54:05,055 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:54:05,313 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:54:05,751 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 07:54:06,128 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:54:06,417 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:54:06,704 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:54:06,974 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:54:07,322 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 07:54:07,802 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:08,069 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:54:08,454 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 07:54:08,809 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:54:09,769 WARN L188 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 07:54:10,271 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:54:10,540 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:54:10,892 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:54:11,202 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 07:54:11,514 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 07:54:11,893 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 07:54:12,187 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:54:12,547 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 07:54:12,973 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:54:13,359 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:54:13,676 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:54:13,987 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:54:14,263 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:54:14,693 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:54:14,988 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:54:15,363 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:54:15,637 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:54:16,052 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:54:16,440 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:54:16,774 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:54:17,061 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:54:17,471 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-09-10 07:54:17,783 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:54:18,140 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:54:18,461 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:54:18,931 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:54:19,313 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:54:19,786 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 07:54:20,315 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:54:20,784 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 07:54:21,083 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 07:54:21,342 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:21,672 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 07:54:21,970 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:54:22,299 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 07:54:22,687 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 07:54:22,923 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:54:23,230 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 07:54:23,582 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:54:23,846 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:54:24,297 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 07:54:24,697 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:54:25,004 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:54:25,340 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:54:25,654 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:54:25,933 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:26,310 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 07:54:26,608 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:54:26,979 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 07:54:27,438 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:54:27,763 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:54:28,141 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 07:54:28,404 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:54:28,669 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:54:29,040 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 07:54:29,321 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:29,595 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:30,134 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:54:30,421 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:54:30,859 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:54:31,312 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:54:31,722 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 07:54:31,966 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:54:32,341 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:54:32,575 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:54:32,893 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:54:33,438 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:54:33,953 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 07:54:34,256 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 07:54:34,616 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:54:34,904 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:35,269 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 07:54:35,758 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:54:36,084 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-09-10 07:54:36,375 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:54:36,635 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:54:39,020 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:54:39,582 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:54:39,847 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:54:40,129 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:54:40,459 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:54:40,713 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:54:41,069 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:54:41,295 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:54:41,591 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:54:41,943 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:54:42,330 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:54:42,654 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 07:54:42,916 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:54:43,340 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 07:54:43,661 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:54:44,004 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:54:44,500 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:54:44,779 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:54:45,184 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:54:45,457 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:54:45,799 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:54:46,263 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:54:46,527 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:54:47,092 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:54:47,396 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:54:47,713 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:54:48,090 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:54:48,353 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:54:48,856 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:54:49,480 WARN L188 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:54:49,868 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:54:50,534 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:54:50,865 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:54:51,190 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:54:51,906 WARN L188 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:54:52,393 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:54:53,079 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:54:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:54,002 INFO L93 Difference]: Finished difference Result 343135 states and 451444 transitions. [2019-09-10 07:54:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-09-10 07:54:54,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2019-09-10 07:54:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:56,906 INFO L225 Difference]: With dead ends: 343135 [2019-09-10 07:54:56,906 INFO L226 Difference]: Without dead ends: 343135 [2019-09-10 07:54:56,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 216 SyntacticMatches, 22 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29194 ImplicationChecksByTransitivity, 88.1s TimeCoverageRelationStatistics Valid=10944, Invalid=62768, Unknown=0, NotChecked=0, Total=73712 [2019-09-10 07:54:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343135 states. [2019-09-10 07:55:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343135 to 117100. [2019-09-10 07:55:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117100 states. [2019-09-10 07:55:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117100 states to 117100 states and 156770 transitions. [2019-09-10 07:55:01,334 INFO L78 Accepts]: Start accepts. Automaton has 117100 states and 156770 transitions. Word has length 128 [2019-09-10 07:55:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:01,335 INFO L475 AbstractCegarLoop]: Abstraction has 117100 states and 156770 transitions. [2019-09-10 07:55:01,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:55:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 117100 states and 156770 transitions. [2019-09-10 07:55:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:55:01,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:01,348 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:01,349 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1144567600, now seen corresponding path program 1 times [2019-09-10 07:55:01,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:01,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:01,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:01,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:55:01,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:01,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:55:01,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:55:01,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:55:01,424 INFO L87 Difference]: Start difference. First operand 117100 states and 156770 transitions. Second operand 3 states. [2019-09-10 07:55:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:01,591 INFO L93 Difference]: Finished difference Result 85195 states and 113118 transitions. [2019-09-10 07:55:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:55:01,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 07:55:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:01,704 INFO L225 Difference]: With dead ends: 85195 [2019-09-10 07:55:01,705 INFO L226 Difference]: Without dead ends: 85195 [2019-09-10 07:55:01,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:55:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85195 states. [2019-09-10 07:55:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85195 to 82769. [2019-09-10 07:55:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82769 states. [2019-09-10 07:55:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82769 states to 82769 states and 109955 transitions. [2019-09-10 07:55:04,769 INFO L78 Accepts]: Start accepts. Automaton has 82769 states and 109955 transitions. Word has length 128 [2019-09-10 07:55:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:04,769 INFO L475 AbstractCegarLoop]: Abstraction has 82769 states and 109955 transitions. [2019-09-10 07:55:04,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:55:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 82769 states and 109955 transitions. [2019-09-10 07:55:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 07:55:04,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:04,777 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:04,778 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2106495891, now seen corresponding path program 1 times [2019-09-10 07:55:04,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:04,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:05,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:05,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:05,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 07:55:05,164 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], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [221], [223], [226], [229], [234], [236], [239], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [296], [298], [301], [304], [306], [314], [317], [323], [326], [329], [331], [339], [342], [348], [350], [353], [356], [358], [373], [376], [380], [462], [463], [467], [468], [469] [2019-09-10 07:55:05,169 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:05,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:05,195 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:05,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:05,763 INFO L272 AbstractInterpreter]: Visited 116 different actions 558 times. Merged at 48 different actions 389 times. Widened at 15 different actions 56 times. Performed 1982 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1982 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 8 different actions. Largest state had 126 variables. [2019-09-10 07:55:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:05,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:05,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:05,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:05,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:05,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:05,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:55:05,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:06,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:06,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:06,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:06,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:08,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:08,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:08,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:55:08,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:08,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:55:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:55:08,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:55:08,566 INFO L87 Difference]: Start difference. First operand 82769 states and 109955 transitions. Second operand 20 states. [2019-09-10 07:55:08,709 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:55:09,339 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:55:09,845 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:55:10,254 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:55:10,679 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:11,044 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:55:11,374 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:55:11,647 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:11,908 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:12,203 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:55:12,633 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:13,066 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:55:13,290 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:55:13,565 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:55:14,131 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:55:14,510 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:55:14,949 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:55:15,174 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:15,409 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:55:15,711 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:55:16,060 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:55:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:16,644 INFO L93 Difference]: Finished difference Result 266620 states and 348421 transitions. [2019-09-10 07:55:16,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:55:16,645 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 129 [2019-09-10 07:55:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:16,930 INFO L225 Difference]: With dead ends: 266620 [2019-09-10 07:55:16,930 INFO L226 Difference]: Without dead ends: 266620 [2019-09-10 07:55:16,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 222 SyntacticMatches, 23 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=649, Invalid=1703, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:55:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266620 states. [2019-09-10 07:55:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266620 to 167390. [2019-09-10 07:55:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167390 states. [2019-09-10 07:55:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167390 states to 167390 states and 221112 transitions. [2019-09-10 07:55:19,767 INFO L78 Accepts]: Start accepts. Automaton has 167390 states and 221112 transitions. Word has length 129 [2019-09-10 07:55:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:19,767 INFO L475 AbstractCegarLoop]: Abstraction has 167390 states and 221112 transitions. [2019-09-10 07:55:19,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:55:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 167390 states and 221112 transitions. [2019-09-10 07:55:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:55:19,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:19,776 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:19,776 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash -599839201, now seen corresponding path program 1 times [2019-09-10 07:55:19,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:19,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:19,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:20,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:20,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:20,477 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:55:20,480 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], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [221], [223], [226], [229], [232], [234], [236], [239], [242], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [289], [292], [298], [301], [304], [306], [323], [326], [329], [331], [339], [342], [348], [350], [353], [356], [358], [373], [376], [380], [462], [463], [467], [468], [469] [2019-09-10 07:55:20,495 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:20,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:20,525 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:20,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:20,930 INFO L272 AbstractInterpreter]: Visited 117 different actions 584 times. Merged at 49 different actions 413 times. Widened at 15 different actions 65 times. Performed 2024 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2024 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 9 different actions. Largest state had 126 variables. [2019-09-10 07:55:20,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:20,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:20,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:20,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:20,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:20,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:21,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:55:21,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:21,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:21,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:21,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:23,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:55:23,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:23,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:55:23,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:55:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:55:23,512 INFO L87 Difference]: Start difference. First operand 167390 states and 221112 transitions. Second operand 20 states. [2019-09-10 07:55:23,656 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:55:24,425 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:55:24,750 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:55:25,145 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:25,396 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:55:25,702 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:55:26,225 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:26,495 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:26,788 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:55:27,104 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:55:27,590 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:28,194 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:55:28,590 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:55:28,997 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:55:29,186 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:55:29,807 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:55:30,016 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:55:30,202 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:55:30,487 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:55:30,845 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:55:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:32,914 INFO L93 Difference]: Finished difference Result 531734 states and 690129 transitions. [2019-09-10 07:55:32,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:55:32,914 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 130 [2019-09-10 07:55:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:33,544 INFO L225 Difference]: With dead ends: 531734 [2019-09-10 07:55:33,545 INFO L226 Difference]: Without dead ends: 531734 [2019-09-10 07:55:33,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 224 SyntacticMatches, 23 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=650, Invalid=1702, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:55:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531734 states. [2019-09-10 07:55:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531734 to 339204. [2019-09-10 07:55:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339204 states. [2019-09-10 07:55:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339204 states to 339204 states and 445466 transitions. [2019-09-10 07:55:42,176 INFO L78 Accepts]: Start accepts. Automaton has 339204 states and 445466 transitions. Word has length 130 [2019-09-10 07:55:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:42,177 INFO L475 AbstractCegarLoop]: Abstraction has 339204 states and 445466 transitions. [2019-09-10 07:55:42,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:55:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 339204 states and 445466 transitions. [2019-09-10 07:55:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:55:42,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:42,194 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:42,194 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1929603376, now seen corresponding path program 1 times [2019-09-10 07:55:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:42,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:42,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:42,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:42,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:42,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:42,517 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2019-09-10 07:55:42,517 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], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [174], [177], [180], [183], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [221], [223], [226], [229], [232], [234], [236], [239], [242], [247], [249], [252], [260], [262], [271], [273], [276], [279], [281], [289], [292], [298], [301], [304], [306], [323], [326], [329], [331], [339], [342], [348], [350], [353], [356], [358], [373], [376], [380], [392], [397], [462], [463], [467], [468], [469] [2019-09-10 07:55:42,521 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:42,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:42,535 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:42,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:42,811 INFO L272 AbstractInterpreter]: Visited 118 different actions 559 times. Merged at 49 different actions 390 times. Widened at 15 different actions 57 times. Performed 1918 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1918 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 11 different actions. Largest state had 126 variables. [2019-09-10 07:55:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:42,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:42,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:42,812 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:55:42,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:42,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:42,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:55:42,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:44,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:44,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:44,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:44,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:44,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:44,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:44,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:44,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:44,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:44,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:45,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:46,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:46,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2019-09-10 07:55:46,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:46,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:55:46,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:55:46,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:55:46,046 INFO L87 Difference]: Start difference. First operand 339204 states and 445466 transitions. Second operand 22 states. [2019-09-10 07:55:48,152 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2019-09-10 07:55:48,291 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-09-10 07:55:48,786 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-09-10 07:55:49,839 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-10 07:55:50,180 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-09-10 07:55:50,411 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-09-10 07:55:50,761 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2019-09-10 07:55:50,912 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-09-10 07:55:51,312 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 07:55:51,626 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-09-10 07:55:52,566 WARN L188 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-09-10 07:55:52,806 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 07:55:55,411 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-09-10 07:56:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:04,897 INFO L93 Difference]: Finished difference Result 1267336 states and 1647718 transitions. [2019-09-10 07:56:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 07:56:04,897 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 131 [2019-09-10 07:56:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:06,578 INFO L225 Difference]: With dead ends: 1267336 [2019-09-10 07:56:06,578 INFO L226 Difference]: Without dead ends: 1267336 [2019-09-10 07:56:06,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 221 SyntacticMatches, 20 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1642, Invalid=6368, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 07:56:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267336 states. [2019-09-10 07:56:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267336 to 338698. [2019-09-10 07:56:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338698 states. [2019-09-10 07:56:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338698 states to 338698 states and 444936 transitions. [2019-09-10 07:56:24,678 INFO L78 Accepts]: Start accepts. Automaton has 338698 states and 444936 transitions. Word has length 131 [2019-09-10 07:56:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:24,679 INFO L475 AbstractCegarLoop]: Abstraction has 338698 states and 444936 transitions. [2019-09-10 07:56:24,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:56:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 338698 states and 444936 transitions. [2019-09-10 07:56:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:56:24,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:24,692 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:24,692 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:24,693 INFO L82 PathProgramCache]: Analyzing trace with hash 622316630, now seen corresponding path program 1 times [2019-09-10 07:56:24,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:24,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:24,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:24,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:24,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:24,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:24,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:56:24,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:24,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:56:24,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:56:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:56:24,763 INFO L87 Difference]: Start difference. First operand 338698 states and 444936 transitions. Second operand 3 states. [2019-09-10 07:56:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:25,137 INFO L93 Difference]: Finished difference Result 152512 states and 193665 transitions. [2019-09-10 07:56:25,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:56:25,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 07:56:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:25,290 INFO L225 Difference]: With dead ends: 152512 [2019-09-10 07:56:25,290 INFO L226 Difference]: Without dead ends: 152512 [2019-09-10 07:56:25,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:56:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152512 states. [2019-09-10 07:56:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152512 to 152510. [2019-09-10 07:56:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152510 states. [2019-09-10 07:56:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152510 states to 152510 states and 193664 transitions. [2019-09-10 07:56:30,631 INFO L78 Accepts]: Start accepts. Automaton has 152510 states and 193664 transitions. Word has length 131 [2019-09-10 07:56:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:30,631 INFO L475 AbstractCegarLoop]: Abstraction has 152510 states and 193664 transitions. [2019-09-10 07:56:30,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:56:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 152510 states and 193664 transitions. [2019-09-10 07:56:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:56:30,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:30,640 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:30,640 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1283605095, now seen corresponding path program 1 times [2019-09-10 07:56:30,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:30,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:30,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:30,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:30,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:56:30,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:56:30,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:56:30,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:56:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:56:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:56:30,699 INFO L87 Difference]: Start difference. First operand 152510 states and 193664 transitions. Second operand 3 states. [2019-09-10 07:56:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:56:30,950 INFO L93 Difference]: Finished difference Result 81564 states and 102929 transitions. [2019-09-10 07:56:30,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:56:30,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 07:56:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:56:31,048 INFO L225 Difference]: With dead ends: 81564 [2019-09-10 07:56:31,048 INFO L226 Difference]: Without dead ends: 81564 [2019-09-10 07:56:31,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:56:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81564 states. [2019-09-10 07:56:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81564 to 81562. [2019-09-10 07:56:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81562 states. [2019-09-10 07:56:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81562 states to 81562 states and 102928 transitions. [2019-09-10 07:56:32,216 INFO L78 Accepts]: Start accepts. Automaton has 81562 states and 102928 transitions. Word has length 131 [2019-09-10 07:56:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:56:32,216 INFO L475 AbstractCegarLoop]: Abstraction has 81562 states and 102928 transitions. [2019-09-10 07:56:32,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:56:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 81562 states and 102928 transitions. [2019-09-10 07:56:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:56:32,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:56:32,222 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:56:32,222 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:56:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1551970215, now seen corresponding path program 1 times [2019-09-10 07:56:32,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:56:32,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:32,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:32,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:56:32,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:56:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:32,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:32,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:56:32,667 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2019-09-10 07:56:32,667 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], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [221], [223], [226], [229], [232], [234], [236], [239], [242], [247], [249], [252], [255], [258], [260], [262], [273], [276], [279], [281], [289], [292], [298], [301], [304], [306], [323], [326], [329], [331], [339], [342], [348], [350], [353], [356], [358], [373], [376], [380], [462], [463], [467], [468], [469] [2019-09-10 07:56:32,670 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:56:32,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:56:32,687 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:56:33,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:56:33,002 INFO L272 AbstractInterpreter]: Visited 118 different actions 585 times. Merged at 50 different actions 414 times. Widened at 14 different actions 53 times. Performed 2031 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2031 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 47 fixpoints after 16 different actions. Largest state had 126 variables. [2019-09-10 07:56:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:56:33,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:56:33,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:56:33,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:56:33,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:56:33,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:56:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:56:33,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 07:56:33,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:56:33,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:33,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:34,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:34,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:56:34,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:34,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:34,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:37,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:38,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:38,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:38,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:56:38,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:56:38,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:56:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:56:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:56:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:56:41,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 47 [2019-09-10 07:56:41,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:56:41,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 07:56:41,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 07:56:41,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2004, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:56:41,272 INFO L87 Difference]: Start difference. First operand 81562 states and 102928 transitions. Second operand 33 states. [2019-09-10 07:56:41,546 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:56:44,131 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:56:44,326 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 07:56:44,989 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 07:56:45,178 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 07:56:45,421 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:56:49,454 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:56:49,812 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:56:50,433 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:56:51,079 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:56:51,536 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:56:52,349 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:56:53,818 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:56:54,588 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:56:55,227 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-10 07:56:55,974 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:56:56,520 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 07:56:57,147 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:56:57,422 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:56:59,947 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 07:57:02,170 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:57:02,516 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-10 07:57:03,839 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 07:57:08,212 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:57:13,854 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-10 07:57:19,559 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:57:19,912 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:57:20,275 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:57:24,124 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-10 07:57:24,974 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:57:25,476 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:57:26,053 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:57:26,565 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:57:26,995 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:57:27,187 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:57:30,101 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-10 07:57:33,387 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:57:34,110 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:57:34,939 WARN L188 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:57:35,165 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:57:35,595 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:57:35,840 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:57:42,972 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:57:43,154 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:57:43,737 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:57:47,422 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:57:48,273 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:57:48,796 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:57:48,993 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:57:51,657 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 07:57:56,213 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:58:01,670 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:58:03,930 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:58:11,711 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:58:11,980 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:58:14,140 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:58:15,924 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:58:16,127 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:58:16,413 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:58:16,681 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:58:18,416 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:58:18,704 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:58:19,030 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:58:20,130 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:58:22,941 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:58:23,199 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:58:23,552 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:58:24,021 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:58:25,006 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:58:25,360 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:58:26,132 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:58:27,625 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:58:28,910 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:58:29,551 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:58:29,872 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:58:30,350 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:58:33,817 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:58:36,944 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:58:45,881 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:58:46,168 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:58:47,818 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:58:48,284 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:58:49,678 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:58:51,447 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:58:51,897 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:58:54,225 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:58:54,632 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:58:55,050 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:58:56,533 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:58:56,825 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:58:57,714 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:58:58,971 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:59:00,473 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:59:01,102 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:59:01,585 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:59:01,799 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 07:59:02,126 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:59:02,478 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:59:02,861 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:59:03,314 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:59:03,810 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:59:04,297 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:59:06,758 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:59:07,450 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-10 07:59:08,916 WARN L188 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:59:09,818 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-10 07:59:10,584 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 07:59:14,545 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:59:17,053 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:59:17,862 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:59:18,725 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:59:19,131 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:59:19,843 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 07:59:20,382 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:59:20,773 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:59:21,569 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:59:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:22,218 INFO L93 Difference]: Finished difference Result 522322 states and 649841 transitions. [2019-09-10 07:59:22,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 304 states. [2019-09-10 07:59:22,218 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2019-09-10 07:59:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:22,806 INFO L225 Difference]: With dead ends: 522322 [2019-09-10 07:59:22,807 INFO L226 Difference]: Without dead ends: 522322 [2019-09-10 07:59:22,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 198 SyntacticMatches, 36 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46776 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=11739, Invalid=108323, Unknown=0, NotChecked=0, Total=120062 [2019-09-10 07:59:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522322 states. [2019-09-10 07:59:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522322 to 157871. [2019-09-10 07:59:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157871 states. [2019-09-10 07:59:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157871 states to 157871 states and 198371 transitions. [2019-09-10 07:59:27,137 INFO L78 Accepts]: Start accepts. Automaton has 157871 states and 198371 transitions. Word has length 131 [2019-09-10 07:59:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:27,137 INFO L475 AbstractCegarLoop]: Abstraction has 157871 states and 198371 transitions. [2019-09-10 07:59:27,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 07:59:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 157871 states and 198371 transitions. [2019-09-10 07:59:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:59:27,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:27,147 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:59:27,147 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:27,148 INFO L82 PathProgramCache]: Analyzing trace with hash -649757895, now seen corresponding path program 1 times [2019-09-10 07:59:27,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:27,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:27,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:27,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:27,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:28,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:59:28,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:59:28,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2019-09-10 07:59:28,036 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], [76], [79], [82], [84], [88], [91], [94], [96], [100], [103], [106], [108], [112], [115], [118], [120], [123], [127], [130], [133], [137], [140], [144], [147], [150], [152], [155], [158], [161], [163], [166], [169], [172], [174], [177], [180], [183], [185], [187], [190], [197], [199], [202], [203], [205], [208], [213], [216], [219], [221], [223], [226], [229], [234], [236], [239], [242], [245], [247], [249], [252], [255], [260], [262], [264], [267], [273], [276], [279], [281], [298], [301], [304], [306], [314], [317], [323], [326], [329], [331], [348], [350], [353], [356], [358], [373], [376], [380], [462], [463], [467], [468], [469] [2019-09-10 07:59:28,039 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:59:28,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:59:28,053 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:59:28,424 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:59:28,425 INFO L272 AbstractInterpreter]: Visited 118 different actions 650 times. Merged at 50 different actions 474 times. Widened at 14 different actions 70 times. Performed 2252 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 52 fixpoints after 13 different actions. Largest state had 126 variables. [2019-09-10 07:59:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:28,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:59:28,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:59:28,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:59:28,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:28,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:59:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:28,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 07:59:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:59:28,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:29,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:29,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:29,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:29,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:30,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:30,935 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:59:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:31,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:31,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:32,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:32,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:32,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:59:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:59:33,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:59:33,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 17] total 56 [2019-09-10 07:59:33,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:59:33,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 07:59:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 07:59:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2907, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:59:33,443 INFO L87 Difference]: Start difference. First operand 157871 states and 198371 transitions. Second operand 41 states. [2019-09-10 07:59:33,665 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:59:35,889 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:59:36,270 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 07:59:36,879 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 07:59:37,930 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:59:38,426 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:59:39,525 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-09-10 07:59:42,635 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-09-10 07:59:43,385 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 07:59:45,308 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 07:59:46,335 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 07:59:49,986 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:59:56,492 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 07:59:57,037 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:59:59,205 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 08:00:01,264 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:00:04,284 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 08:00:06,351 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:00:16,613 WARN L188 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 08:00:22,969 WARN L188 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:00:23,593 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 08:00:26,978 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:00:45,747 WARN L188 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:00:47,583 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:00:48,330 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:00:52,236 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:00:56,863 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:01:15,322 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:01:23,372 WARN L188 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:01:30,309 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:01:31,439 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:01:33,656 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 08:01:40,714 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 08:01:44,696 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:01:49,832 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:01:58,005 WARN L188 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 08:02:02,455 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 08:02:03,323 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:02:19,904 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:02:21,119 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 08:02:26,660 WARN L188 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 08:02:30,334 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 08:02:31,407 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:02:33,634 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:02:35,865 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 08:02:43,729 WARN L188 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:02:52,086 WARN L188 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:02:53,485 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:03:49,493 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 08:03:58,823 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 08:03:59,874 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 08:04:00,387 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 08:04:04,946 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 08:04:09,152 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 08:04:14,947 WARN L188 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 08:04:19,887 WARN L188 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 08:04:32,981 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:04:36,697 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 08:04:45,525 WARN L188 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 08:04:53,132 WARN L188 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 93 DAG size of output: 74