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.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:42:25,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:42:25,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:42:25,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:42:25,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:42:25,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:42:25,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:42:25,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:42:25,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:42:25,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:42:25,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:42:25,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:42:25,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:42:25,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:42:25,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:42:25,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:42:25,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:42:25,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:42:25,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:42:25,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:42:25,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:42:25,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:42:25,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:42:25,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:42:25,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:42:25,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:42:25,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:42:25,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:42:25,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:42:25,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:42:25,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:42:25,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:42:25,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:42:25,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:42:25,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:42:25,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:42:25,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:42:25,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:42:25,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:42:25,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:42:25,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:42:25,952 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:42:25,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:42:25,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:42:25,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:42:25,975 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:42:25,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:42:25,976 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:42:25,976 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:42:25,976 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:42:25,976 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:42:25,977 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:42:25,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:42:25,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:42:25,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:42:25,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:42:25,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:42:25,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:42:25,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:42:25,981 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:42:25,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:42:25,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:42:25,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:42:25,982 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:42:25,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:42:25,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:42:25,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:42:25,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:42:25,983 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:42:25,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:42:25,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:42:25,983 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:42:26,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:42:26,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:42:26,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:42:26,061 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:42:26,062 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:42:26,063 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.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:42:26,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa035890c/351a4f4e69944a09a189c0d999dd1442/FLAG7f2cfdee4 [2019-09-10 07:42:26,637 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:42:26,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:42:26,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa035890c/351a4f4e69944a09a189c0d999dd1442/FLAG7f2cfdee4 [2019-09-10 07:42:26,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa035890c/351a4f4e69944a09a189c0d999dd1442 [2019-09-10 07:42:26,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:42:26,967 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:42:26,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:42:26,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:42:26,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:42:26,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:42:26" (1/1) ... [2019-09-10 07:42:26,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:26, skipping insertion in model container [2019-09-10 07:42:26,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:42:26" (1/1) ... [2019-09-10 07:42:26,986 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:42:27,044 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:42:27,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:42:27,396 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:42:27,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:42:27,466 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:42:27,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27 WrapperNode [2019-09-10 07:42:27,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:42:27,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:42:27,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:42:27,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:42:27,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (1/1) ... [2019-09-10 07:42:27,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (1/1) ... [2019-09-10 07:42:27,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (1/1) ... [2019-09-10 07:42:27,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (1/1) ... [2019-09-10 07:42:27,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (1/1) ... [2019-09-10 07:42:27,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (1/1) ... [2019-09-10 07:42:27,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (1/1) ... [2019-09-10 07:42:27,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:42:27,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:42:27,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:42:27,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:42:27,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (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:42:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:42:27,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:42:27,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:42:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:42:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:42:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:42:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:42:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:42:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:42:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:42:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:42:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:42:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:42:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:42:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:42:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:42:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:42:27,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:42:27,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:42:27,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:42:28,131 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:42:28,132 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:42:28,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:42:28 BoogieIcfgContainer [2019-09-10 07:42:28,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:42:28,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:42:28,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:42:28,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:42:28,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:42:26" (1/3) ... [2019-09-10 07:42:28,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71183e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:42:28, skipping insertion in model container [2019-09-10 07:42:28,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:42:27" (2/3) ... [2019-09-10 07:42:28,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71183e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:42:28, skipping insertion in model container [2019-09-10 07:42:28,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:42:28" (3/3) ... [2019-09-10 07:42:28,142 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:42:28,152 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:42:28,161 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:42:28,178 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:42:28,206 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:42:28,207 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:42:28,207 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:42:28,207 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:42:28,207 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:42:28,207 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:42:28,208 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:42:28,208 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:42:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-09-10 07:42:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:42:28,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:28,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:28,239 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1010910297, now seen corresponding path program 1 times [2019-09-10 07:42:28,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:28,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:28,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:28,649 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:42:28,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:28,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:42:28,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:28,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:42:28,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:42:28,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:42:28,677 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-09-10 07:42:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:28,753 INFO L93 Difference]: Finished difference Result 134 states and 210 transitions. [2019-09-10 07:42:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:42:28,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 07:42:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:28,769 INFO L225 Difference]: With dead ends: 134 [2019-09-10 07:42:28,769 INFO L226 Difference]: Without dead ends: 126 [2019-09-10 07:42:28,771 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:42:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-10 07:42:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-09-10 07:42:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-10 07:42:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 179 transitions. [2019-09-10 07:42:28,823 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 179 transitions. Word has length 52 [2019-09-10 07:42:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:28,823 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 179 transitions. [2019-09-10 07:42:28,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:42:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 179 transitions. [2019-09-10 07:42:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 07:42:28,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:28,826 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:28,827 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 642580825, now seen corresponding path program 1 times [2019-09-10 07:42:28,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:28,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:28,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:28,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:28,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:28,978 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:42:28,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:28,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:42:28,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:28,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:42:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:42:28,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:42:28,983 INFO L87 Difference]: Start difference. First operand 124 states and 179 transitions. Second operand 3 states. [2019-09-10 07:42:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:29,029 INFO L93 Difference]: Finished difference Result 202 states and 300 transitions. [2019-09-10 07:42:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:42:29,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 07:42:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:29,033 INFO L225 Difference]: With dead ends: 202 [2019-09-10 07:42:29,033 INFO L226 Difference]: Without dead ends: 202 [2019-09-10 07:42:29,034 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:42:29,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-10 07:42:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-09-10 07:42:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 07:42:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 299 transitions. [2019-09-10 07:42:29,075 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 299 transitions. Word has length 53 [2019-09-10 07:42:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:29,075 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 299 transitions. [2019-09-10 07:42:29,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:42:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 299 transitions. [2019-09-10 07:42:29,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:42:29,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:29,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:29,078 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:29,079 INFO L82 PathProgramCache]: Analyzing trace with hash 228050420, now seen corresponding path program 1 times [2019-09-10 07:42:29,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:29,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:29,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:29,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:29,178 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:42:29,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:29,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:42:29,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:29,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:42:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:42:29,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:42:29,180 INFO L87 Difference]: Start difference. First operand 200 states and 299 transitions. Second operand 3 states. [2019-09-10 07:42:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:29,215 INFO L93 Difference]: Finished difference Result 338 states and 512 transitions. [2019-09-10 07:42:29,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:42:29,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-10 07:42:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:29,219 INFO L225 Difference]: With dead ends: 338 [2019-09-10 07:42:29,219 INFO L226 Difference]: Without dead ends: 338 [2019-09-10 07:42:29,219 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:42:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-10 07:42:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-09-10 07:42:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 07:42:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 511 transitions. [2019-09-10 07:42:29,267 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 511 transitions. Word has length 54 [2019-09-10 07:42:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:29,270 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 511 transitions. [2019-09-10 07:42:29,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:42:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 511 transitions. [2019-09-10 07:42:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:42:29,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:29,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:29,275 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:29,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash -742349385, now seen corresponding path program 1 times [2019-09-10 07:42:29,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:29,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:29,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:29,418 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:42:29,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:42:29,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:29,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:42:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:42:29,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:42:29,420 INFO L87 Difference]: Start difference. First operand 336 states and 511 transitions. Second operand 5 states. [2019-09-10 07:42:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:29,528 INFO L93 Difference]: Finished difference Result 336 states and 507 transitions. [2019-09-10 07:42:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:42:29,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 07:42:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:29,532 INFO L225 Difference]: With dead ends: 336 [2019-09-10 07:42:29,532 INFO L226 Difference]: Without dead ends: 336 [2019-09-10 07:42:29,532 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:42:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-10 07:42:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-10 07:42:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 07:42:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 507 transitions. [2019-09-10 07:42:29,547 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 507 transitions. Word has length 55 [2019-09-10 07:42:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:29,548 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 507 transitions. [2019-09-10 07:42:29,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:42:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 507 transitions. [2019-09-10 07:42:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:42:29,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:29,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:29,551 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:29,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1710587378, now seen corresponding path program 1 times [2019-09-10 07:42:29,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:29,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:29,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:29,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:29,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:42:29,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:29,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:42:29,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:42:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:42:29,710 INFO L87 Difference]: Start difference. First operand 336 states and 507 transitions. Second operand 5 states. [2019-09-10 07:42:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:29,827 INFO L93 Difference]: Finished difference Result 336 states and 503 transitions. [2019-09-10 07:42:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:42:29,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 07:42:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:29,831 INFO L225 Difference]: With dead ends: 336 [2019-09-10 07:42:29,832 INFO L226 Difference]: Without dead ends: 336 [2019-09-10 07:42:29,832 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:42:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-10 07:42:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-10 07:42:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 07:42:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 503 transitions. [2019-09-10 07:42:29,850 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 503 transitions. Word has length 55 [2019-09-10 07:42:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:29,850 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 503 transitions. [2019-09-10 07:42:29,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:42:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 503 transitions. [2019-09-10 07:42:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:42:29,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:29,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:29,859 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:29,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:29,860 INFO L82 PathProgramCache]: Analyzing trace with hash 263557783, now seen corresponding path program 1 times [2019-09-10 07:42:29,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:29,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:29,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:29,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:29,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:30,041 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:42:30,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:30,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:42:30,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:30,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:42:30,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:42:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:42:30,044 INFO L87 Difference]: Start difference. First operand 336 states and 503 transitions. Second operand 6 states. [2019-09-10 07:42:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:30,265 INFO L93 Difference]: Finished difference Result 1560 states and 2379 transitions. [2019-09-10 07:42:30,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:42:30,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-10 07:42:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:30,275 INFO L225 Difference]: With dead ends: 1560 [2019-09-10 07:42:30,276 INFO L226 Difference]: Without dead ends: 1560 [2019-09-10 07:42:30,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:42:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2019-09-10 07:42:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 640. [2019-09-10 07:42:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-10 07:42:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 959 transitions. [2019-09-10 07:42:30,306 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 959 transitions. Word has length 55 [2019-09-10 07:42:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:30,307 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 959 transitions. [2019-09-10 07:42:30,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:42:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 959 transitions. [2019-09-10 07:42:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:42:30,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:30,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:30,314 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:30,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:30,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1017233934, now seen corresponding path program 1 times [2019-09-10 07:42:30,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:30,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:30,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:30,421 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:42:30,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:30,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:42:30,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:30,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:42:30,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:42:30,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:42:30,423 INFO L87 Difference]: Start difference. First operand 640 states and 959 transitions. Second operand 3 states. [2019-09-10 07:42:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:30,451 INFO L93 Difference]: Finished difference Result 1170 states and 1704 transitions. [2019-09-10 07:42:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:42:30,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-10 07:42:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:30,458 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 07:42:30,458 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 07:42:30,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:42:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 07:42:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1152. [2019-09-10 07:42:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-09-10 07:42:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1687 transitions. [2019-09-10 07:42:30,488 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1687 transitions. Word has length 57 [2019-09-10 07:42:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:30,488 INFO L475 AbstractCegarLoop]: Abstraction has 1152 states and 1687 transitions. [2019-09-10 07:42:30,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:42:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1687 transitions. [2019-09-10 07:42:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:42:30,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:30,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:30,490 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash -997184591, now seen corresponding path program 1 times [2019-09-10 07:42:30,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:30,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:30,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:30,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:30,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:30,748 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:42:30,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:30,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:42:30,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:30,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:42:30,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:42:30,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:42:30,752 INFO L87 Difference]: Start difference. First operand 1152 states and 1687 transitions. Second operand 6 states. [2019-09-10 07:42:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:30,881 INFO L93 Difference]: Finished difference Result 2270 states and 3346 transitions. [2019-09-10 07:42:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:42:30,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 07:42:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:30,894 INFO L225 Difference]: With dead ends: 2270 [2019-09-10 07:42:30,895 INFO L226 Difference]: Without dead ends: 2270 [2019-09-10 07:42:30,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:42:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-09-10 07:42:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1152. [2019-09-10 07:42:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-09-10 07:42:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1671 transitions. [2019-09-10 07:42:30,940 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1671 transitions. Word has length 57 [2019-09-10 07:42:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:30,940 INFO L475 AbstractCegarLoop]: Abstraction has 1152 states and 1671 transitions. [2019-09-10 07:42:30,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:42:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1671 transitions. [2019-09-10 07:42:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:42:30,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:30,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:30,942 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:30,943 INFO L82 PathProgramCache]: Analyzing trace with hash 620001396, now seen corresponding path program 1 times [2019-09-10 07:42:30,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:30,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:30,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:30,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:30,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:31,014 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:42:31,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:31,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:42:31,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:31,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:42:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:42:31,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:42:31,016 INFO L87 Difference]: Start difference. First operand 1152 states and 1671 transitions. Second operand 3 states. [2019-09-10 07:42:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:31,056 INFO L93 Difference]: Finished difference Result 1604 states and 2322 transitions. [2019-09-10 07:42:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:42:31,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 07:42:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:31,065 INFO L225 Difference]: With dead ends: 1604 [2019-09-10 07:42:31,065 INFO L226 Difference]: Without dead ends: 1604 [2019-09-10 07:42:31,066 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:42:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2019-09-10 07:42:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1602. [2019-09-10 07:42:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2019-09-10 07:42:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2321 transitions. [2019-09-10 07:42:31,105 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2321 transitions. Word has length 58 [2019-09-10 07:42:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:31,105 INFO L475 AbstractCegarLoop]: Abstraction has 1602 states and 2321 transitions. [2019-09-10 07:42:31,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:42:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2321 transitions. [2019-09-10 07:42:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:42:31,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:31,106 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:31,106 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:31,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:31,107 INFO L82 PathProgramCache]: Analyzing trace with hash -849860640, now seen corresponding path program 1 times [2019-09-10 07:42:31,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:31,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:31,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:31,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:31,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:31,191 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:42:31,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:31,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:42:31,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:31,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:42:31,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:42:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:42:31,193 INFO L87 Difference]: Start difference. First operand 1602 states and 2321 transitions. Second operand 5 states. [2019-09-10 07:42:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:31,267 INFO L93 Difference]: Finished difference Result 3022 states and 4323 transitions. [2019-09-10 07:42:31,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:42:31,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-10 07:42:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:31,285 INFO L225 Difference]: With dead ends: 3022 [2019-09-10 07:42:31,285 INFO L226 Difference]: Without dead ends: 3022 [2019-09-10 07:42:31,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:42:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-10 07:42:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1682. [2019-09-10 07:42:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-09-10 07:42:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2393 transitions. [2019-09-10 07:42:31,340 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2393 transitions. Word has length 58 [2019-09-10 07:42:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:31,341 INFO L475 AbstractCegarLoop]: Abstraction has 1682 states and 2393 transitions. [2019-09-10 07:42:31,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:42:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2393 transitions. [2019-09-10 07:42:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:42:31,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:31,344 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:42:31,344 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash -911018282, now seen corresponding path program 1 times [2019-09-10 07:42:31,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:31,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:31,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:42:31,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:31,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:42:31,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:31,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:42:31,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:42:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:42:31,516 INFO L87 Difference]: Start difference. First operand 1682 states and 2393 transitions. Second operand 6 states. [2019-09-10 07:42:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:31,697 INFO L93 Difference]: Finished difference Result 3914 states and 5661 transitions. [2019-09-10 07:42:31,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:42:31,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-09-10 07:42:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:31,726 INFO L225 Difference]: With dead ends: 3914 [2019-09-10 07:42:31,726 INFO L226 Difference]: Without dead ends: 3914 [2019-09-10 07:42:31,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:42:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-09-10 07:42:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 2514. [2019-09-10 07:42:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-09-10 07:42:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3593 transitions. [2019-09-10 07:42:31,834 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3593 transitions. Word has length 81 [2019-09-10 07:42:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:31,835 INFO L475 AbstractCegarLoop]: Abstraction has 2514 states and 3593 transitions. [2019-09-10 07:42:31,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:42:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3593 transitions. [2019-09-10 07:42:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:42:31,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:31,839 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:42:31,840 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash -934763504, now seen corresponding path program 1 times [2019-09-10 07:42:31,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:31,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:31,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:42:32,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:32,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:42:32,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:32,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:42:32,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:42:32,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:42:32,007 INFO L87 Difference]: Start difference. First operand 2514 states and 3593 transitions. Second operand 6 states. [2019-09-10 07:42:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:32,127 INFO L93 Difference]: Finished difference Result 4746 states and 6861 transitions. [2019-09-10 07:42:32,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:42:32,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-09-10 07:42:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:32,151 INFO L225 Difference]: With dead ends: 4746 [2019-09-10 07:42:32,152 INFO L226 Difference]: Without dead ends: 4746 [2019-09-10 07:42:32,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:42:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2019-09-10 07:42:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 3346. [2019-09-10 07:42:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3346 states. [2019-09-10 07:42:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4793 transitions. [2019-09-10 07:42:32,260 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4793 transitions. Word has length 81 [2019-09-10 07:42:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:32,260 INFO L475 AbstractCegarLoop]: Abstraction has 3346 states and 4793 transitions. [2019-09-10 07:42:32,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:42:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4793 transitions. [2019-09-10 07:42:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:42:32,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:32,263 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:42:32,263 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1307289398, now seen corresponding path program 1 times [2019-09-10 07:42:32,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:32,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:32,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:32,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:32,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:32,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 07:42:32,368 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], [74], [92], [95], [98], [103], [105], [108], [116], [118], [121], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [174], [176], [179], [182], [184], [199], [201], [204], [207], [209], [217], [220], [226], [229], [232], [234], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:42:32,412 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:32,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:32,517 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:33,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:33,079 INFO L272 AbstractInterpreter]: Visited 71 different actions 414 times. Merged at 41 different actions 303 times. Widened at 15 different actions 36 times. Performed 1461 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1461 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 10 different actions. Largest state had 109 variables. [2019-09-10 07:42:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:33,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:33,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:33,086 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:42:33,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:33,111 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:42:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:33,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:42:33,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:42:33,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:42:33,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:42:33,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 11 [2019-09-10 07:42:33,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:33,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:42:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:42:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:42:33,501 INFO L87 Difference]: Start difference. First operand 3346 states and 4793 transitions. Second operand 6 states. [2019-09-10 07:42:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:33,658 INFO L93 Difference]: Finished difference Result 5578 states and 8061 transitions. [2019-09-10 07:42:33,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:42:33,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-09-10 07:42:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:33,686 INFO L225 Difference]: With dead ends: 5578 [2019-09-10 07:42:33,687 INFO L226 Difference]: Without dead ends: 5578 [2019-09-10 07:42:33,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:42:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2019-09-10 07:42:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4178. [2019-09-10 07:42:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4178 states. [2019-09-10 07:42:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 5993 transitions. [2019-09-10 07:42:33,782 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 5993 transitions. Word has length 81 [2019-09-10 07:42:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:33,783 INFO L475 AbstractCegarLoop]: Abstraction has 4178 states and 5993 transitions. [2019-09-10 07:42:33,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:42:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 5993 transitions. [2019-09-10 07:42:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:42:33,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:33,786 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:33,786 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:33,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:33,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1399365996, now seen corresponding path program 1 times [2019-09-10 07:42:33,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:33,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:33,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:33,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:33,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:33,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:33,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:33,884 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 07:42:33,884 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], [74], [77], [82], [85], [90], [92], [95], [103], [105], [108], [116], [118], [121], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [174], [176], [179], [182], [184], [199], [201], [204], [207], [209], [224], [226], [229], [232], [234], [242], [245], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:42:33,890 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:33,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:33,920 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:34,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:34,275 INFO L272 AbstractInterpreter]: Visited 76 different actions 553 times. Merged at 46 different actions 413 times. Widened at 19 different actions 61 times. Performed 1933 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1933 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 50 fixpoints after 13 different actions. Largest state had 109 variables. [2019-09-10 07:42:34,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:34,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:34,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:34,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:42:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:34,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:42:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:34,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:42:34,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:42:34,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:42:34,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:42:34,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 11 [2019-09-10 07:42:34,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:34,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:42:34,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:42:34,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:42:34,618 INFO L87 Difference]: Start difference. First operand 4178 states and 5993 transitions. Second operand 6 states. [2019-09-10 07:42:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:34,740 INFO L93 Difference]: Finished difference Result 6138 states and 8885 transitions. [2019-09-10 07:42:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:42:34,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-10 07:42:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:34,757 INFO L225 Difference]: With dead ends: 6138 [2019-09-10 07:42:34,757 INFO L226 Difference]: Without dead ends: 6138 [2019-09-10 07:42:34,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:42:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-09-10 07:42:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 4738. [2019-09-10 07:42:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4738 states. [2019-09-10 07:42:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4738 states to 4738 states and 6817 transitions. [2019-09-10 07:42:34,862 INFO L78 Accepts]: Start accepts. Automaton has 4738 states and 6817 transitions. Word has length 82 [2019-09-10 07:42:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:34,862 INFO L475 AbstractCegarLoop]: Abstraction has 4738 states and 6817 transitions. [2019-09-10 07:42:34,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:42:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4738 states and 6817 transitions. [2019-09-10 07:42:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:42:34,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:34,866 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:34,866 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:34,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:34,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1236566682, now seen corresponding path program 1 times [2019-09-10 07:42:34,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:34,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:34,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:34,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:34,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:35,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:35,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:35,087 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 07:42:35,088 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], [74], [77], [82], [90], [92], [95], [103], [105], [108], [116], [118], [121], [129], [131], [134], [137], [141], [143], [146], [147], [149], [151], [156], [158], [161], [174], [176], [179], [182], [184], [199], [201], [204], [207], [209], [224], [226], [229], [232], [234], [249], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:42:35,091 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:35,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:35,109 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:35,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:35,483 INFO L272 AbstractInterpreter]: Visited 76 different actions 526 times. Merged at 45 different actions 383 times. Widened at 17 different actions 51 times. Performed 1867 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1867 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 69 fixpoints after 18 different actions. Largest state had 109 variables. [2019-09-10 07:42:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:35,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:35,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:35,485 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:42:35,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:35,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:42:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:35,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:42:35,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:42:35,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:42:35,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:35,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 07:42:35,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:35,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:42:35,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:42:35,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:42:35,874 INFO L87 Difference]: Start difference. First operand 4738 states and 6817 transitions. Second operand 12 states. [2019-09-10 07:42:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:40,770 INFO L93 Difference]: Finished difference Result 43924 states and 60722 transitions. [2019-09-10 07:42:40,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 07:42:40,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-10 07:42:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:40,849 INFO L225 Difference]: With dead ends: 43924 [2019-09-10 07:42:40,850 INFO L226 Difference]: Without dead ends: 43924 [2019-09-10 07:42:40,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2835 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1461, Invalid=6195, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 07:42:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43924 states. [2019-09-10 07:42:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43924 to 17370. [2019-09-10 07:42:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17370 states. [2019-09-10 07:42:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17370 states to 17370 states and 24219 transitions. [2019-09-10 07:42:41,420 INFO L78 Accepts]: Start accepts. Automaton has 17370 states and 24219 transitions. Word has length 83 [2019-09-10 07:42:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:41,420 INFO L475 AbstractCegarLoop]: Abstraction has 17370 states and 24219 transitions. [2019-09-10 07:42:41,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:42:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17370 states and 24219 transitions. [2019-09-10 07:42:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:42:41,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:41,426 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:42:41,426 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash -982227461, now seen corresponding path program 1 times [2019-09-10 07:42:41,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:41,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:41,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:41,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:41,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:41,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:42:41,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:41,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:42:41,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:42:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:42:41,514 INFO L87 Difference]: Start difference. First operand 17370 states and 24219 transitions. Second operand 3 states. [2019-09-10 07:42:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:41,560 INFO L93 Difference]: Finished difference Result 12229 states and 16934 transitions. [2019-09-10 07:42:41,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:42:41,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:42:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:41,587 INFO L225 Difference]: With dead ends: 12229 [2019-09-10 07:42:41,587 INFO L226 Difference]: Without dead ends: 12229 [2019-09-10 07:42:41,588 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:42:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12229 states. [2019-09-10 07:42:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12229 to 12227. [2019-09-10 07:42:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12227 states. [2019-09-10 07:42:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12227 states to 12227 states and 16933 transitions. [2019-09-10 07:42:41,777 INFO L78 Accepts]: Start accepts. Automaton has 12227 states and 16933 transitions. Word has length 83 [2019-09-10 07:42:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:41,777 INFO L475 AbstractCegarLoop]: Abstraction has 12227 states and 16933 transitions. [2019-09-10 07:42:41,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:42:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 12227 states and 16933 transitions. [2019-09-10 07:42:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:42:41,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:41,780 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:41,780 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1262120977, now seen corresponding path program 1 times [2019-09-10 07:42:41,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:41,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:41,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:41,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:42,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:42,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:42,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:42:42,038 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], [74], [77], [82], [85], [90], [92], [95], [98], [103], [105], [108], [116], [118], [121], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [174], [176], [179], [182], [184], [199], [201], [204], [207], [209], [217], [220], [226], [229], [232], [234], [242], [245], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:42:42,045 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:42,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:42,080 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:42,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:42,572 INFO L272 AbstractInterpreter]: Visited 78 different actions 637 times. Merged at 48 different actions 492 times. Widened at 17 different actions 85 times. Performed 2061 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2061 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 15 different actions. Largest state had 109 variables. [2019-09-10 07:42:42,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:42,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:42,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:42,574 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:42:42,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:42,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:42:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:42,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 07:42:42,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:43,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:44,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:45,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:45,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 18] total 40 [2019-09-10 07:42:45,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:45,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 07:42:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 07:42:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1417, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:42:45,376 INFO L87 Difference]: Start difference. First operand 12227 states and 16933 transitions. Second operand 24 states. [2019-09-10 07:42:47,287 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:42:47,473 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:42:47,753 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:42:47,900 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:42:48,478 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:42:48,778 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 07:42:48,941 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:42:49,128 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:42:49,382 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:42:52,663 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:42:53,240 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:42:53,585 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 07:42:55,558 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:43:05,586 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:43:05,750 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 07:43:07,080 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:43:08,890 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:43:09,101 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:43:09,467 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:43:09,715 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:43:09,905 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:43:10,288 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:43:11,030 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:43:11,295 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:43:11,571 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:43:11,728 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:43:11,923 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:43:12,151 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:43:12,297 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:43:12,728 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:43:12,939 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:43:13,096 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:43:13,898 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:43:14,333 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:43:14,684 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:43:14,993 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:43:15,254 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 07:43:15,427 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:43:16,084 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 07:43:19,787 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 07:43:20,471 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:43:20,904 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:43:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:21,740 INFO L93 Difference]: Finished difference Result 114832 states and 155334 transitions. [2019-09-10 07:43:21,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 266 states. [2019-09-10 07:43:21,740 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2019-09-10 07:43:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:21,973 INFO L225 Difference]: With dead ends: 114832 [2019-09-10 07:43:21,973 INFO L226 Difference]: Without dead ends: 114832 [2019-09-10 07:43:22,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35638 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=11833, Invalid=80279, Unknown=0, NotChecked=0, Total=92112 [2019-09-10 07:43:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114832 states. [2019-09-10 07:43:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114832 to 47862. [2019-09-10 07:43:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47862 states. [2019-09-10 07:43:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47862 states to 47862 states and 65585 transitions. [2019-09-10 07:43:23,293 INFO L78 Accepts]: Start accepts. Automaton has 47862 states and 65585 transitions. Word has length 84 [2019-09-10 07:43:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:23,294 INFO L475 AbstractCegarLoop]: Abstraction has 47862 states and 65585 transitions. [2019-09-10 07:43:23,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 07:43:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 47862 states and 65585 transitions. [2019-09-10 07:43:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:43:23,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:23,301 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:23,301 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:23,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2085307495, now seen corresponding path program 1 times [2019-09-10 07:43:23,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:23,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:23,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:23,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:23,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:23,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:43:23,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 07:43:23,548 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [103], [105], [108], [111], [116], [118], [121], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [174], [176], [179], [182], [184], [192], [195], [201], [204], [207], [209], [217], [220], [226], [229], [232], [234], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:43:23,550 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:43:23,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:43:23,566 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:43:23,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:43:23,800 INFO L272 AbstractInterpreter]: Visited 79 different actions 529 times. Merged at 49 different actions 398 times. Widened at 14 different actions 47 times. Performed 1754 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1754 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 13 different actions. Largest state had 109 variables. [2019-09-10 07:43:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:23,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:43:23,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:23,801 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:43:23,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:23,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:43:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:23,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:43:23,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:43:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:24,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:43:24,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:24,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:43:24,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 07:43:24,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:43:24,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:43:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:43:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:43:24,495 INFO L87 Difference]: Start difference. First operand 47862 states and 65585 transitions. Second operand 17 states. [2019-09-10 07:43:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:27,984 INFO L93 Difference]: Finished difference Result 243633 states and 329640 transitions. [2019-09-10 07:43:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 07:43:27,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 07:43:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:28,353 INFO L225 Difference]: With dead ends: 243633 [2019-09-10 07:43:28,353 INFO L226 Difference]: Without dead ends: 243633 [2019-09-10 07:43:28,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 158 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=808, Invalid=2272, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:43:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243633 states. [2019-09-10 07:43:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243633 to 109726. [2019-09-10 07:43:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109726 states. [2019-09-10 07:43:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109726 states to 109726 states and 150217 transitions. [2019-09-10 07:43:30,301 INFO L78 Accepts]: Start accepts. Automaton has 109726 states and 150217 transitions. Word has length 85 [2019-09-10 07:43:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:30,301 INFO L475 AbstractCegarLoop]: Abstraction has 109726 states and 150217 transitions. [2019-09-10 07:43:30,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:43:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 109726 states and 150217 transitions. [2019-09-10 07:43:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:43:30,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:30,312 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:30,312 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1833088786, now seen corresponding path program 1 times [2019-09-10 07:43:30,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:30,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:30,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:30,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:30,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:43:30,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:30,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:43:30,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:30,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:43:30,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:43:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:43:30,356 INFO L87 Difference]: Start difference. First operand 109726 states and 150217 transitions. Second operand 3 states. [2019-09-10 07:43:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:32,259 INFO L93 Difference]: Finished difference Result 84169 states and 114560 transitions. [2019-09-10 07:43:32,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:43:32,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:43:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:32,362 INFO L225 Difference]: With dead ends: 84169 [2019-09-10 07:43:32,362 INFO L226 Difference]: Without dead ends: 84169 [2019-09-10 07:43:32,363 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:43:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84169 states. [2019-09-10 07:43:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84169 to 84169. [2019-09-10 07:43:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84169 states. [2019-09-10 07:43:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84169 states to 84169 states and 114560 transitions. [2019-09-10 07:43:33,235 INFO L78 Accepts]: Start accepts. Automaton has 84169 states and 114560 transitions. Word has length 85 [2019-09-10 07:43:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:33,235 INFO L475 AbstractCegarLoop]: Abstraction has 84169 states and 114560 transitions. [2019-09-10 07:43:33,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:43:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 84169 states and 114560 transitions. [2019-09-10 07:43:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:43:33,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:33,242 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:33,242 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash 131295856, now seen corresponding path program 1 times [2019-09-10 07:43:33,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:33,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:33,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:43:33,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:33,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:43:33,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:33,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:43:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:43:33,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:43:33,292 INFO L87 Difference]: Start difference. First operand 84169 states and 114560 transitions. Second operand 3 states. [2019-09-10 07:43:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:33,496 INFO L93 Difference]: Finished difference Result 69788 states and 94055 transitions. [2019-09-10 07:43:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:43:33,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:43:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:33,580 INFO L225 Difference]: With dead ends: 69788 [2019-09-10 07:43:33,580 INFO L226 Difference]: Without dead ends: 69788 [2019-09-10 07:43:33,581 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:43:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69788 states. [2019-09-10 07:43:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69788 to 69788. [2019-09-10 07:43:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69788 states. [2019-09-10 07:43:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69788 states to 69788 states and 94055 transitions. [2019-09-10 07:43:34,663 INFO L78 Accepts]: Start accepts. Automaton has 69788 states and 94055 transitions. Word has length 86 [2019-09-10 07:43:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:34,663 INFO L475 AbstractCegarLoop]: Abstraction has 69788 states and 94055 transitions. [2019-09-10 07:43:34,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:43:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 69788 states and 94055 transitions. [2019-09-10 07:43:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:43:34,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:34,667 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:43:34,667 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1788120362, now seen corresponding path program 1 times [2019-09-10 07:43:34,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:34,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:34,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:34,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:34,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:43:34,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:43:34,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:43:34,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:43:34,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:43:34,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:43:34,714 INFO L87 Difference]: Start difference. First operand 69788 states and 94055 transitions. Second operand 3 states. [2019-09-10 07:43:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:34,795 INFO L93 Difference]: Finished difference Result 35818 states and 47501 transitions. [2019-09-10 07:43:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:43:34,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:43:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:34,823 INFO L225 Difference]: With dead ends: 35818 [2019-09-10 07:43:34,823 INFO L226 Difference]: Without dead ends: 35818 [2019-09-10 07:43:34,824 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:43:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35818 states. [2019-09-10 07:43:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35818 to 35816. [2019-09-10 07:43:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35816 states. [2019-09-10 07:43:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35816 states to 35816 states and 47500 transitions. [2019-09-10 07:43:35,066 INFO L78 Accepts]: Start accepts. Automaton has 35816 states and 47500 transitions. Word has length 86 [2019-09-10 07:43:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:43:35,066 INFO L475 AbstractCegarLoop]: Abstraction has 35816 states and 47500 transitions. [2019-09-10 07:43:35,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:43:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 35816 states and 47500 transitions. [2019-09-10 07:43:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:43:35,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:43:35,069 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:43:35,069 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:43:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1683522070, now seen corresponding path program 1 times [2019-09-10 07:43:35,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:43:35,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:35,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:35,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:43:35,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:43:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:36,570 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:43:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:37,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:37,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:43:37,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2019-09-10 07:43:37,343 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [116], [118], [121], [124], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [167], [170], [176], [179], [182], [184], [192], [195], [201], [204], [207], [209], [226], [229], [232], [234], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:43:37,345 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:43:37,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:43:37,359 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:43:37,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:43:37,644 INFO L272 AbstractInterpreter]: Visited 80 different actions 637 times. Merged at 50 different actions 497 times. Widened at 15 different actions 68 times. Performed 2095 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2095 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 56 fixpoints after 13 different actions. Largest state had 109 variables. [2019-09-10 07:43:37,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:43:37,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:43:37,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:43:37,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:43:37,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:43:37,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:43:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:43:37,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 07:43:37,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:43:38,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:43:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:39,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:43:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:43:40,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:43:40,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 45 [2019-09-10 07:43:40,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:43:40,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 07:43:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 07:43:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1839, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:43:40,017 INFO L87 Difference]: Start difference. First operand 35816 states and 47500 transitions. Second operand 35 states. [2019-09-10 07:43:40,202 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:43:41,237 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:43:41,434 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:43:41,752 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 07:43:41,994 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:43:42,349 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 07:43:42,712 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-09-10 07:43:43,218 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-09-10 07:43:43,700 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2019-09-10 07:43:44,439 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 110 [2019-09-10 07:43:45,501 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 128 [2019-09-10 07:43:45,957 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2019-09-10 07:43:46,482 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2019-09-10 07:43:47,687 WARN L188 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 187 DAG size of output: 144 [2019-09-10 07:43:48,921 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 195 DAG size of output: 149 [2019-09-10 07:43:49,833 WARN L188 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 124 [2019-09-10 07:43:50,304 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 07:43:51,205 WARN L188 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 129 [2019-09-10 07:43:51,574 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-10 07:43:51,986 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-09-10 07:43:52,438 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 07:43:52,785 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-09-10 07:43:53,127 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:43:53,470 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 07:43:53,737 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:43:53,940 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 07:43:54,192 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 07:43:54,387 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:43:54,718 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:43:54,984 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 07:43:55,284 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:43:55,737 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-10 07:43:56,038 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 07:43:56,352 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:43:56,625 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:43:56,860 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 07:43:57,219 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 07:43:57,549 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 07:43:58,010 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2019-09-10 07:43:58,291 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 07:43:58,753 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 07:43:59,074 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 07:43:59,544 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 07:43:59,810 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:44:00,154 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:44:00,352 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 07:44:00,847 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:44:01,111 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 07:44:01,553 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 07:44:02,089 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:44:02,310 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:44:02,646 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-09-10 07:44:02,838 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:44:03,297 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 07:44:03,561 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-09-10 07:44:03,902 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:44:04,055 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:44:04,800 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:44:05,209 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:44:05,664 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 07:44:06,023 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 07:44:06,231 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:44:06,563 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 07:44:06,883 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:44:07,182 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:44:07,782 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-09-10 07:44:08,205 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:44:08,943 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:44:09,453 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 07:44:09,774 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-10 07:44:10,145 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 07:44:10,468 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:44:10,779 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:44:11,102 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-09-10 07:44:11,682 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-09-10 07:44:12,107 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-10 07:44:12,523 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:44:12,726 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:44:12,934 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 07:44:13,187 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:44:13,440 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:44:13,660 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:44:14,178 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:44:14,517 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:44:14,956 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:44:15,435 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 07:44:15,899 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 07:44:16,329 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-09-10 07:44:16,599 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 07:44:16,915 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-10 07:44:17,127 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:44:17,404 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 07:44:17,642 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 07:44:18,100 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:44:18,434 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-10 07:44:18,956 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-09-10 07:44:19,151 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:44:19,382 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 07:44:19,649 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 07:44:20,035 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 07:44:20,400 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:20,834 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 07:44:21,173 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 07:44:21,568 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:44:21,745 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:44:22,877 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:44:23,136 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 07:44:23,368 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:44:23,789 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:23,976 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 07:44:24,806 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:44:25,323 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:44:25,659 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 07:44:26,040 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:44:26,266 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:44:26,928 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2019-09-10 07:44:27,654 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 102 [2019-09-10 07:44:27,943 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2019-09-10 07:44:28,575 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2019-09-10 07:44:28,993 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-09-10 07:44:29,408 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2019-09-10 07:44:29,647 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-09-10 07:44:30,059 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-09-10 07:44:30,377 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2019-09-10 07:44:30,905 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:44:31,216 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-09-10 07:44:31,433 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:44:32,112 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-09-10 07:44:32,642 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 104 [2019-09-10 07:44:33,070 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 102 [2019-09-10 07:44:33,661 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:44:34,169 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 07:44:34,758 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2019-09-10 07:44:35,008 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-09-10 07:44:35,240 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:44:35,575 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:44:36,611 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-09-10 07:44:37,091 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 105 [2019-09-10 07:44:37,473 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-09-10 07:44:37,836 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 07:44:38,022 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:44:38,249 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:44:38,729 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-10 07:44:39,285 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-09-10 07:44:39,990 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 114 [2019-09-10 07:44:40,253 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 07:44:40,485 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:44:40,875 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:44:41,125 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:44:41,655 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 07:44:41,943 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 07:44:42,656 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 101 [2019-09-10 07:44:43,092 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-09-10 07:44:43,393 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-09-10 07:44:43,763 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:44:44,026 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:44:44,287 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:44:44,630 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:44:45,449 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 120 [2019-09-10 07:44:45,733 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 07:44:46,239 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:44:46,518 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:44:46,877 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-10 07:44:47,711 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 84 [2019-09-10 07:44:48,191 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-10 07:44:48,663 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-10 07:44:49,252 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 102 [2019-09-10 07:44:49,951 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 116 [2019-09-10 07:44:50,507 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2019-09-10 07:44:50,914 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 07:44:51,727 WARN L188 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 134 [2019-09-10 07:44:52,275 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 96 [2019-09-10 07:44:52,832 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 108 [2019-09-10 07:44:53,607 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 114 [2019-09-10 07:44:53,791 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-09-10 07:44:54,068 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:44:54,460 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 07:44:55,436 WARN L188 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 118 [2019-09-10 07:44:55,792 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:44:56,103 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-10 07:44:56,968 WARN L188 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 123 [2019-09-10 07:44:57,341 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 07:44:57,690 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:44:57,994 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-09-10 07:44:58,275 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-09-10 07:44:58,806 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-09-10 07:44:59,194 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:44:59,522 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-09-10 07:44:59,864 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:45:00,232 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:45:00,812 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:45:01,164 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:45:01,413 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:45:02,171 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:45:02,773 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:45:03,094 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 07:45:03,514 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-09-10 07:45:03,867 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-10 07:45:04,697 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 07:45:05,055 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 07:45:07,509 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-10 07:45:07,798 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:45:08,084 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 07:45:08,388 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 07:45:09,008 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 07:45:09,411 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 07:45:09,709 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 07:45:10,262 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 07:45:10,558 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-09-10 07:45:11,152 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 07:45:11,585 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-10 07:45:11,782 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:45:12,062 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:45:12,304 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:45:12,584 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:45:12,809 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 07:45:13,302 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 07:45:13,658 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 07:45:13,958 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:45:14,535 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:45:15,007 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:45:15,307 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 07:45:15,761 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:45:15,994 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:45:16,184 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-09-10 07:45:16,563 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 07:45:16,755 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:45:17,017 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:45:17,495 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:45:17,767 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:45:18,201 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-10 07:45:18,415 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 07:45:18,662 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 07:45:18,950 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-10 07:45:19,219 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:45:19,487 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:45:19,742 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:45:20,157 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:45:20,705 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:45:20,988 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-10 07:45:21,296 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 07:45:21,516 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:45:22,023 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-09-10 07:45:22,387 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 07:45:22,823 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 07:45:23,231 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:45:23,642 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 07:45:24,065 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-10 07:45:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:24,505 INFO L93 Difference]: Finished difference Result 184234 states and 245800 transitions. [2019-09-10 07:45:24,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 324 states. [2019-09-10 07:45:24,505 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 86 [2019-09-10 07:45:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:24,674 INFO L225 Difference]: With dead ends: 184234 [2019-09-10 07:45:24,675 INFO L226 Difference]: Without dead ends: 184234 [2019-09-10 07:45:24,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 144 SyntacticMatches, 10 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52808 ImplicationChecksByTransitivity, 89.5s TimeCoverageRelationStatistics Valid=13770, Invalid=114752, Unknown=0, NotChecked=0, Total=128522 [2019-09-10 07:45:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184234 states. [2019-09-10 07:45:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184234 to 36670. [2019-09-10 07:45:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36670 states. [2019-09-10 07:45:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36670 states to 36670 states and 48719 transitions. [2019-09-10 07:45:25,572 INFO L78 Accepts]: Start accepts. Automaton has 36670 states and 48719 transitions. Word has length 86 [2019-09-10 07:45:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:25,573 INFO L475 AbstractCegarLoop]: Abstraction has 36670 states and 48719 transitions. [2019-09-10 07:45:25,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 07:45:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 36670 states and 48719 transitions. [2019-09-10 07:45:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:45:25,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:25,576 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:45:25,576 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:25,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:25,576 INFO L82 PathProgramCache]: Analyzing trace with hash -229751769, now seen corresponding path program 1 times [2019-09-10 07:45:25,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:25,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:25,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 07:45:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:25,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:45:25,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:25,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:45:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:45:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:45:25,616 INFO L87 Difference]: Start difference. First operand 36670 states and 48719 transitions. Second operand 3 states. [2019-09-10 07:45:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:25,670 INFO L93 Difference]: Finished difference Result 10748 states and 14408 transitions. [2019-09-10 07:45:25,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:45:25,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:45:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:25,682 INFO L225 Difference]: With dead ends: 10748 [2019-09-10 07:45:25,682 INFO L226 Difference]: Without dead ends: 10748 [2019-09-10 07:45:25,682 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:45:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10748 states. [2019-09-10 07:45:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10748 to 10748. [2019-09-10 07:45:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10748 states. [2019-09-10 07:45:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10748 states to 10748 states and 14408 transitions. [2019-09-10 07:45:25,794 INFO L78 Accepts]: Start accepts. Automaton has 10748 states and 14408 transitions. Word has length 86 [2019-09-10 07:45:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:25,795 INFO L475 AbstractCegarLoop]: Abstraction has 10748 states and 14408 transitions. [2019-09-10 07:45:25,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:45:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 10748 states and 14408 transitions. [2019-09-10 07:45:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:45:25,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:25,796 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:45:25,797 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1149367248, now seen corresponding path program 1 times [2019-09-10 07:45:25,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:25,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:25,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:25,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:25,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:25,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:25,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:45:25,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:25,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:45:25,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:45:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:45:25,866 INFO L87 Difference]: Start difference. First operand 10748 states and 14408 transitions. Second operand 3 states. [2019-09-10 07:45:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:25,889 INFO L93 Difference]: Finished difference Result 6291 states and 8281 transitions. [2019-09-10 07:45:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:45:25,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:45:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:25,897 INFO L225 Difference]: With dead ends: 6291 [2019-09-10 07:45:25,897 INFO L226 Difference]: Without dead ends: 6291 [2019-09-10 07:45:25,897 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:45:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2019-09-10 07:45:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 6289. [2019-09-10 07:45:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6289 states. [2019-09-10 07:45:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6289 states to 6289 states and 8280 transitions. [2019-09-10 07:45:26,044 INFO L78 Accepts]: Start accepts. Automaton has 6289 states and 8280 transitions. Word has length 87 [2019-09-10 07:45:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:26,044 INFO L475 AbstractCegarLoop]: Abstraction has 6289 states and 8280 transitions. [2019-09-10 07:45:26,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:45:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6289 states and 8280 transitions. [2019-09-10 07:45:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:45:26,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:26,046 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:26,046 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash 555199248, now seen corresponding path program 1 times [2019-09-10 07:45:26,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:26,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:26,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:26,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:26,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:26,513 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 07:45:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:26,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:26,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:26,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-10 07:45:26,737 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], [74], [77], [82], [85], [90], [92], [95], [98], [103], [105], [108], [111], [114], [116], [118], [121], [124], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [167], [170], [176], [179], [182], [184], [201], [204], [207], [209], [217], [220], [226], [229], [232], [234], [242], [247], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:45:26,740 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:26,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:26,753 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:26,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:26,925 INFO L272 AbstractInterpreter]: Visited 81 different actions 449 times. Merged at 51 different actions 327 times. Widened at 13 different actions 32 times. Performed 1502 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1502 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 10 different actions. Largest state had 109 variables. [2019-09-10 07:45:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:26,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:26,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:26,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:45:26,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:26,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:27,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:45:27,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:27,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:27,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:28,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:28,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2019-09-10 07:45:28,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:28,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 07:45:28,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 07:45:28,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:45:28,161 INFO L87 Difference]: Start difference. First operand 6289 states and 8280 transitions. Second operand 24 states. [2019-09-10 07:45:29,079 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-09-10 07:45:30,816 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-09-10 07:45:31,473 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 07:45:31,824 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:45:32,134 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:45:32,427 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 07:45:32,747 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 07:45:33,044 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2019-09-10 07:45:33,333 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-09-10 07:45:33,570 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 07:45:33,813 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-10 07:45:34,566 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 07:45:35,011 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-10 07:45:35,211 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 07:45:35,470 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 07:45:35,745 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 07:45:36,048 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-10 07:45:36,396 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 07:45:36,769 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-10 07:45:38,771 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-10 07:45:43,533 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-09-10 07:45:45,517 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-10 07:45:46,501 WARN L188 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 07:45:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:47,107 INFO L93 Difference]: Finished difference Result 14790 states and 19409 transitions. [2019-09-10 07:45:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 07:45:47,107 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2019-09-10 07:45:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:47,119 INFO L225 Difference]: With dead ends: 14790 [2019-09-10 07:45:47,119 INFO L226 Difference]: Without dead ends: 14790 [2019-09-10 07:45:47,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4179 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=2211, Invalid=12069, Unknown=0, NotChecked=0, Total=14280 [2019-09-10 07:45:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14790 states. [2019-09-10 07:45:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14790 to 5449. [2019-09-10 07:45:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2019-09-10 07:45:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 7255 transitions. [2019-09-10 07:45:47,188 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 7255 transitions. Word has length 87 [2019-09-10 07:45:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:47,188 INFO L475 AbstractCegarLoop]: Abstraction has 5449 states and 7255 transitions. [2019-09-10 07:45:47,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 07:45:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 7255 transitions. [2019-09-10 07:45:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:45:47,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:47,189 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:45:47,189 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash -957292330, now seen corresponding path program 1 times [2019-09-10 07:45:47,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:47,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:47,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 07:45:47,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:47,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:45:47,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:47,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:45:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:45:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:45:47,232 INFO L87 Difference]: Start difference. First operand 5449 states and 7255 transitions. Second operand 3 states. [2019-09-10 07:45:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:47,271 INFO L93 Difference]: Finished difference Result 3666 states and 4821 transitions. [2019-09-10 07:45:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:45:47,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:45:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:47,275 INFO L225 Difference]: With dead ends: 3666 [2019-09-10 07:45:47,275 INFO L226 Difference]: Without dead ends: 3666 [2019-09-10 07:45:47,275 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:45:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2019-09-10 07:45:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 3666. [2019-09-10 07:45:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3666 states. [2019-09-10 07:45:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4821 transitions. [2019-09-10 07:45:47,308 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4821 transitions. Word has length 88 [2019-09-10 07:45:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:47,308 INFO L475 AbstractCegarLoop]: Abstraction has 3666 states and 4821 transitions. [2019-09-10 07:45:47,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:45:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4821 transitions. [2019-09-10 07:45:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:45:47,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:47,310 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-09-10 07:45:47,310 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1945287635, now seen corresponding path program 1 times [2019-09-10 07:45:47,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:47,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:47,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:47,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:47,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:47,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 07:45:47,373 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [163], [167], [170], [176], [179], [182], [184], [201], [204], [207], [209], [226], [229], [232], [234], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:45:47,374 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:47,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:47,387 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:47,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:47,728 INFO L272 AbstractInterpreter]: Visited 79 different actions 749 times. Merged at 49 different actions 597 times. Widened at 17 different actions 106 times. Performed 2404 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2404 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 69 fixpoints after 19 different actions. Largest state had 109 variables. [2019-09-10 07:45:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:47,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:47,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:47,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:47,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:47,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:45:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:47,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:45:47,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:47,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:47,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2019-09-10 07:45:47,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:47,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:45:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:45:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:45:47,978 INFO L87 Difference]: Start difference. First operand 3666 states and 4821 transitions. Second operand 10 states. [2019-09-10 07:45:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:48,268 INFO L93 Difference]: Finished difference Result 3582 states and 4617 transitions. [2019-09-10 07:45:48,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:45:48,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-09-10 07:45:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:48,271 INFO L225 Difference]: With dead ends: 3582 [2019-09-10 07:45:48,271 INFO L226 Difference]: Without dead ends: 3582 [2019-09-10 07:45:48,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:45:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2019-09-10 07:45:48,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3270. [2019-09-10 07:45:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2019-09-10 07:45:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4243 transitions. [2019-09-10 07:45:48,292 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4243 transitions. Word has length 114 [2019-09-10 07:45:48,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:48,292 INFO L475 AbstractCegarLoop]: Abstraction has 3270 states and 4243 transitions. [2019-09-10 07:45:48,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:45:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4243 transitions. [2019-09-10 07:45:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 07:45:48,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:48,294 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:45:48,294 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1627046488, now seen corresponding path program 1 times [2019-09-10 07:45:48,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:48,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:48,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 07:45:48,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:45:48,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:45:48,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:45:48,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:45:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:45:48,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:45:48,359 INFO L87 Difference]: Start difference. First operand 3270 states and 4243 transitions. Second operand 3 states. [2019-09-10 07:45:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:45:48,370 INFO L93 Difference]: Finished difference Result 1738 states and 2226 transitions. [2019-09-10 07:45:48,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:45:48,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 07:45:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:48,372 INFO L225 Difference]: With dead ends: 1738 [2019-09-10 07:45:48,372 INFO L226 Difference]: Without dead ends: 1738 [2019-09-10 07:45:48,372 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:45:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-10 07:45:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-09-10 07:45:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-09-10 07:45:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2225 transitions. [2019-09-10 07:45:48,387 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2225 transitions. Word has length 139 [2019-09-10 07:45:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:48,387 INFO L475 AbstractCegarLoop]: Abstraction has 1736 states and 2225 transitions. [2019-09-10 07:45:48,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:45:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2225 transitions. [2019-09-10 07:45:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 07:45:48,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:48,389 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:45:48,389 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -39973736, now seen corresponding path program 1 times [2019-09-10 07:45:48,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:48,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:48,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:48,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 35 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:48,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:48,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:48,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2019-09-10 07:45:48,655 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [127], [129], [131], [134], [137], [141], [143], [146], [147], [149], [151], [156], [158], [161], [174], [176], [179], [182], [184], [199], [201], [204], [207], [209], [224], [226], [229], [232], [234], [249], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:45:48,657 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:48,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:48,669 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:49,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:49,182 INFO L272 AbstractInterpreter]: Visited 84 different actions 1088 times. Merged at 53 different actions 811 times. Widened at 22 different actions 180 times. Performed 3459 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3459 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 182 fixpoints after 28 different actions. Largest state had 109 variables. [2019-09-10 07:45:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:49,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:49,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:49,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:45:49,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:49,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:49,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:45:49,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:49,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 49 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:50,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:50,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:50,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:51,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 43 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:52,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:52,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:45:52,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:52,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:45:52,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:45:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:45:52,022 INFO L87 Difference]: Start difference. First operand 1736 states and 2225 transitions. Second operand 21 states. [2019-09-10 07:45:52,530 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:45:53,175 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:45:53,598 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:45:53,966 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:45:54,438 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 07:45:54,905 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:45:55,225 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:45:55,738 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 07:45:56,076 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:45:56,428 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 07:45:56,689 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:45:57,275 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:45:57,712 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:45:58,154 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-09-10 07:45:58,649 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-09-10 07:45:59,497 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:45:59,804 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:46:00,104 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:46:00,782 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:46:01,084 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:46:01,467 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:46:01,839 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 07:46:02,202 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:46:02,507 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 07:46:02,804 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:46:03,373 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:46:03,675 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 07:46:04,100 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 07:46:04,529 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-09-10 07:46:04,970 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:46:05,420 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 07:46:05,890 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-09-10 07:46:06,291 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:46:06,559 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:46:06,978 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 07:46:08,094 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 07:46:08,565 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 07:46:09,020 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:46:09,609 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:46:10,006 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:46:10,349 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:46:10,689 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:46:11,142 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 07:46:11,451 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:46:11,947 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:46:12,551 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:46:12,996 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-10 07:46:13,459 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:46:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:13,649 INFO L93 Difference]: Finished difference Result 13662 states and 17624 transitions. [2019-09-10 07:46:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 07:46:13,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 139 [2019-09-10 07:46:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:13,660 INFO L225 Difference]: With dead ends: 13662 [2019-09-10 07:46:13,660 INFO L226 Difference]: Without dead ends: 13662 [2019-09-10 07:46:13,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 235 SyntacticMatches, 25 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=1546, Invalid=5096, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 07:46:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13662 states. [2019-09-10 07:46:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13662 to 6530. [2019-09-10 07:46:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6530 states. [2019-09-10 07:46:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6530 states to 6530 states and 8238 transitions. [2019-09-10 07:46:13,731 INFO L78 Accepts]: Start accepts. Automaton has 6530 states and 8238 transitions. Word has length 139 [2019-09-10 07:46:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:13,731 INFO L475 AbstractCegarLoop]: Abstraction has 6530 states and 8238 transitions. [2019-09-10 07:46:13,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:46:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6530 states and 8238 transitions. [2019-09-10 07:46:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:46:13,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:13,735 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:46:13,735 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash -298203361, now seen corresponding path program 1 times [2019-09-10 07:46:13,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:13,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:13,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:13,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:14,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:14,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:14,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:46:14,024 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [127], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [174], [176], [179], [182], [184], [199], [201], [204], [207], [209], [217], [220], [226], [229], [232], [234], [242], [245], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:46:14,028 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:14,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:14,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:14,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:14,485 INFO L272 AbstractInterpreter]: Visited 84 different actions 1121 times. Merged at 54 different actions 858 times. Widened at 21 different actions 156 times. Performed 3564 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 167 fixpoints after 26 different actions. Largest state had 109 variables. [2019-09-10 07:46:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:14,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:14,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:14,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:14,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:14,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:46:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:14,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:46:14,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:14,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:14,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 23 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:15,153 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:15,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:15,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:17,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:17,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:17,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:46:17,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:17,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:46:17,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:46:17,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:46:17,353 INFO L87 Difference]: Start difference. First operand 6530 states and 8238 transitions. Second operand 20 states. [2019-09-10 07:46:17,667 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:46:18,299 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:46:18,658 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:46:18,972 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:46:19,155 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:46:19,642 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:46:19,889 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:46:20,293 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:46:20,608 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:46:20,988 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:46:21,441 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:46:21,708 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:46:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:21,723 INFO L93 Difference]: Finished difference Result 7618 states and 9554 transitions. [2019-09-10 07:46:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:46:21,724 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 140 [2019-09-10 07:46:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:21,734 INFO L225 Difference]: With dead ends: 7618 [2019-09-10 07:46:21,734 INFO L226 Difference]: Without dead ends: 7618 [2019-09-10 07:46:21,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 243 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=408, Invalid=1232, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:46:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7618 states. [2019-09-10 07:46:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7618 to 6530. [2019-09-10 07:46:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6530 states. [2019-09-10 07:46:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6530 states to 6530 states and 8201 transitions. [2019-09-10 07:46:21,805 INFO L78 Accepts]: Start accepts. Automaton has 6530 states and 8201 transitions. Word has length 140 [2019-09-10 07:46:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:21,805 INFO L475 AbstractCegarLoop]: Abstraction has 6530 states and 8201 transitions. [2019-09-10 07:46:21,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:46:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6530 states and 8201 transitions. [2019-09-10 07:46:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 07:46:21,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:21,810 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:46:21,811 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1714943570, now seen corresponding path program 1 times [2019-09-10 07:46:21,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:21,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:21,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:21,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:24,146 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2019-09-10 07:46:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 30 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:24,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:24,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:46:24,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2019-09-10 07:46:24,345 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], [74], [77], [82], [85], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [127], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [174], [176], [179], [182], [184], [192], [195], [201], [204], [207], [209], [224], [226], [229], [232], [234], [242], [245], [247], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:46:24,347 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:46:24,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:46:24,358 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:46:24,797 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:46:24,798 INFO L272 AbstractInterpreter]: Visited 84 different actions 1195 times. Merged at 54 different actions 919 times. Widened at 23 different actions 196 times. Performed 3872 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 178 fixpoints after 25 different actions. Largest state had 109 variables. [2019-09-10 07:46:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:24,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:46:24,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:46:24,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:46:24,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:24,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:46:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:24,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 07:46:24,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:46:25,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:25,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:25,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:25,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:25,825 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:46:26,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:46:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:46:26,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:46:26,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 31 [2019-09-10 07:46:26,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:46:26,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:46:26,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:46:26,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:46:26,266 INFO L87 Difference]: Start difference. First operand 6530 states and 8201 transitions. Second operand 25 states. [2019-09-10 07:46:27,359 WARN L188 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2019-09-10 07:46:28,054 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-09-10 07:46:28,718 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-09-10 07:46:29,476 WARN L188 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-09-10 07:46:29,748 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:46:29,969 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:46:30,203 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:46:30,589 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:46:31,065 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-10 07:46:31,765 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 07:46:32,769 WARN L188 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 07:46:33,465 WARN L188 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-09-10 07:46:36,767 WARN L188 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 07:46:37,663 WARN L188 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-09-10 07:46:38,647 WARN L188 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 77 [2019-09-10 07:46:41,541 WARN L188 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 117 DAG size of output: 77 [2019-09-10 07:46:43,215 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2019-09-10 07:46:43,936 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 88 [2019-09-10 07:46:44,868 WARN L188 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-09-10 07:46:45,295 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-09-10 07:46:45,657 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-09-10 07:46:46,853 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 122 DAG size of output: 95 [2019-09-10 07:46:48,950 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 117 DAG size of output: 89 [2019-09-10 07:46:49,699 WARN L188 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-10 07:46:50,199 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-09-10 07:46:51,293 WARN L188 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-09-10 07:46:51,779 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2019-09-10 07:46:57,130 WARN L188 SmtUtils]: Spent 5.17 s on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-09-10 07:46:57,802 WARN L188 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-09-10 07:46:58,495 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-09-10 07:46:59,208 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-10 07:47:00,798 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 07:47:01,738 WARN L188 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2019-09-10 07:47:02,346 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 07:47:02,799 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2019-09-10 07:47:04,745 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-09-10 07:47:05,108 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 07:47:05,565 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:47:06,001 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2019-09-10 07:47:06,542 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-09-10 07:47:07,115 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-09-10 07:47:07,524 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 07:47:08,356 WARN L188 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 07:47:09,204 WARN L188 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2019-09-10 07:47:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:09,305 INFO L93 Difference]: Finished difference Result 8352 states and 10300 transitions. [2019-09-10 07:47:09,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 07:47:09,306 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2019-09-10 07:47:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:09,315 INFO L225 Difference]: With dead ends: 8352 [2019-09-10 07:47:09,316 INFO L226 Difference]: Without dead ends: 8352 [2019-09-10 07:47:09,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 264 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=1231, Invalid=4319, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 07:47:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8352 states. [2019-09-10 07:47:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8352 to 1688. [2019-09-10 07:47:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2019-09-10 07:47:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2078 transitions. [2019-09-10 07:47:09,356 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2078 transitions. Word has length 141 [2019-09-10 07:47:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:09,356 INFO L475 AbstractCegarLoop]: Abstraction has 1688 states and 2078 transitions. [2019-09-10 07:47:09,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:47:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2078 transitions. [2019-09-10 07:47:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 07:47:09,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:09,358 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:47:09,359 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:09,359 INFO L82 PathProgramCache]: Analyzing trace with hash 908598326, now seen corresponding path program 1 times [2019-09-10 07:47:09,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:09,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:09,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:09,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:09,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 13 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:09,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:09,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:09,674 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2019-09-10 07:47:09,675 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [127], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [174], [176], [179], [182], [184], [192], [195], [201], [204], [207], [209], [226], [229], [232], [234], [242], [245], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:47:09,676 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:09,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:09,687 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:09,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:09,964 INFO L272 AbstractInterpreter]: Visited 83 different actions 1025 times. Merged at 53 different actions 794 times. Widened at 19 different actions 145 times. Performed 3205 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 140 fixpoints after 22 different actions. Largest state had 109 variables. [2019-09-10 07:47:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:09,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:09,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:09,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:09,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:47:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:10,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:47:10,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:10,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 17 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:10,707 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:10,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:10,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:12,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 13 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:12,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:12,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:47:12,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:12,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:47:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:47:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:47:12,950 INFO L87 Difference]: Start difference. First operand 1688 states and 2078 transitions. Second operand 20 states. [2019-09-10 07:47:13,227 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:47:13,751 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:47:14,377 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:47:14,870 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:47:15,401 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:47:15,643 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:47:16,038 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:47:16,319 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:47:16,563 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:47:16,868 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:47:17,346 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:47:17,838 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:47:18,114 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:47:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:18,123 INFO L93 Difference]: Finished difference Result 1939 states and 2357 transitions. [2019-09-10 07:47:18,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:47:18,123 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 141 [2019-09-10 07:47:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:18,125 INFO L225 Difference]: With dead ends: 1939 [2019-09-10 07:47:18,125 INFO L226 Difference]: Without dead ends: 1939 [2019-09-10 07:47:18,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 244 SyntacticMatches, 25 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:47:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-09-10 07:47:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1688. [2019-09-10 07:47:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2019-09-10 07:47:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2067 transitions. [2019-09-10 07:47:18,138 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2067 transitions. Word has length 141 [2019-09-10 07:47:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:18,139 INFO L475 AbstractCegarLoop]: Abstraction has 1688 states and 2067 transitions. [2019-09-10 07:47:18,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:47:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2067 transitions. [2019-09-10 07:47:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 07:47:18,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:18,141 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:47:18,141 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash -707439243, now seen corresponding path program 1 times [2019-09-10 07:47:18,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:18,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:18,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:18,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 22 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:18,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:18,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:18,586 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2019-09-10 07:47:18,586 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [127], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [176], [179], [182], [184], [192], [195], [201], [204], [207], [209], [226], [229], [232], [234], [242], [245], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:47:18,587 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:18,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:18,598 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:18,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:18,867 INFO L272 AbstractInterpreter]: Visited 82 different actions 1056 times. Merged at 52 different actions 843 times. Widened at 18 different actions 151 times. Performed 3145 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3145 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 126 fixpoints after 21 different actions. Largest state had 109 variables. [2019-09-10 07:47:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:18,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:18,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:18,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:18,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:18,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:47:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:18,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 07:47:18,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:19,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:19,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:19,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:19,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 40 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:20,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:20,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:20,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:21,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:21,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:22,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:22,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:47:22,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:47:25,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:47:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 40 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:25,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:25,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 49 [2019-09-10 07:47:25,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:25,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 07:47:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 07:47:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2180, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:47:25,486 INFO L87 Difference]: Start difference. First operand 1688 states and 2067 transitions. Second operand 34 states. [2019-09-10 07:47:25,762 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 07:47:27,376 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 07:47:28,414 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:47:28,854 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:47:33,630 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:47:37,433 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:47:38,323 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:47:41,059 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:47:41,601 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:47:42,303 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 07:47:42,911 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:47:43,393 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:47:44,084 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:47:44,534 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:47:45,155 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:47:46,821 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:47:48,969 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:47:51,345 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:47:52,016 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:47:54,052 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:47:54,873 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:47:55,471 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:47:56,517 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:48:00,170 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:48:03,624 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:48:10,146 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:48:11,945 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:48:16,224 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:48:17,796 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:48:19,505 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:48:20,098 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 07:48:20,770 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:48:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:20,869 INFO L93 Difference]: Finished difference Result 13434 states and 16314 transitions. [2019-09-10 07:48:20,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-09-10 07:48:20,869 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 142 [2019-09-10 07:48:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:20,879 INFO L225 Difference]: With dead ends: 13434 [2019-09-10 07:48:20,879 INFO L226 Difference]: Without dead ends: 13434 [2019-09-10 07:48:20,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 218 SyntacticMatches, 36 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21274 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=5055, Invalid=56697, Unknown=0, NotChecked=0, Total=61752 [2019-09-10 07:48:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13434 states. [2019-09-10 07:48:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13434 to 6567. [2019-09-10 07:48:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6567 states. [2019-09-10 07:48:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 8076 transitions. [2019-09-10 07:48:20,950 INFO L78 Accepts]: Start accepts. Automaton has 6567 states and 8076 transitions. Word has length 142 [2019-09-10 07:48:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:20,950 INFO L475 AbstractCegarLoop]: Abstraction has 6567 states and 8076 transitions. [2019-09-10 07:48:20,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 07:48:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6567 states and 8076 transitions. [2019-09-10 07:48:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 07:48:20,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:20,953 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:48:20,953 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1104182933, now seen corresponding path program 1 times [2019-09-10 07:48:20,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:20,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:20,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:20,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:22,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:22,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:22,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2019-09-10 07:48:22,061 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [127], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [167], [170], [176], [179], [182], [184], [201], [204], [207], [209], [217], [220], [226], [229], [232], [234], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:48:22,064 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:22,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:22,075 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:22,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:22,373 INFO L272 AbstractInterpreter]: Visited 82 different actions 933 times. Merged at 51 different actions 733 times. Widened at 17 different actions 144 times. Performed 2953 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2953 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 113 fixpoints after 20 different actions. Largest state had 109 variables. [2019-09-10 07:48:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:22,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:22,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:22,374 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:22,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:22,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 07:48:22,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:22,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:22,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:23,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:23,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:23,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:24,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:24,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:24,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:25,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:25,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:25,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:25,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:27,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:48:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:27,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:27,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 49 [2019-09-10 07:48:27,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:27,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 07:48:27,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 07:48:27,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:48:27,532 INFO L87 Difference]: Start difference. First operand 6567 states and 8076 transitions. Second operand 34 states. [2019-09-10 07:48:29,152 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 07:48:29,940 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-10 07:48:30,730 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 07:48:31,452 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 07:48:33,203 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 07:48:34,480 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:48:37,235 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:48:37,478 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:48:41,392 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-09-10 07:48:46,652 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-09-10 07:48:46,887 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:48:49,559 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:48:52,708 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-10 07:48:53,443 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 07:48:54,168 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 07:48:54,341 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:48:54,943 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 07:48:55,433 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 07:48:55,686 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 07:48:59,481 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 45 [2019-09-10 07:48:59,786 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:49:02,358 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-09-10 07:49:07,115 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-09-10 07:49:07,467 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-09-10 07:49:12,991 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-09-10 07:49:16,307 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2019-09-10 07:49:16,826 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-10 07:49:17,266 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-09-10 07:49:21,596 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2019-09-10 07:49:22,293 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-10 07:49:22,637 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 07:49:23,096 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 07:49:24,607 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-09-10 07:49:25,907 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2019-09-10 07:49:26,131 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:49:26,733 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:49:31,146 WARN L188 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2019-09-10 07:49:34,299 WARN L188 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-09-10 07:49:34,530 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:49:37,261 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2019-09-10 07:49:37,667 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:49:37,899 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:49:38,136 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:49:38,523 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:49:41,182 WARN L188 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2019-09-10 07:49:41,425 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:49:44,719 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2019-09-10 07:49:45,453 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:49:50,514 WARN L188 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2019-09-10 07:49:50,713 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:49:50,968 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 07:49:54,671 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2019-09-10 07:49:58,686 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:50:03,566 WARN L188 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 56 [2019-09-10 07:50:04,002 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:50:08,612 WARN L188 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2019-09-10 07:50:09,563 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 52 [2019-09-10 07:50:13,444 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:50:16,256 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 07:50:16,452 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:50:19,659 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:50:20,055 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:50:30,108 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 52 [2019-09-10 07:50:33,388 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:50:42,712 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 112 DAG size of output: 56 [2019-09-10 07:50:43,951 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2019-09-10 07:50:49,483 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-09-10 07:50:49,772 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:50:54,447 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 07:50:55,376 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:50:59,706 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 07:51:03,738 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2019-09-10 07:51:04,894 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 45 [2019-09-10 07:51:07,313 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:51:07,539 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 07:51:08,506 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2019-09-10 07:51:09,940 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-09-10 07:51:11,435 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-09-10 07:51:14,356 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 49 [2019-09-10 07:51:16,305 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 07:51:16,595 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 07:51:17,425 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-09-10 07:51:20,212 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-09-10 07:51:21,332 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-10 07:51:23,637 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:51:23,967 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:51:24,226 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 07:51:24,448 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 07:51:24,723 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:51:27,553 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2019-09-10 07:51:27,784 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:51:28,082 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 07:51:28,271 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 07:51:28,492 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:51:28,671 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:51:28,946 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:51:29,256 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:51:35,194 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 108 DAG size of output: 57 [2019-09-10 07:51:35,711 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2019-09-10 07:51:36,510 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2019-09-10 07:51:36,812 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-10 07:51:37,045 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 07:51:39,620 WARN L188 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2019-09-10 07:51:42,771 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-09-10 07:51:43,413 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:51:43,605 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 07:51:43,917 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 07:51:44,343 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:51:44,665 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 07:51:48,935 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-09-10 07:51:49,181 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:51:49,428 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:51:49,833 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 07:51:52,015 WARN L188 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2019-09-10 07:51:52,584 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:51:52,839 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:51:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:52,847 INFO L93 Difference]: Finished difference Result 20135 states and 24963 transitions. [2019-09-10 07:51:52,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-10 07:51:52,848 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 142 [2019-09-10 07:51:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:52,863 INFO L225 Difference]: With dead ends: 20135 [2019-09-10 07:51:52,864 INFO L226 Difference]: Without dead ends: 20135 [2019-09-10 07:51:52,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 227 SyntacticMatches, 27 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10985 ImplicationChecksByTransitivity, 116.4s TimeCoverageRelationStatistics Valid=4192, Invalid=30590, Unknown=0, NotChecked=0, Total=34782 [2019-09-10 07:51:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20135 states. [2019-09-10 07:51:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20135 to 11269. [2019-09-10 07:51:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11269 states. [2019-09-10 07:51:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13846 transitions. [2019-09-10 07:51:53,032 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13846 transitions. Word has length 142 [2019-09-10 07:51:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:53,032 INFO L475 AbstractCegarLoop]: Abstraction has 11269 states and 13846 transitions. [2019-09-10 07:51:53,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 07:51:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13846 transitions. [2019-09-10 07:51:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 07:51:53,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:53,036 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:51:53,036 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1983767007, now seen corresponding path program 1 times [2019-09-10 07:51:53,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:53,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:53,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 40 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:54,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:54,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:54,213 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2019-09-10 07:51:54,213 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], [74], [77], [82], [85], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [127], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [167], [170], [176], [179], [182], [184], [201], [204], [207], [209], [226], [229], [232], [234], [242], [245], [247], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:51:54,217 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:54,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:54,226 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:54,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:54,476 INFO L272 AbstractInterpreter]: Visited 82 different actions 984 times. Merged at 52 different actions 778 times. Widened at 16 different actions 130 times. Performed 3085 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3085 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 119 fixpoints after 20 different actions. Largest state had 109 variables. [2019-09-10 07:51:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:54,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:54,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:54,477 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:54,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:51:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:54,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 07:51:54,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:55,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:55,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:55,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:55,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:56,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:56,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:56,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:56,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:59,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:59,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:51:59,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:59,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:59,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:02,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:52:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:03,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 18] total 57 [2019-09-10 07:52:03,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:03,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 07:52:03,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 07:52:03,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3025, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:52:03,395 INFO L87 Difference]: Start difference. First operand 11269 states and 13846 transitions. Second operand 41 states. [2019-09-10 07:52:03,874 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-09-10 07:52:10,344 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 07:52:15,725 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:52:17,068 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-09-10 07:52:17,647 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:52:18,020 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 07:52:18,535 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 07:52:19,130 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:52:20,558 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:52:29,745 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:52:36,529 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-09-10 07:52:40,019 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-09-10 07:52:44,110 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-09-10 07:52:51,611 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-09-10 07:52:59,273 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-09-10 07:53:23,925 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-09-10 07:53:39,434 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-09-10 07:53:59,029 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-10 07:54:00,976 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:54:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:01,191 INFO L93 Difference]: Finished difference Result 16988 states and 20656 transitions. [2019-09-10 07:54:01,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 07:54:01,192 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2019-09-10 07:54:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:01,206 INFO L225 Difference]: With dead ends: 16988 [2019-09-10 07:54:01,206 INFO L226 Difference]: Without dead ends: 16988 [2019-09-10 07:54:01,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 211 SyntacticMatches, 45 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3578 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=1208, Invalid=13072, Unknown=0, NotChecked=0, Total=14280 [2019-09-10 07:54:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16988 states. [2019-09-10 07:54:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16988 to 13506. [2019-09-10 07:54:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13506 states. [2019-09-10 07:54:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13506 states to 13506 states and 16583 transitions. [2019-09-10 07:54:01,365 INFO L78 Accepts]: Start accepts. Automaton has 13506 states and 16583 transitions. Word has length 143 [2019-09-10 07:54:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:01,365 INFO L475 AbstractCegarLoop]: Abstraction has 13506 states and 16583 transitions. [2019-09-10 07:54:01,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 07:54:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 13506 states and 16583 transitions. [2019-09-10 07:54:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 07:54:01,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:01,369 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:54:01,369 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash -471787544, now seen corresponding path program 1 times [2019-09-10 07:54:01,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:01,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:01,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:01,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:01,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:02,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:02,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:02,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2019-09-10 07:54:02,338 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [167], [170], [172], [176], [179], [182], [184], [201], [204], [207], [209], [226], [229], [232], [234], [242], [245], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:54:02,341 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:02,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:02,352 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:02,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:02,607 INFO L272 AbstractInterpreter]: Visited 82 different actions 592 times. Merged at 52 different actions 438 times. Widened at 18 different actions 53 times. Performed 1968 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1968 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 65 fixpoints after 18 different actions. Largest state had 109 variables. [2019-09-10 07:54:02,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:02,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:02,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:02,608 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:54:02,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:02,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:54:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:02,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:54:02,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:54:02,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:02,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 70 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:54:03,268 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:54:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:54:03,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:54:03,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12, 12] total 46 [2019-09-10 07:54:03,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:54:03,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 07:54:03,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 07:54:03,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1936, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 07:54:03,891 INFO L87 Difference]: Start difference. First operand 13506 states and 16583 transitions. Second operand 36 states. [2019-09-10 07:54:04,139 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 07:54:05,481 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 07:54:05,772 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:54:06,030 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:54:58,242 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:55:03,653 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:55:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:40,799 INFO L93 Difference]: Finished difference Result 17891 states and 21718 transitions. [2019-09-10 07:55:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 07:55:40,799 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2019-09-10 07:55:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:40,816 INFO L225 Difference]: With dead ends: 17891 [2019-09-10 07:55:40,817 INFO L226 Difference]: Without dead ends: 17891 [2019-09-10 07:55:40,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 266 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 68.7s TimeCoverageRelationStatistics Valid=1556, Invalid=15214, Unknown=0, NotChecked=0, Total=16770 [2019-09-10 07:55:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17891 states. [2019-09-10 07:55:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17891 to 12047. [2019-09-10 07:55:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12047 states. [2019-09-10 07:55:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12047 states to 12047 states and 14743 transitions. [2019-09-10 07:55:40,928 INFO L78 Accepts]: Start accepts. Automaton has 12047 states and 14743 transitions. Word has length 143 [2019-09-10 07:55:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:40,928 INFO L475 AbstractCegarLoop]: Abstraction has 12047 states and 14743 transitions. [2019-09-10 07:55:40,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 07:55:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 12047 states and 14743 transitions. [2019-09-10 07:55:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 07:55:40,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:40,932 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:55:40,932 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:40,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1050921154, now seen corresponding path program 1 times [2019-09-10 07:55:40,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:40,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:40,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:40,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:40,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:41,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:41,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:41,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2019-09-10 07:55:41,806 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], [74], [77], [82], [85], [88], [90], [92], [95], [98], [101], [103], [105], [108], [111], [114], [116], [118], [121], [124], [127], [129], [131], [134], [137], [141], [143], [146], [147], [149], [151], [156], [158], [161], [176], [179], [182], [184], [201], [204], [207], [209], [226], [229], [232], [234], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:55:41,808 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:41,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:41,826 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:42,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:42,107 INFO L272 AbstractInterpreter]: Visited 80 different actions 683 times. Merged at 49 different actions 524 times. Widened at 16 different actions 89 times. Performed 2205 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 81 fixpoints after 21 different actions. Largest state had 109 variables. [2019-09-10 07:55:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:42,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:42,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:42,108 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:42,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:42,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:42,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 07:55:42,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 11 proven. 87 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:55:42,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 9 proven. 89 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:55:42,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:42,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 7, 7] total 36 [2019-09-10 07:55:42,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:42,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 07:55:42,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 07:55:42,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1157, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:55:42,796 INFO L87 Difference]: Start difference. First operand 12047 states and 14743 transitions. Second operand 31 states. [2019-09-10 07:55:44,410 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 07:55:44,595 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 07:55:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:51,229 INFO L93 Difference]: Finished difference Result 15326 states and 18453 transitions. [2019-09-10 07:55:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-10 07:55:51,230 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2019-09-10 07:55:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:51,260 INFO L225 Difference]: With dead ends: 15326 [2019-09-10 07:55:51,260 INFO L226 Difference]: Without dead ends: 15264 [2019-09-10 07:55:51,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=998, Invalid=7558, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 07:55:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15264 states. [2019-09-10 07:55:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15264 to 12892. [2019-09-10 07:55:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12892 states. [2019-09-10 07:55:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12892 states to 12892 states and 15493 transitions. [2019-09-10 07:55:51,398 INFO L78 Accepts]: Start accepts. Automaton has 12892 states and 15493 transitions. Word has length 143 [2019-09-10 07:55:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:51,398 INFO L475 AbstractCegarLoop]: Abstraction has 12892 states and 15493 transitions. [2019-09-10 07:55:51,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 07:55:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 12892 states and 15493 transitions. [2019-09-10 07:55:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 07:55:51,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:51,403 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 07:55:51,403 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:51,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1905730485, now seen corresponding path program 1 times [2019-09-10 07:55:51,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:51,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:51,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:51,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:51,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:53,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:53,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:53,320 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2019-09-10 07:55:53,321 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], [74], [77], [82], [85], [90], [92], [95], [98], [101], [103], [105], [108], [111], [116], [118], [121], [124], [127], [129], [131], [134], [141], [143], [146], [147], [149], [158], [161], [165], [176], [179], [182], [184], [192], [195], [197], [201], [204], [207], [209], [226], [229], [232], [234], [242], [245], [247], [251], [253], [256], [259], [261], [294], [295], [299], [300], [301] [2019-09-10 07:55:53,323 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:53,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:53,334 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:53,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:53,490 INFO L272 AbstractInterpreter]: Visited 82 different actions 582 times. Merged at 52 different actions 431 times. Widened at 15 different actions 48 times. Performed 1898 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1898 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 64 fixpoints after 16 different actions. Largest state had 109 variables. [2019-09-10 07:55:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:53,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:53,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:53,491 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:53,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:53,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:53,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 07:55:53,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:54,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:54,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:54,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:54,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:55,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:55,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 41 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:56,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:57,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:58,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 41 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:58,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:58,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 22] total 68 [2019-09-10 07:55:58,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:58,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 07:55:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 07:55:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4302, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 07:55:58,602 INFO L87 Difference]: Start difference. First operand 12892 states and 15493 transitions. Second operand 48 states. [2019-09-10 07:56:00,678 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-09-10 07:56:00,923 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-09-10 07:56:01,390 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-10 07:56:01,814 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2019-09-10 07:56:02,194 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2019-09-10 07:56:02,599 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-09-10 07:56:02,981 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-09-10 07:56:03,495 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 07:56:03,969 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-09-10 07:56:04,301 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:56:04,748 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 07:56:05,119 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 07:56:05,572 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83