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/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:09:43,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:09:43,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:09:43,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:09:43,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:09:43,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:09:43,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:09:43,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:09:43,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:09:43,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:09:43,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:09:43,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:09:43,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:09:43,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:09:43,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:09:43,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:09:43,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:09:43,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:09:43,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:09:43,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:09:43,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:09:43,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:09:43,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:09:43,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:09:43,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:09:43,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:09:43,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:09:43,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:09:43,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:09:43,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:09:43,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:09:43,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:09:43,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:09:43,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:09:43,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:09:43,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:09:43,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:09:43,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:09:43,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:09:43,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:09:43,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:09:43,920 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 04:09:43,938 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:09:43,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:09:43,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:09:43,940 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:09:43,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:09:43,941 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:09:43,941 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:09:43,941 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:09:43,941 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:09:43,942 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:09:43,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:09:43,942 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:09:43,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:09:43,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:09:43,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:09:43,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:09:43,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:09:43,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:09:43,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:09:43,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:09:43,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:09:43,945 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:09:43,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:09:43,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:09:43,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:09:43,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:09:43,947 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:09:43,947 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:09:43,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:09:43,947 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:09:43,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:09:44,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:09:44,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:09:44,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:09:44,011 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:09:44,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-09-10 04:09:44,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a0aae35/efcc4575d97b4bcdabb8a4ed4b23666c/FLAGf2944d84e [2019-09-10 04:09:44,551 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:09:44,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-09-10 04:09:44,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a0aae35/efcc4575d97b4bcdabb8a4ed4b23666c/FLAGf2944d84e [2019-09-10 04:09:44,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a0aae35/efcc4575d97b4bcdabb8a4ed4b23666c [2019-09-10 04:09:44,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:09:44,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:09:44,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:09:44,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:09:44,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:09:44,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:09:44" (1/1) ... [2019-09-10 04:09:44,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@412c5ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:44, skipping insertion in model container [2019-09-10 04:09:44,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:09:44" (1/1) ... [2019-09-10 04:09:44,932 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:09:44,976 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:09:45,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:09:45,348 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:09:45,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:09:45,423 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:09:45,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45 WrapperNode [2019-09-10 04:09:45,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:09:45,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:09:45,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:09:45,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:09:45,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (1/1) ... [2019-09-10 04:09:45,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (1/1) ... [2019-09-10 04:09:45,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (1/1) ... [2019-09-10 04:09:45,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (1/1) ... [2019-09-10 04:09:45,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (1/1) ... [2019-09-10 04:09:45,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (1/1) ... [2019-09-10 04:09:45,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (1/1) ... [2019-09-10 04:09:45,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:09:45,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:09:45,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:09:45,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:09:45,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (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 04:09:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:09:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:09:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:09:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:09:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:09:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:09:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:09:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:09:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:09:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:09:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:09:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:09:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:09:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:09:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:09:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:09:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:09:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:09:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:09:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:09:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:09:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:09:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:09:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:09:46,153 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:09:46,155 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:09:46,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:09:46 BoogieIcfgContainer [2019-09-10 04:09:46,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:09:46,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:09:46,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:09:46,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:09:46,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:09:44" (1/3) ... [2019-09-10 04:09:46,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474b2648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:09:46, skipping insertion in model container [2019-09-10 04:09:46,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:09:45" (2/3) ... [2019-09-10 04:09:46,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474b2648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:09:46, skipping insertion in model container [2019-09-10 04:09:46,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:09:46" (3/3) ... [2019-09-10 04:09:46,166 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-09-10 04:09:46,175 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:09:46,184 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:09:46,200 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:09:46,227 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:09:46,228 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:09:46,228 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:09:46,228 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:09:46,229 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:09:46,229 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:09:46,229 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:09:46,229 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:09:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2019-09-10 04:09:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-10 04:09:46,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:46,261 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] [2019-09-10 04:09:46,263 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:46,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1178025219, now seen corresponding path program 1 times [2019-09-10 04:09:46,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:46,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:46,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:46,631 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 04:09:46,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:46,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:09:46,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:46,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:09:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:09:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:09:46,659 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 5 states. [2019-09-10 04:09:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:46,758 INFO L93 Difference]: Finished difference Result 105 states and 149 transitions. [2019-09-10 04:09:46,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:09:46,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-10 04:09:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:46,778 INFO L225 Difference]: With dead ends: 105 [2019-09-10 04:09:46,778 INFO L226 Difference]: Without dead ends: 96 [2019-09-10 04:09:46,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:09:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-10 04:09:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-10 04:09:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 04:09:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-09-10 04:09:46,829 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 47 [2019-09-10 04:09:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:46,829 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-09-10 04:09:46,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:09:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2019-09-10 04:09:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 04:09:46,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:46,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:09:46,833 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1394790963, now seen corresponding path program 1 times [2019-09-10 04:09:46,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:46,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:46,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:46,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:46,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:47,197 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 04:09:47,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:47,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:09:47,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:47,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:09:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:09:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:09:47,201 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 9 states. [2019-09-10 04:09:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:49,120 INFO L93 Difference]: Finished difference Result 535 states and 760 transitions. [2019-09-10 04:09:49,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 04:09:49,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-09-10 04:09:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:49,132 INFO L225 Difference]: With dead ends: 535 [2019-09-10 04:09:49,134 INFO L226 Difference]: Without dead ends: 535 [2019-09-10 04:09:49,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-10 04:09:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-10 04:09:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 434. [2019-09-10 04:09:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 04:09:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2019-09-10 04:09:49,209 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 63 [2019-09-10 04:09:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:49,210 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2019-09-10 04:09:49,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:09:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2019-09-10 04:09:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 04:09:49,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:49,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:09:49,215 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash -665073590, now seen corresponding path program 1 times [2019-09-10 04:09:49,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:49,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:49,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:49,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:49,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:49,368 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 04:09:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:09:49,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:49,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:09:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:09:49,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:09:49,370 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 8 states. [2019-09-10 04:09:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:49,469 INFO L93 Difference]: Finished difference Result 525 states and 746 transitions. [2019-09-10 04:09:49,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:09:49,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-09-10 04:09:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:49,475 INFO L225 Difference]: With dead ends: 525 [2019-09-10 04:09:49,476 INFO L226 Difference]: Without dead ends: 525 [2019-09-10 04:09:49,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:09:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-10 04:09:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 479. [2019-09-10 04:09:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-10 04:09:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 660 transitions. [2019-09-10 04:09:49,525 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 660 transitions. Word has length 64 [2019-09-10 04:09:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:49,526 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 660 transitions. [2019-09-10 04:09:49,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:09:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 660 transitions. [2019-09-10 04:09:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 04:09:49,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:49,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:09:49,534 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1483620075, now seen corresponding path program 1 times [2019-09-10 04:09:49,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:49,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:49,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:49,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:49,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:09:49,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:49,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:09:49,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:49,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:09:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:09:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:09:49,674 INFO L87 Difference]: Start difference. First operand 479 states and 660 transitions. Second operand 5 states. [2019-09-10 04:09:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:49,870 INFO L93 Difference]: Finished difference Result 1228 states and 1717 transitions. [2019-09-10 04:09:49,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:09:49,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-10 04:09:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:49,879 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 04:09:49,880 INFO L226 Difference]: Without dead ends: 1228 [2019-09-10 04:09:49,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:09:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-10 04:09:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 832. [2019-09-10 04:09:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2019-09-10 04:09:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1155 transitions. [2019-09-10 04:09:49,921 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1155 transitions. Word has length 65 [2019-09-10 04:09:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:49,922 INFO L475 AbstractCegarLoop]: Abstraction has 832 states and 1155 transitions. [2019-09-10 04:09:49,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:09:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1155 transitions. [2019-09-10 04:09:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 04:09:49,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:49,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:09:49,925 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:49,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:49,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1091263279, now seen corresponding path program 1 times [2019-09-10 04:09:49,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:49,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:49,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:50,019 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 04:09:50,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:50,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:09:50,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:50,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:09:50,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:09:50,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:09:50,021 INFO L87 Difference]: Start difference. First operand 832 states and 1155 transitions. Second operand 7 states. [2019-09-10 04:09:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:50,525 INFO L93 Difference]: Finished difference Result 1601 states and 2238 transitions. [2019-09-10 04:09:50,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:09:50,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-09-10 04:09:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:50,538 INFO L225 Difference]: With dead ends: 1601 [2019-09-10 04:09:50,538 INFO L226 Difference]: Without dead ends: 1601 [2019-09-10 04:09:50,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:09:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-09-10 04:09:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1595. [2019-09-10 04:09:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-09-10 04:09:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2235 transitions. [2019-09-10 04:09:50,614 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2235 transitions. Word has length 65 [2019-09-10 04:09:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:50,614 INFO L475 AbstractCegarLoop]: Abstraction has 1595 states and 2235 transitions. [2019-09-10 04:09:50,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:09:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2235 transitions. [2019-09-10 04:09:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 04:09:50,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:50,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:09:50,617 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:50,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:50,618 INFO L82 PathProgramCache]: Analyzing trace with hash 670852764, now seen corresponding path program 1 times [2019-09-10 04:09:50,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:50,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:50,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:50,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:50,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:50,736 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 04:09:50,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:50,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:09:50,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:50,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:09:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:09:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:09:50,738 INFO L87 Difference]: Start difference. First operand 1595 states and 2235 transitions. Second operand 9 states. [2019-09-10 04:09:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:51,482 INFO L93 Difference]: Finished difference Result 2204 states and 3088 transitions. [2019-09-10 04:09:51,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:09:51,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-10 04:09:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:51,496 INFO L225 Difference]: With dead ends: 2204 [2019-09-10 04:09:51,497 INFO L226 Difference]: Without dead ends: 2204 [2019-09-10 04:09:51,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:09:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2019-09-10 04:09:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1660. [2019-09-10 04:09:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-09-10 04:09:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2325 transitions. [2019-09-10 04:09:51,578 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2325 transitions. Word has length 66 [2019-09-10 04:09:51,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:51,579 INFO L475 AbstractCegarLoop]: Abstraction has 1660 states and 2325 transitions. [2019-09-10 04:09:51,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:09:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2325 transitions. [2019-09-10 04:09:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 04:09:51,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:51,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:09:51,581 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1292388920, now seen corresponding path program 1 times [2019-09-10 04:09:51,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:51,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:51,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:51,706 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 04:09:51,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:51,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:09:51,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:51,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:09:51,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:09:51,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:09:51,708 INFO L87 Difference]: Start difference. First operand 1660 states and 2325 transitions. Second operand 9 states. [2019-09-10 04:09:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:52,239 INFO L93 Difference]: Finished difference Result 1870 states and 2557 transitions. [2019-09-10 04:09:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:09:52,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-10 04:09:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:52,250 INFO L225 Difference]: With dead ends: 1870 [2019-09-10 04:09:52,250 INFO L226 Difference]: Without dead ends: 1855 [2019-09-10 04:09:52,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:09:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-09-10 04:09:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1713. [2019-09-10 04:09:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2019-09-10 04:09:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2399 transitions. [2019-09-10 04:09:52,310 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2399 transitions. Word has length 66 [2019-09-10 04:09:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:52,311 INFO L475 AbstractCegarLoop]: Abstraction has 1713 states and 2399 transitions. [2019-09-10 04:09:52,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:09:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2399 transitions. [2019-09-10 04:09:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 04:09:52,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:52,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:09:52,313 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash 315523884, now seen corresponding path program 1 times [2019-09-10 04:09:52,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:52,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:52,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:52,403 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 04:09:52,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:52,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:09:52,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:52,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:09:52,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:09:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:09:52,405 INFO L87 Difference]: Start difference. First operand 1713 states and 2399 transitions. Second operand 9 states. [2019-09-10 04:09:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:53,031 INFO L93 Difference]: Finished difference Result 2180 states and 3094 transitions. [2019-09-10 04:09:53,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:09:53,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-10 04:09:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:53,043 INFO L225 Difference]: With dead ends: 2180 [2019-09-10 04:09:53,043 INFO L226 Difference]: Without dead ends: 2168 [2019-09-10 04:09:53,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:09:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-09-10 04:09:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 1820. [2019-09-10 04:09:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-09-10 04:09:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2570 transitions. [2019-09-10 04:09:53,116 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2570 transitions. Word has length 66 [2019-09-10 04:09:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:53,116 INFO L475 AbstractCegarLoop]: Abstraction has 1820 states and 2570 transitions. [2019-09-10 04:09:53,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:09:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2570 transitions. [2019-09-10 04:09:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 04:09:53,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:53,124 INFO L399 BasicCegarLoop]: trace histogram [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 04:09:53,125 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1777263924, now seen corresponding path program 1 times [2019-09-10 04:09:53,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:53,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:53,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 04:09:53,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:09:53,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:09:53,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 04:09:53,229 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [138], [143], [148], [149], [150], [153], [175], [177], [195], [196], [199], [221], [223], [253], [254], [255], [256], [259], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:09:53,284 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:09:53,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:09:53,433 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:09:53,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:09:53,957 INFO L272 AbstractInterpreter]: Visited 70 different actions 314 times. Merged at 12 different actions 69 times. Widened at 1 different actions 1 times. Performed 2601 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2601 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 83 variables. [2019-09-10 04:09:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:53,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:09:53,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:09:53,969 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 04:09:53,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:53,998 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 04:09:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:54,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:09:54,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:09:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:09:54,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:09:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:09:54,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:09:54,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:09:54,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:54,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:09:54,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:09:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:09:54,354 INFO L87 Difference]: Start difference. First operand 1820 states and 2570 transitions. Second operand 5 states. [2019-09-10 04:09:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:54,779 INFO L93 Difference]: Finished difference Result 2443 states and 3377 transitions. [2019-09-10 04:09:54,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:09:54,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 04:09:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:54,799 INFO L225 Difference]: With dead ends: 2443 [2019-09-10 04:09:54,800 INFO L226 Difference]: Without dead ends: 2443 [2019-09-10 04:09:54,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:09:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2019-09-10 04:09:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2438. [2019-09-10 04:09:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2019-09-10 04:09:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3373 transitions. [2019-09-10 04:09:54,907 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3373 transitions. Word has length 102 [2019-09-10 04:09:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:54,908 INFO L475 AbstractCegarLoop]: Abstraction has 2438 states and 3373 transitions. [2019-09-10 04:09:54,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:09:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3373 transitions. [2019-09-10 04:09:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 04:09:54,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:54,910 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-10 04:09:54,911 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:54,911 INFO L82 PathProgramCache]: Analyzing trace with hash -369236325, now seen corresponding path program 1 times [2019-09-10 04:09:54,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:54,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:54,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:54,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:54,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:09:55,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:09:55,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:09:55,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2019-09-10 04:09:55,045 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [179], [191], [193], [195], [196], [199], [202], [205], [210], [213], [221], [223], [253], [254], [255], [256], [259], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:09:55,054 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:09:55,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:09:55,073 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:09:55,312 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:09:55,313 INFO L272 AbstractInterpreter]: Visited 69 different actions 269 times. Merged at 9 different actions 45 times. Widened at 1 different actions 1 times. Performed 2220 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 83 variables. [2019-09-10 04:09:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:55,313 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:09:55,525 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 79.31% of their original sizes. [2019-09-10 04:09:55,526 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:09:57,683 INFO L420 sIntCurrentIteration]: We unified 102 AI predicates to 102 [2019-09-10 04:09:57,683 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:09:57,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:09:57,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [5] total 61 [2019-09-10 04:09:57,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:57,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 04:09:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 04:09:57,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2980, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 04:09:57,687 INFO L87 Difference]: Start difference. First operand 2438 states and 3373 transitions. Second operand 58 states. [2019-09-10 04:10:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:10:22,167 INFO L93 Difference]: Finished difference Result 3467 states and 4866 transitions. [2019-09-10 04:10:22,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-10 04:10:22,167 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 103 [2019-09-10 04:10:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:10:22,186 INFO L225 Difference]: With dead ends: 3467 [2019-09-10 04:10:22,186 INFO L226 Difference]: Without dead ends: 3467 [2019-09-10 04:10:22,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7635 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2202, Invalid=21054, Unknown=0, NotChecked=0, Total=23256 [2019-09-10 04:10:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2019-09-10 04:10:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3027. [2019-09-10 04:10:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3027 states. [2019-09-10 04:10:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 4165 transitions. [2019-09-10 04:10:22,289 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 4165 transitions. Word has length 103 [2019-09-10 04:10:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:10:22,289 INFO L475 AbstractCegarLoop]: Abstraction has 3027 states and 4165 transitions. [2019-09-10 04:10:22,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 04:10:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 4165 transitions. [2019-09-10 04:10:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 04:10:22,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:10:22,292 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-10 04:10:22,293 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:10:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash -724565205, now seen corresponding path program 1 times [2019-09-10 04:10:22,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:10:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:22,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:22,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:22,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:10:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:10:22,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:10:22,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:10:22,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2019-09-10 04:10:22,357 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [191], [193], [195], [196], [199], [221], [223], [253], [254], [255], [256], [259], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:10:22,362 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:10:22,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:10:22,376 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:10:22,552 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:10:22,552 INFO L272 AbstractInterpreter]: Visited 70 different actions 275 times. Merged at 9 different actions 45 times. Widened at 1 different actions 1 times. Performed 2269 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2269 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 83 variables. [2019-09-10 04:10:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:22,553 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:10:22,682 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 78.36% of their original sizes. [2019-09-10 04:10:22,682 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:10:24,779 INFO L420 sIntCurrentIteration]: We unified 102 AI predicates to 102 [2019-09-10 04:10:24,779 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:10:24,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:10:24,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [4] total 60 [2019-09-10 04:10:24,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:10:24,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 04:10:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 04:10:24,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2985, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 04:10:24,782 INFO L87 Difference]: Start difference. First operand 3027 states and 4165 transitions. Second operand 58 states. [2019-09-10 04:10:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:10:47,952 INFO L93 Difference]: Finished difference Result 3400 states and 4739 transitions. [2019-09-10 04:10:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-10 04:10:47,952 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 103 [2019-09-10 04:10:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:10:47,971 INFO L225 Difference]: With dead ends: 3400 [2019-09-10 04:10:47,972 INFO L226 Difference]: Without dead ends: 3400 [2019-09-10 04:10:47,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7555 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2024, Invalid=19732, Unknown=0, NotChecked=0, Total=21756 [2019-09-10 04:10:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2019-09-10 04:10:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 2802. [2019-09-10 04:10:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2019-09-10 04:10:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 3853 transitions. [2019-09-10 04:10:48,073 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 3853 transitions. Word has length 103 [2019-09-10 04:10:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:10:48,073 INFO L475 AbstractCegarLoop]: Abstraction has 2802 states and 3853 transitions. [2019-09-10 04:10:48,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 04:10:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 3853 transitions. [2019-09-10 04:10:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:10:48,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:10:48,077 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-09-10 04:10:48,077 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:10:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash 227051680, now seen corresponding path program 1 times [2019-09-10 04:10:48,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:10:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:48,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:48,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:10:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 04:10:48,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:10:48,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:10:48,140 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:10:48,140 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [179], [182], [185], [189], [191], [193], [195], [196], [199], [202], [205], [210], [213], [221], [223], [253], [254], [255], [256], [259], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:10:48,143 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:10:48,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:10:48,152 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:10:48,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:10:48,502 INFO L272 AbstractInterpreter]: Visited 76 different actions 426 times. Merged at 18 different actions 103 times. Widened at 1 different actions 1 times. Performed 3919 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3919 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 16 fixpoints after 6 different actions. Largest state had 83 variables. [2019-09-10 04:10:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:48,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:10:48,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:10:48,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:10:48,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:48,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:10:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:48,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 04:10:48,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:10:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:10:48,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:10:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 04:10:48,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:10:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 04:10:48,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:10:48,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:10:48,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:10:48,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:10:48,752 INFO L87 Difference]: Start difference. First operand 2802 states and 3853 transitions. Second operand 3 states. [2019-09-10 04:10:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:10:48,780 INFO L93 Difference]: Finished difference Result 4841 states and 6690 transitions. [2019-09-10 04:10:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:10:48,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 04:10:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:10:48,803 INFO L225 Difference]: With dead ends: 4841 [2019-09-10 04:10:48,804 INFO L226 Difference]: Without dead ends: 4841 [2019-09-10 04:10:48,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:10:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2019-09-10 04:10:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 4767. [2019-09-10 04:10:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4767 states. [2019-09-10 04:10:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 6603 transitions. [2019-09-10 04:10:48,920 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 6603 transitions. Word has length 105 [2019-09-10 04:10:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:10:48,920 INFO L475 AbstractCegarLoop]: Abstraction has 4767 states and 6603 transitions. [2019-09-10 04:10:48,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:10:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 6603 transitions. [2019-09-10 04:10:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:10:48,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:10:48,924 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-09-10 04:10:48,924 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:10:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash -128277200, now seen corresponding path program 1 times [2019-09-10 04:10:48,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:10:48,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:48,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:48,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:48,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:10:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:10:49,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:10:49,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:10:49,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:10:49,004 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [221], [223], [253], [254], [255], [256], [259], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:10:49,006 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:10:49,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:10:49,019 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:10:49,163 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:10:49,163 INFO L272 AbstractInterpreter]: Visited 72 different actions 287 times. Merged at 9 different actions 45 times. Widened at 1 different actions 1 times. Performed 2297 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2297 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 83 variables. [2019-09-10 04:10:49,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:49,163 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:10:49,248 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 77.86% of their original sizes. [2019-09-10 04:10:49,249 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:10:51,199 INFO L420 sIntCurrentIteration]: We unified 104 AI predicates to 104 [2019-09-10 04:10:51,199 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:10:51,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:10:51,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [5] total 63 [2019-09-10 04:10:51,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:10:51,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 04:10:51,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 04:10:51,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=3211, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 04:10:51,203 INFO L87 Difference]: Start difference. First operand 4767 states and 6603 transitions. Second operand 60 states. [2019-09-10 04:11:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:11:13,024 INFO L93 Difference]: Finished difference Result 5814 states and 8187 transitions. [2019-09-10 04:11:13,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 04:11:13,025 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 105 [2019-09-10 04:11:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:11:13,049 INFO L225 Difference]: With dead ends: 5814 [2019-09-10 04:11:13,050 INFO L226 Difference]: Without dead ends: 5814 [2019-09-10 04:11:13,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9344 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2549, Invalid=24511, Unknown=0, NotChecked=0, Total=27060 [2019-09-10 04:11:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2019-09-10 04:11:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 5124. [2019-09-10 04:11:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-09-10 04:11:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 7079 transitions. [2019-09-10 04:11:13,182 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 7079 transitions. Word has length 105 [2019-09-10 04:11:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:11:13,182 INFO L475 AbstractCegarLoop]: Abstraction has 5124 states and 7079 transitions. [2019-09-10 04:11:13,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 04:11:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 7079 transitions. [2019-09-10 04:11:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:11:13,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:11:13,186 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-09-10 04:11:13,186 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:11:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2010046330, now seen corresponding path program 1 times [2019-09-10 04:11:13,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:11:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:13,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:13,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:11:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:11:13,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:11:13,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:11:13,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:11:13,262 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [210], [213], [221], [223], [253], [254], [255], [256], [259], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:11:13,266 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:11:13,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:11:13,275 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:11:13,797 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:11:13,797 INFO L272 AbstractInterpreter]: Visited 78 different actions 696 times. Merged at 17 different actions 174 times. Widened at 1 different actions 3 times. Performed 6325 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6325 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 27 fixpoints after 5 different actions. Largest state had 83 variables. [2019-09-10 04:11:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:13,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:11:13,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:11:13,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 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 04:11:13,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:13,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:11:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:13,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:11:13,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:11:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 04:11:14,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:11:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 04:11:14,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:11:14,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 10] total 18 [2019-09-10 04:11:14,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:11:14,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:11:14,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:11:14,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:11:14,271 INFO L87 Difference]: Start difference. First operand 5124 states and 7079 transitions. Second operand 8 states. [2019-09-10 04:11:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:11:14,726 INFO L93 Difference]: Finished difference Result 5932 states and 8184 transitions. [2019-09-10 04:11:14,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:11:14,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-09-10 04:11:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:11:14,747 INFO L225 Difference]: With dead ends: 5932 [2019-09-10 04:11:14,747 INFO L226 Difference]: Without dead ends: 5932 [2019-09-10 04:11:14,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 194 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-09-10 04:11:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5932 states. [2019-09-10 04:11:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5932 to 5928. [2019-09-10 04:11:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5928 states. [2019-09-10 04:11:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5928 states to 5928 states and 8182 transitions. [2019-09-10 04:11:14,864 INFO L78 Accepts]: Start accepts. Automaton has 5928 states and 8182 transitions. Word has length 105 [2019-09-10 04:11:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:11:14,864 INFO L475 AbstractCegarLoop]: Abstraction has 5928 states and 8182 transitions. [2019-09-10 04:11:14,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:11:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5928 states and 8182 transitions. [2019-09-10 04:11:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:11:14,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:11:14,868 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-09-10 04:11:14,868 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:11:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 812531964, now seen corresponding path program 1 times [2019-09-10 04:11:14,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:11:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:14,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:14,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:11:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:11:14,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:11:14,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:11:14,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:11:14,945 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [179], [191], [193], [195], [196], [199], [221], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:11:14,946 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:11:14,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:11:14,955 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:11:15,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:11:15,303 INFO L272 AbstractInterpreter]: Visited 78 different actions 494 times. Merged at 17 different actions 115 times. Widened at 1 different actions 1 times. Performed 4284 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4284 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 19 fixpoints after 5 different actions. Largest state had 83 variables. [2019-09-10 04:11:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:15,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:11:15,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:11:15,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:11:15,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:15,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:11:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:15,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:11:15,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:11:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:11:15,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:11:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:11:15,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:11:15,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2019-09-10 04:11:15,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:11:15,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:11:15,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:11:15,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:11:15,695 INFO L87 Difference]: Start difference. First operand 5928 states and 8182 transitions. Second operand 7 states. [2019-09-10 04:11:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:11:16,098 INFO L93 Difference]: Finished difference Result 5244 states and 7168 transitions. [2019-09-10 04:11:16,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:11:16,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 04:11:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:11:16,115 INFO L225 Difference]: With dead ends: 5244 [2019-09-10 04:11:16,115 INFO L226 Difference]: Without dead ends: 5244 [2019-09-10 04:11:16,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:11:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2019-09-10 04:11:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5240. [2019-09-10 04:11:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5240 states. [2019-09-10 04:11:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7166 transitions. [2019-09-10 04:11:16,223 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7166 transitions. Word has length 105 [2019-09-10 04:11:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:11:16,223 INFO L475 AbstractCegarLoop]: Abstraction has 5240 states and 7166 transitions. [2019-09-10 04:11:16,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:11:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7166 transitions. [2019-09-10 04:11:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:11:16,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:11:16,227 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:11:16,228 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:11:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1874522528, now seen corresponding path program 1 times [2019-09-10 04:11:16,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:11:16,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:16,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:16,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:16,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:11:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:11:16,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:11:16,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:11:16,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:11:16,283 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [191], [193], [195], [196], [199], [221], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:11:16,285 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:11:16,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:11:16,294 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:11:16,508 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:11:16,508 INFO L272 AbstractInterpreter]: Visited 75 different actions 345 times. Merged at 11 different actions 61 times. Widened at 1 different actions 1 times. Performed 2957 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2957 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 83 variables. [2019-09-10 04:11:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:16,509 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:11:16,591 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 78.05% of their original sizes. [2019-09-10 04:11:16,591 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:11:18,511 INFO L420 sIntCurrentIteration]: We unified 104 AI predicates to 104 [2019-09-10 04:11:18,511 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:11:18,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:11:18,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [4] total 62 [2019-09-10 04:11:18,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:11:18,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 04:11:18,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 04:11:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=3211, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 04:11:18,513 INFO L87 Difference]: Start difference. First operand 5240 states and 7166 transitions. Second operand 60 states. [2019-09-10 04:11:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:11:46,438 INFO L93 Difference]: Finished difference Result 7376 states and 10256 transitions. [2019-09-10 04:11:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-10 04:11:46,438 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 105 [2019-09-10 04:11:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:11:46,458 INFO L225 Difference]: With dead ends: 7376 [2019-09-10 04:11:46,459 INFO L226 Difference]: Without dead ends: 7376 [2019-09-10 04:11:46,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7851 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2169, Invalid=20783, Unknown=0, NotChecked=0, Total=22952 [2019-09-10 04:11:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-09-10 04:11:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 6449. [2019-09-10 04:11:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6449 states. [2019-09-10 04:11:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6449 states to 6449 states and 8788 transitions. [2019-09-10 04:11:46,611 INFO L78 Accepts]: Start accepts. Automaton has 6449 states and 8788 transitions. Word has length 105 [2019-09-10 04:11:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:11:46,612 INFO L475 AbstractCegarLoop]: Abstraction has 6449 states and 8788 transitions. [2019-09-10 04:11:46,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 04:11:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 6449 states and 8788 transitions. [2019-09-10 04:11:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 04:11:46,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:11:46,617 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:11:46,617 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:11:46,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash 870395222, now seen corresponding path program 1 times [2019-09-10 04:11:46,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:11:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:46,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:46,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:11:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:11:46,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:11:46,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:11:46,686 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 04:11:46,687 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [191], [193], [195], [196], [199], [221], [223], [253], [254], [255], [256], [259], [281], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:11:46,689 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:11:46,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:11:46,697 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:11:47,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:11:47,098 INFO L272 AbstractInterpreter]: Visited 80 different actions 744 times. Merged at 16 different actions 186 times. Widened at 1 different actions 4 times. Performed 6924 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6924 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 30 fixpoints after 6 different actions. Largest state had 83 variables. [2019-09-10 04:11:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:47,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:11:47,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:11:47,099 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 04:11:47,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:47,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:11:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:47,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 04:11:47,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:11:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:11:47,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:11:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:11:47,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:11:47,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 04:11:47,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:11:47,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:11:47,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:11:47,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:11:47,283 INFO L87 Difference]: Start difference. First operand 6449 states and 8788 transitions. Second operand 3 states. [2019-09-10 04:11:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:11:47,310 INFO L93 Difference]: Finished difference Result 6364 states and 8500 transitions. [2019-09-10 04:11:47,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:11:47,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 04:11:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:11:47,327 INFO L225 Difference]: With dead ends: 6364 [2019-09-10 04:11:47,327 INFO L226 Difference]: Without dead ends: 6364 [2019-09-10 04:11:47,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:11:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6364 states. [2019-09-10 04:11:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6364 to 5984. [2019-09-10 04:11:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5984 states. [2019-09-10 04:11:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5984 states to 5984 states and 7970 transitions. [2019-09-10 04:11:47,463 INFO L78 Accepts]: Start accepts. Automaton has 5984 states and 7970 transitions. Word has length 105 [2019-09-10 04:11:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:11:47,464 INFO L475 AbstractCegarLoop]: Abstraction has 5984 states and 7970 transitions. [2019-09-10 04:11:47,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:11:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5984 states and 7970 transitions. [2019-09-10 04:11:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 04:11:47,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:11:47,471 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:11:47,471 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:11:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash -72400091, now seen corresponding path program 1 times [2019-09-10 04:11:47,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:11:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:47,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:47,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:11:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:11:47,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:11:47,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:11:47,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 04:11:47,556 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [221], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:11:47,557 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:11:47,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:11:47,565 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:11:47,817 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:11:47,818 INFO L272 AbstractInterpreter]: Visited 77 different actions 351 times. Merged at 11 different actions 61 times. Widened at 1 different actions 1 times. Performed 3065 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3065 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 4 different actions. Largest state had 83 variables. [2019-09-10 04:11:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:47,818 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:11:47,914 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 77.57% of their original sizes. [2019-09-10 04:11:47,914 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:11:50,051 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 04:11:50,051 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:11:50,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:11:50,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 04:11:50,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:11:50,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 04:11:50,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 04:11:50,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3443, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 04:11:50,054 INFO L87 Difference]: Start difference. First operand 5984 states and 7970 transitions. Second operand 62 states. [2019-09-10 04:12:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:26,490 INFO L93 Difference]: Finished difference Result 8259 states and 11200 transitions. [2019-09-10 04:12:26,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-09-10 04:12:26,490 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 107 [2019-09-10 04:12:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:26,507 INFO L225 Difference]: With dead ends: 8259 [2019-09-10 04:12:26,507 INFO L226 Difference]: Without dead ends: 8259 [2019-09-10 04:12:26,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14028 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3553, Invalid=36247, Unknown=0, NotChecked=0, Total=39800 [2019-09-10 04:12:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8259 states. [2019-09-10 04:12:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8259 to 6804. [2019-09-10 04:12:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6804 states. [2019-09-10 04:12:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6804 states to 6804 states and 9071 transitions. [2019-09-10 04:12:26,673 INFO L78 Accepts]: Start accepts. Automaton has 6804 states and 9071 transitions. Word has length 107 [2019-09-10 04:12:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:26,674 INFO L475 AbstractCegarLoop]: Abstraction has 6804 states and 9071 transitions. [2019-09-10 04:12:26,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 04:12:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6804 states and 9071 transitions. [2019-09-10 04:12:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 04:12:26,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:26,679 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:26,679 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:26,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1622449637, now seen corresponding path program 1 times [2019-09-10 04:12:26,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:26,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:26,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:26,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:26,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:12:26,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:26,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:26,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 04:12:26,753 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [221], [223], [253], [254], [255], [256], [259], [281], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:12:26,754 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:26,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:26,764 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:27,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:12:27,337 INFO L272 AbstractInterpreter]: Visited 82 different actions 762 times. Merged at 16 different actions 182 times. Widened at 1 different actions 4 times. Performed 6763 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6763 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 30 fixpoints after 5 different actions. Largest state had 83 variables. [2019-09-10 04:12:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:27,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:12:27,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:27,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:12:27,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:27,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:12:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:27,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:12:27,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:12:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 04:12:27,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:12:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 04:12:27,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:12:27,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 11] total 20 [2019-09-10 04:12:27,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:27,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:12:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:12:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-10 04:12:27,840 INFO L87 Difference]: Start difference. First operand 6804 states and 9071 transitions. Second operand 9 states. [2019-09-10 04:12:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:28,664 INFO L93 Difference]: Finished difference Result 7521 states and 10035 transitions. [2019-09-10 04:12:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:12:28,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2019-09-10 04:12:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:28,685 INFO L225 Difference]: With dead ends: 7521 [2019-09-10 04:12:28,685 INFO L226 Difference]: Without dead ends: 7521 [2019-09-10 04:12:28,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 195 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-09-10 04:12:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7521 states. [2019-09-10 04:12:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7521 to 7515. [2019-09-10 04:12:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7515 states. [2019-09-10 04:12:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 10032 transitions. [2019-09-10 04:12:28,891 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 10032 transitions. Word has length 107 [2019-09-10 04:12:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:28,891 INFO L475 AbstractCegarLoop]: Abstraction has 7515 states and 10032 transitions. [2019-09-10 04:12:28,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:12:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 10032 transitions. [2019-09-10 04:12:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 04:12:28,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:28,897 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:28,897 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1154797345, now seen corresponding path program 1 times [2019-09-10 04:12:28,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:28,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:28,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:28,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:28,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:12:28,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:28,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:28,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 04:12:28,985 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [210], [213], [221], [223], [253], [254], [255], [256], [259], [262], [265], [270], [273], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:12:28,986 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:28,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:28,994 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:29,281 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:12:29,281 INFO L272 AbstractInterpreter]: Visited 79 different actions 554 times. Merged at 17 different actions 130 times. Widened at 1 different actions 3 times. Performed 4796 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4796 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 20 fixpoints after 5 different actions. Largest state had 83 variables. [2019-09-10 04:12:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:29,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:12:29,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:29,281 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:12:29,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:29,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:12:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:29,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 04:12:29,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:12:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:29,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:12:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:12:29,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:12:29,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 11] total 21 [2019-09-10 04:12:29,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:12:29,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:12:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:12:29,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-09-10 04:12:29,743 INFO L87 Difference]: Start difference. First operand 7515 states and 10032 transitions. Second operand 13 states. [2019-09-10 04:12:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:31,688 INFO L93 Difference]: Finished difference Result 24464 states and 32266 transitions. [2019-09-10 04:12:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 04:12:31,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-10 04:12:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:31,750 INFO L225 Difference]: With dead ends: 24464 [2019-09-10 04:12:31,750 INFO L226 Difference]: Without dead ends: 24464 [2019-09-10 04:12:31,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=692, Invalid=1960, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 04:12:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24464 states. [2019-09-10 04:12:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24464 to 22828. [2019-09-10 04:12:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22828 states. [2019-09-10 04:12:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22828 states to 22828 states and 30238 transitions. [2019-09-10 04:12:32,267 INFO L78 Accepts]: Start accepts. Automaton has 22828 states and 30238 transitions. Word has length 108 [2019-09-10 04:12:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:32,267 INFO L475 AbstractCegarLoop]: Abstraction has 22828 states and 30238 transitions. [2019-09-10 04:12:32,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:12:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 22828 states and 30238 transitions. [2019-09-10 04:12:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:12:32,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:32,277 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:32,277 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:32,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash -657559284, now seen corresponding path program 1 times [2019-09-10 04:12:32,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:32,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:32,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:32,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:12:32,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:32,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:32,359 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 04:12:32,359 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [281], [283], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:12:32,361 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:32,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:32,369 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:32,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:12:32,887 INFO L272 AbstractInterpreter]: Visited 86 different actions 796 times. Merged at 19 different actions 203 times. Widened at 1 different actions 4 times. Performed 6452 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6452 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 37 fixpoints after 6 different actions. Largest state had 83 variables. [2019-09-10 04:12:32,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:32,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:12:32,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:32,887 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 04:12:32,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:32,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:12:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:32,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:12:32,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:12:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:12:33,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:12:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:12:33,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:12:33,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:12:33,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:33,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:12:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:12:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:12:33,097 INFO L87 Difference]: Start difference. First operand 22828 states and 30238 transitions. Second operand 5 states. [2019-09-10 04:12:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:33,490 INFO L93 Difference]: Finished difference Result 38191 states and 49354 transitions. [2019-09-10 04:12:33,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:12:33,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 04:12:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:33,593 INFO L225 Difference]: With dead ends: 38191 [2019-09-10 04:12:33,593 INFO L226 Difference]: Without dead ends: 38191 [2019-09-10 04:12:33,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:12:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38191 states. [2019-09-10 04:12:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38191 to 38183. [2019-09-10 04:12:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38183 states. [2019-09-10 04:12:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38183 states to 38183 states and 49347 transitions. [2019-09-10 04:12:34,478 INFO L78 Accepts]: Start accepts. Automaton has 38183 states and 49347 transitions. Word has length 110 [2019-09-10 04:12:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:34,478 INFO L475 AbstractCegarLoop]: Abstraction has 38183 states and 49347 transitions. [2019-09-10 04:12:34,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:12:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 38183 states and 49347 transitions. [2019-09-10 04:12:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:12:34,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:34,489 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:34,489 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:34,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1198012480, now seen corresponding path program 1 times [2019-09-10 04:12:34,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:34,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:34,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:12:34,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:34,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:34,561 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 04:12:34,563 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [179], [191], [193], [195], [196], [199], [202], [205], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:12:34,564 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:34,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:34,572 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:34,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:12:34,806 INFO L272 AbstractInterpreter]: Visited 81 different actions 383 times. Merged at 14 different actions 70 times. Widened at 1 different actions 1 times. Performed 3343 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3343 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 4 different actions. Largest state had 83 variables. [2019-09-10 04:12:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:34,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:12:34,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:34,806 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 04:12:34,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:34,822 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 04:12:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:34,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 04:12:34,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:12:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:35,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:12:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 04:12:35,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:12:35,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 11] total 21 [2019-09-10 04:12:35,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:12:35,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:12:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:12:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-09-10 04:12:35,238 INFO L87 Difference]: Start difference. First operand 38183 states and 49347 transitions. Second operand 13 states. [2019-09-10 04:12:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:37,716 INFO L93 Difference]: Finished difference Result 23214 states and 28982 transitions. [2019-09-10 04:12:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 04:12:37,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-09-10 04:12:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:37,777 INFO L225 Difference]: With dead ends: 23214 [2019-09-10 04:12:37,777 INFO L226 Difference]: Without dead ends: 22641 [2019-09-10 04:12:37,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=547, Invalid=1615, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 04:12:37,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22641 states. [2019-09-10 04:12:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22641 to 20714. [2019-09-10 04:12:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20714 states. [2019-09-10 04:12:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20714 states to 20714 states and 26077 transitions. [2019-09-10 04:12:38,209 INFO L78 Accepts]: Start accepts. Automaton has 20714 states and 26077 transitions. Word has length 110 [2019-09-10 04:12:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:38,209 INFO L475 AbstractCegarLoop]: Abstraction has 20714 states and 26077 transitions. [2019-09-10 04:12:38,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:12:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 20714 states and 26077 transitions. [2019-09-10 04:12:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:12:38,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:38,216 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:38,216 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2023373743, now seen corresponding path program 1 times [2019-09-10 04:12:38,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:38,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:38,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:12:38,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:38,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:38,275 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 04:12:38,275 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [283], [285], [297], [309], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:12:38,277 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:38,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:38,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:38,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:12:38,619 INFO L272 AbstractInterpreter]: Visited 89 different actions 656 times. Merged at 18 different actions 145 times. Widened at 1 different actions 1 times. Performed 5202 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 29 fixpoints after 6 different actions. Largest state had 83 variables. [2019-09-10 04:12:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:38,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:12:38,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:38,620 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 04:12:38,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:38,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:12:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:38,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 04:12:38,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:12:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:38,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:12:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:12:38,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:12:38,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 04:12:38,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:38,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:12:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:12:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:12:38,803 INFO L87 Difference]: Start difference. First operand 20714 states and 26077 transitions. Second operand 3 states. [2019-09-10 04:12:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:38,880 INFO L93 Difference]: Finished difference Result 34008 states and 42670 transitions. [2019-09-10 04:12:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:12:38,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 04:12:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:38,974 INFO L225 Difference]: With dead ends: 34008 [2019-09-10 04:12:38,974 INFO L226 Difference]: Without dead ends: 34008 [2019-09-10 04:12:38,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:12:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34008 states. [2019-09-10 04:12:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34008 to 34006. [2019-09-10 04:12:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34006 states. [2019-09-10 04:12:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34006 states to 34006 states and 42669 transitions. [2019-09-10 04:12:39,518 INFO L78 Accepts]: Start accepts. Automaton has 34006 states and 42669 transitions. Word has length 111 [2019-09-10 04:12:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:39,518 INFO L475 AbstractCegarLoop]: Abstraction has 34006 states and 42669 transitions. [2019-09-10 04:12:39,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:12:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 34006 states and 42669 transitions. [2019-09-10 04:12:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:12:39,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:39,528 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:39,528 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2079579727, now seen corresponding path program 1 times [2019-09-10 04:12:39,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:39,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:39,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:39,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:39,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:12:39,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:39,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:39,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 04:12:39,578 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [210], [213], [223], [225], [237], [249], [251], [253], [254], [255], [256], [259], [281], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:12:39,579 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:39,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:39,586 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:40,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:12:40,504 INFO L272 AbstractInterpreter]: Visited 89 different actions 1329 times. Merged at 18 different actions 332 times. Widened at 1 different actions 6 times. Performed 11056 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 67 fixpoints after 6 different actions. Largest state had 83 variables. [2019-09-10 04:12:40,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:40,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:12:40,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:40,505 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 04:12:40,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:40,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:12:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:40,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 04:12:40,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:12:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:40,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:12:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:12:40,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:12:40,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 04:12:40,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:40,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:12:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:12:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:12:40,670 INFO L87 Difference]: Start difference. First operand 34006 states and 42669 transitions. Second operand 3 states. [2019-09-10 04:12:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:40,790 INFO L93 Difference]: Finished difference Result 51223 states and 63688 transitions. [2019-09-10 04:12:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:12:40,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 04:12:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:40,916 INFO L225 Difference]: With dead ends: 51223 [2019-09-10 04:12:40,916 INFO L226 Difference]: Without dead ends: 51223 [2019-09-10 04:12:40,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:12:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51223 states. [2019-09-10 04:12:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51223 to 51107. [2019-09-10 04:12:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51107 states. [2019-09-10 04:12:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51107 states to 51107 states and 63573 transitions. [2019-09-10 04:12:41,661 INFO L78 Accepts]: Start accepts. Automaton has 51107 states and 63573 transitions. Word has length 111 [2019-09-10 04:12:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:41,662 INFO L475 AbstractCegarLoop]: Abstraction has 51107 states and 63573 transitions. [2019-09-10 04:12:41,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:12:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 51107 states and 63573 transitions. [2019-09-10 04:12:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 04:12:41,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:41,671 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:41,672 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:41,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1213710559, now seen corresponding path program 1 times [2019-09-10 04:12:41,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:41,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:41,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:41,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:41,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:12:41,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:41,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:41,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 04:12:41,992 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [281], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:12:41,993 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:41,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:42,000 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:43,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:12:43,386 INFO L272 AbstractInterpreter]: Visited 90 different actions 920 times. Merged at 18 different actions 223 times. Widened at 1 different actions 3 times. Performed 6997 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6997 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 45 fixpoints after 7 different actions. Largest state had 83 variables. [2019-09-10 04:12:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:43,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:12:43,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:43,386 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 04:12:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:43,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:12:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:43,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 04:12:43,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:12:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:12:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:44,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:12:44,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:12:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:12:44,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:12:44,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 15] total 44 [2019-09-10 04:12:44,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:12:44,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 04:12:44,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 04:12:44,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1701, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 04:12:44,744 INFO L87 Difference]: Start difference. First operand 51107 states and 63573 transitions. Second operand 34 states. [2019-09-10 04:12:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:55,727 INFO L93 Difference]: Finished difference Result 123321 states and 154840 transitions. [2019-09-10 04:12:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:12:55,728 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 112 [2019-09-10 04:12:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:56,024 INFO L225 Difference]: With dead ends: 123321 [2019-09-10 04:12:56,024 INFO L226 Difference]: Without dead ends: 122937 [2019-09-10 04:12:56,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4843 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3315, Invalid=13977, Unknown=0, NotChecked=0, Total=17292 [2019-09-10 04:12:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122937 states. [2019-09-10 04:12:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122937 to 108085. [2019-09-10 04:12:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108085 states. [2019-09-10 04:12:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108085 states to 108085 states and 134235 transitions. [2019-09-10 04:12:58,197 INFO L78 Accepts]: Start accepts. Automaton has 108085 states and 134235 transitions. Word has length 112 [2019-09-10 04:12:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:58,198 INFO L475 AbstractCegarLoop]: Abstraction has 108085 states and 134235 transitions. [2019-09-10 04:12:58,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 04:12:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 108085 states and 134235 transitions. [2019-09-10 04:12:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 04:12:58,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:58,206 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:58,207 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash -749531125, now seen corresponding path program 1 times [2019-09-10 04:12:58,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:58,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:58,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:58,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:12:58,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:58,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:12:58,497 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 04:12:58,498 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [221], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:12:58,499 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:12:58,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:12:58,511 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:12:58,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:12:58,989 INFO L272 AbstractInterpreter]: Visited 90 different actions 889 times. Merged at 18 different actions 203 times. Widened at 1 different actions 2 times. Performed 6946 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6946 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 41 fixpoints after 7 different actions. Largest state had 83 variables. [2019-09-10 04:12:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:58,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:12:58,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:12:58,989 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 04:12:59,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:59,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:12:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:59,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 04:12:59,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:12:59,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:12:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:12:59,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:13:00,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:13:00,942 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-09-10 04:13:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:13:01,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:13:01,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 49 [2019-09-10 04:13:01,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:13:01,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 04:13:01,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 04:13:01,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2180, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 04:13:01,344 INFO L87 Difference]: Start difference. First operand 108085 states and 134235 transitions. Second operand 34 states. [2019-09-10 04:13:06,371 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:13:07,977 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 04:13:09,369 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 04:13:10,863 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:13:13,049 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 04:13:15,174 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:13:15,328 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:13:15,814 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:13:19,343 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:13:19,750 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:13:20,153 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:13:20,448 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:13:21,275 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 04:13:21,790 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 04:13:22,218 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:13:22,928 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 04:13:24,064 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 04:13:25,337 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:13:25,764 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:13:26,689 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:13:26,877 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 04:13:27,271 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:13:28,958 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:13:29,177 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 04:13:29,577 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:13:30,207 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 04:13:32,224 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:13:37,741 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 04:13:39,105 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 04:13:39,950 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 04:13:41,330 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 04:13:42,171 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 04:13:43,110 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 04:13:44,593 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 04:13:45,531 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 04:13:46,564 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 04:13:48,056 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 04:13:48,216 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 04:13:49,032 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 04:13:49,182 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-10 04:13:50,699 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 04:13:52,252 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 04:13:55,402 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:13:55,761 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 04:13:55,928 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:13:56,375 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 04:13:58,989 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 04:14:00,631 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 04:14:01,064 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 04:14:01,948 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 04:14:02,201 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 04:14:02,358 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 04:14:03,492 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 04:14:04,343 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 04:14:06,552 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 04:14:07,080 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 04:14:09,057 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 04:14:09,535 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 04:14:10,245 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 04:14:14,175 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:14:14,834 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:14:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:18,481 INFO L93 Difference]: Finished difference Result 312936 states and 398438 transitions. [2019-09-10 04:14:18,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 355 states. [2019-09-10 04:14:18,482 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 112 [2019-09-10 04:14:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:19,229 INFO L225 Difference]: With dead ends: 312936 [2019-09-10 04:14:19,229 INFO L226 Difference]: Without dead ends: 311952 [2019-09-10 04:14:19,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 393 SyntacticMatches, 7 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64727 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=17667, Invalid=143535, Unknown=0, NotChecked=0, Total=161202 [2019-09-10 04:14:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311952 states. [2019-09-10 04:14:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311952 to 251830. [2019-09-10 04:14:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251830 states. [2019-09-10 04:14:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251830 states to 251830 states and 314314 transitions. [2019-09-10 04:14:28,524 INFO L78 Accepts]: Start accepts. Automaton has 251830 states and 314314 transitions. Word has length 112 [2019-09-10 04:14:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:28,524 INFO L475 AbstractCegarLoop]: Abstraction has 251830 states and 314314 transitions. [2019-09-10 04:14:28,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 04:14:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 251830 states and 314314 transitions. [2019-09-10 04:14:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 04:14:28,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:28,535 INFO L399 BasicCegarLoop]: trace histogram [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, 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 04:14:28,535 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:28,535 INFO L82 PathProgramCache]: Analyzing trace with hash -997662574, now seen corresponding path program 1 times [2019-09-10 04:14:28,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:28,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:28,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:28,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:28,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:14:28,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:28,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:14:28,587 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 04:14:28,589 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [278], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:14:28,592 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:14:28,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:14:28,601 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:14:28,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:14:28,988 INFO L272 AbstractInterpreter]: Visited 91 different actions 933 times. Merged at 18 different actions 214 times. Widened at 1 different actions 3 times. Performed 7183 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7183 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 44 fixpoints after 7 different actions. Largest state had 83 variables. [2019-09-10 04:14:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:28,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:14:28,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:28,989 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 04:14:28,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:28,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:14:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:29,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 04:14:29,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:14:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:29,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:14:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:14:29,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:14:29,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 04:14:29,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:29,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:14:29,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:14:29,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:14:29,154 INFO L87 Difference]: Start difference. First operand 251830 states and 314314 transitions. Second operand 3 states. [2019-09-10 04:14:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:29,665 INFO L93 Difference]: Finished difference Result 199407 states and 241116 transitions. [2019-09-10 04:14:29,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:14:29,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 04:14:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:30,082 INFO L225 Difference]: With dead ends: 199407 [2019-09-10 04:14:30,082 INFO L226 Difference]: Without dead ends: 199407 [2019-09-10 04:14:30,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 223 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:14:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199407 states. [2019-09-10 04:14:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199407 to 186199. [2019-09-10 04:14:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186199 states. [2019-09-10 04:14:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186199 states to 186199 states and 224272 transitions. [2019-09-10 04:14:38,330 INFO L78 Accepts]: Start accepts. Automaton has 186199 states and 224272 transitions. Word has length 113 [2019-09-10 04:14:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:38,330 INFO L475 AbstractCegarLoop]: Abstraction has 186199 states and 224272 transitions. [2019-09-10 04:14:38,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:14:38,330 INFO L276 IsEmpty]: Start isEmpty. Operand 186199 states and 224272 transitions. [2019-09-10 04:14:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 04:14:38,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:38,349 INFO L399 BasicCegarLoop]: trace histogram [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, 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 04:14:38,349 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:38,349 INFO L82 PathProgramCache]: Analyzing trace with hash -490454897, now seen corresponding path program 1 times [2019-09-10 04:14:38,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:38,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:38,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:38,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:38,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:14:39,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:39,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:14:39,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-10 04:14:39,238 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [265], [268], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:14:39,239 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:14:39,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:14:39,245 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:14:39,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:14:39,818 INFO L272 AbstractInterpreter]: Visited 92 different actions 848 times. Merged at 18 different actions 200 times. Widened at 1 different actions 2 times. Performed 6307 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 40 fixpoints after 7 different actions. Largest state had 83 variables. [2019-09-10 04:14:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:39,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:14:39,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:39,818 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 04:14:39,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:39,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:14:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:39,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 04:14:39,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:14:41,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:14:42,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:14:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:42,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:14:43,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:14:43,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:14:44,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:14:45,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:14:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:14:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:14:45,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 26] total 78 [2019-09-10 04:14:45,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:14:45,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 04:14:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 04:14:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=5557, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 04:14:45,403 INFO L87 Difference]: Start difference. First operand 186199 states and 224272 transitions. Second operand 55 states. [2019-09-10 04:14:47,186 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 04:14:47,918 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-10 04:14:48,217 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 49 [2019-09-10 04:14:48,543 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 24 [2019-09-10 04:14:48,817 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 04:14:49,200 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 49 [2019-09-10 04:14:49,397 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-10 04:14:49,770 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-09-10 04:14:50,082 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 51 [2019-09-10 04:14:50,692 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 51 [2019-09-10 04:14:51,427 WARN L188 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 38 [2019-09-10 04:14:52,720 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 51 [2019-09-10 04:14:53,295 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 51 [2019-09-10 04:14:54,294 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 04:14:55,049 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-09-10 04:14:55,360 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 04:14:55,598 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 04:14:57,754 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-09-10 04:14:58,730 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-10 04:14:59,014 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 04:14:59,682 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 04:14:59,997 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 04:15:01,273 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 04:15:01,774 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 04:15:02,170 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-09-10 04:15:02,809 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 04:15:03,167 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2019-09-10 04:15:04,343 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 32 [2019-09-10 04:15:04,725 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 04:15:05,318 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-09-10 04:15:06,013 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-10 04:15:06,474 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 04:15:07,260 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-09-10 04:15:07,824 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 04:15:09,690 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 04:15:10,023 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 04:15:11,151 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 04:15:12,050 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 04:15:18,139 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 49 [2019-09-10 04:15:19,449 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 04:15:19,923 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-10 04:15:21,078 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-10 04:15:22,290 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-10 04:15:22,509 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 04:15:23,209 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-09-10 04:15:23,436 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 04:15:23,753 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2019-09-10 04:15:25,733 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 04:15:26,102 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 49 [2019-09-10 04:15:28,308 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-09-10 04:15:28,620 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 65 [2019-09-10 04:15:28,882 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-09-10 04:15:29,280 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 04:15:29,810 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 04:15:30,272 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-10 04:15:30,805 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2019-09-10 04:15:31,057 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-10 04:15:31,421 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-09-10 04:15:31,727 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 04:15:32,345 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-10 04:15:33,169 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 04:15:33,769 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-10 04:15:34,012 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-09-10 04:15:34,854 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 04:15:37,915 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 04:15:40,733 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-09-10 04:15:41,000 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-09-10 04:15:41,311 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-09-10 04:15:41,574 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-09-10 04:15:42,216 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 04:15:42,558 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 04:15:43,084 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 04:15:43,612 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 32 [2019-09-10 04:15:44,248 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 04:15:44,456 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-09-10 04:15:45,373 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 04:15:46,565 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 04:15:47,048 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-10 04:15:51,085 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 04:15:51,305 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:15:54,507 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-10 04:15:54,976 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 04:15:55,515 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-10 04:15:56,204 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 04:15:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:59,231 INFO L93 Difference]: Finished difference Result 389369 states and 466754 transitions. [2019-09-10 04:15:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 279 states. [2019-09-10 04:15:59,231 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-09-10 04:15:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:16:00,062 INFO L225 Difference]: With dead ends: 389369 [2019-09-10 04:16:00,062 INFO L226 Difference]: Without dead ends: 388418 [2019-09-10 04:16:00,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 289 SyntacticMatches, 5 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45852 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=11990, Invalid=111562, Unknown=0, NotChecked=0, Total=123552 [2019-09-10 04:16:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388418 states. [2019-09-10 04:16:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388418 to 361336. [2019-09-10 04:16:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361336 states. [2019-09-10 04:16:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361336 states to 361336 states and 434955 transitions. [2019-09-10 04:16:16,693 INFO L78 Accepts]: Start accepts. Automaton has 361336 states and 434955 transitions. Word has length 114 [2019-09-10 04:16:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:16:16,693 INFO L475 AbstractCegarLoop]: Abstraction has 361336 states and 434955 transitions. [2019-09-10 04:16:16,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 04:16:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 361336 states and 434955 transitions. [2019-09-10 04:16:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:16:16,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:16:16,729 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 04:16:16,730 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:16:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 704213928, now seen corresponding path program 1 times [2019-09-10 04:16:16,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:16:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:16,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:16,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:16:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 04:16:16,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:16,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:16:16,808 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 04:16:16,808 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [221], [223], [225], [228], [233], [235], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:16:16,810 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:16:16,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:16:16,817 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:16:17,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:16:17,326 INFO L272 AbstractInterpreter]: Visited 84 different actions 708 times. Merged at 14 different actions 135 times. Widened at 1 different actions 4 times. Performed 6426 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6426 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 4 different actions. Largest state had 83 variables. [2019-09-10 04:16:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:17,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:16:17,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:17,326 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 04:16:17,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:17,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:16:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:17,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:16:17,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:16:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-10 04:16:18,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:16:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-10 04:16:18,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:16:18,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:16:18,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:16:18,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:16:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:16:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:16:18,506 INFO L87 Difference]: Start difference. First operand 361336 states and 434955 transitions. Second operand 5 states. [2019-09-10 04:16:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:16:20,138 INFO L93 Difference]: Finished difference Result 356252 states and 429108 transitions. [2019-09-10 04:16:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:16:20,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 04:16:20,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:16:20,977 INFO L225 Difference]: With dead ends: 356252 [2019-09-10 04:16:20,977 INFO L226 Difference]: Without dead ends: 356150 [2019-09-10 04:16:20,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:16:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356150 states. [2019-09-10 04:16:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356150 to 355551. [2019-09-10 04:16:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355551 states. [2019-09-10 04:16:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355551 states to 355551 states and 428223 transitions. [2019-09-10 04:16:38,847 INFO L78 Accepts]: Start accepts. Automaton has 355551 states and 428223 transitions. Word has length 153 [2019-09-10 04:16:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:16:38,847 INFO L475 AbstractCegarLoop]: Abstraction has 355551 states and 428223 transitions. [2019-09-10 04:16:38,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:16:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 355551 states and 428223 transitions. [2019-09-10 04:16:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 04:16:38,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:16:38,867 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2019-09-10 04:16:38,867 INFO L418 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:16:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:38,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1485802595, now seen corresponding path program 1 times [2019-09-10 04:16:38,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:16:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:38,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:38,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:16:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-10 04:16:38,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:38,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:16:38,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 04:16:38,954 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [177], [179], [182], [185], [189], [193], [195], [196], [199], [221], [223], [225], [228], [231], [233], [235], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:16:38,956 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:16:38,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:16:38,965 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:16:39,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:16:39,364 INFO L272 AbstractInterpreter]: Visited 91 different actions 924 times. Merged at 18 different actions 207 times. Widened at 1 different actions 2 times. Performed 6983 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6983 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 44 fixpoints after 7 different actions. Largest state had 83 variables. [2019-09-10 04:16:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:39,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:16:39,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:39,365 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 04:16:39,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:39,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:16:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:39,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:16:39,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:16:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 04:16:39,625 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:16:39,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:16:39,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:16:39,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:16:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 04:16:39,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:16:39,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 20 [2019-09-10 04:16:39,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:16:39,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 04:16:39,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 04:16:39,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-09-10 04:16:39,814 INFO L87 Difference]: Start difference. First operand 355551 states and 428223 transitions. Second operand 15 states. [2019-09-10 04:16:40,949 WARN L188 SmtUtils]: Spent 806.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-10 04:16:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:16:43,334 INFO L93 Difference]: Finished difference Result 191357 states and 230992 transitions. [2019-09-10 04:16:43,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 04:16:43,335 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 155 [2019-09-10 04:16:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:16:43,733 INFO L225 Difference]: With dead ends: 191357 [2019-09-10 04:16:43,734 INFO L226 Difference]: Without dead ends: 188339 [2019-09-10 04:16:43,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=511, Invalid=2039, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 04:16:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188339 states. [2019-09-10 04:16:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188339 to 178006. [2019-09-10 04:16:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178006 states. [2019-09-10 04:16:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178006 states to 178006 states and 209643 transitions. [2019-09-10 04:16:54,065 INFO L78 Accepts]: Start accepts. Automaton has 178006 states and 209643 transitions. Word has length 155 [2019-09-10 04:16:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:16:54,066 INFO L475 AbstractCegarLoop]: Abstraction has 178006 states and 209643 transitions. [2019-09-10 04:16:54,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 04:16:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 178006 states and 209643 transitions. [2019-09-10 04:16:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 04:16:54,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:16:54,098 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:54,099 INFO L418 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:16:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:54,099 INFO L82 PathProgramCache]: Analyzing trace with hash -499770448, now seen corresponding path program 1 times [2019-09-10 04:16:54,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:16:54,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:54,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:54,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:54,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:16:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-10 04:16:54,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:54,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:16:54,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2019-09-10 04:16:54,257 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [138], [143], [148], [149], [150], [153], [175], [177], [179], [191], [193], [195], [196], [199], [221], [223], [225], [237], [249], [251], [253], [254], [255], [256], [259], [281], [283], [285], [297], [309], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:16:54,259 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:16:54,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:16:54,267 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:16:54,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:16:54,551 INFO L272 AbstractInterpreter]: Visited 81 different actions 725 times. Merged at 18 different actions 193 times. Widened at 1 different actions 3 times. Performed 5830 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5830 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 40 fixpoints after 5 different actions. Largest state had 83 variables. [2019-09-10 04:16:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:54,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:16:54,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:54,551 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 04:16:54,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:54,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:16:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:54,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 04:16:54,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:16:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-09-10 04:16:54,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:16:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-10 04:16:54,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:16:54,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 12 [2019-09-10 04:16:54,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:16:54,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:16:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:16:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:16:54,967 INFO L87 Difference]: Start difference. First operand 178006 states and 209643 transitions. Second operand 7 states. [2019-09-10 04:16:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:16:55,708 INFO L93 Difference]: Finished difference Result 156454 states and 183719 transitions. [2019-09-10 04:16:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:16:55,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-10 04:16:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:16:56,166 INFO L225 Difference]: With dead ends: 156454 [2019-09-10 04:16:56,167 INFO L226 Difference]: Without dead ends: 148625 [2019-09-10 04:16:56,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 346 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-09-10 04:16:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148625 states. [2019-09-10 04:16:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148625 to 144564. [2019-09-10 04:16:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144564 states. [2019-09-10 04:16:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144564 states to 144564 states and 170221 transitions. [2019-09-10 04:16:59,077 INFO L78 Accepts]: Start accepts. Automaton has 144564 states and 170221 transitions. Word has length 180 [2019-09-10 04:16:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:16:59,077 INFO L475 AbstractCegarLoop]: Abstraction has 144564 states and 170221 transitions. [2019-09-10 04:16:59,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:16:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 144564 states and 170221 transitions. [2019-09-10 04:16:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 04:16:59,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:16:59,120 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:59,120 INFO L418 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:16:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash 853085804, now seen corresponding path program 1 times [2019-09-10 04:16:59,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:16:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:59,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:59,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:16:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 27 proven. 46 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-10 04:16:59,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:59,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:16:59,296 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2019-09-10 04:16:59,296 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [138], [143], [148], [149], [150], [153], [175], [177], [179], [191], [193], [195], [196], [199], [221], [223], [225], [237], [249], [251], [253], [254], [255], [256], [259], [281], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:16:59,297 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:16:59,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:16:59,305 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:17:00,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:17:00,052 INFO L272 AbstractInterpreter]: Visited 82 different actions 802 times. Merged at 18 different actions 206 times. Widened at 1 different actions 3 times. Performed 6257 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6257 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 45 fixpoints after 6 different actions. Largest state had 83 variables. [2019-09-10 04:17:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:00,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:17:00,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:00,052 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:17:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:00,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:17:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:00,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 04:17:00,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:17:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 25 proven. 143 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 04:17:00,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:17:00,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:00,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:01,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:01,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:01,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:17:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-10 04:17:01,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:17:01,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 15] total 40 [2019-09-10 04:17:01,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:17:01,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 04:17:01,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 04:17:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1199, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 04:17:01,410 INFO L87 Difference]: Start difference. First operand 144564 states and 170221 transitions. Second operand 29 states. [2019-09-10 04:17:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:17:07,492 INFO L93 Difference]: Finished difference Result 242728 states and 286499 transitions. [2019-09-10 04:17:07,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 04:17:07,493 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 182 [2019-09-10 04:17:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:17:08,078 INFO L225 Difference]: With dead ends: 242728 [2019-09-10 04:17:08,078 INFO L226 Difference]: Without dead ends: 242136 [2019-09-10 04:17:08,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 332 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1513 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=936, Invalid=3756, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 04:17:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242136 states. [2019-09-10 04:17:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242136 to 228187. [2019-09-10 04:17:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228187 states. [2019-09-10 04:17:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228187 states to 228187 states and 267792 transitions. [2019-09-10 04:17:12,602 INFO L78 Accepts]: Start accepts. Automaton has 228187 states and 267792 transitions. Word has length 182 [2019-09-10 04:17:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:17:12,602 INFO L475 AbstractCegarLoop]: Abstraction has 228187 states and 267792 transitions. [2019-09-10 04:17:12,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 04:17:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 228187 states and 267792 transitions. [2019-09-10 04:17:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 04:17:12,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:17:12,620 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-10 04:17:12,620 INFO L418 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:17:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:12,621 INFO L82 PathProgramCache]: Analyzing trace with hash 18431171, now seen corresponding path program 1 times [2019-09-10 04:17:12,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:17:12,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:12,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:12,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:12,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:17:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 71 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 04:17:12,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:12,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:17:12,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 04:17:12,725 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [208], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [278], [281], [283], [285], [297], [309], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:17:12,727 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:17:12,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:17:12,734 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:17:13,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:17:13,673 INFO L272 AbstractInterpreter]: Visited 90 different actions 1778 times. Merged at 21 different actions 519 times. Widened at 1 different actions 7 times. Performed 13699 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13699 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 122 fixpoints after 8 different actions. Largest state had 83 variables. [2019-09-10 04:17:13,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:13,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:17:13,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:13,673 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:17:13,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:13,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:17:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:13,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 04:17:13,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:17:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 69 proven. 107 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:17:13,993 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:17:17,169 WARN L188 SmtUtils]: Spent 2.95 s on a formula simplification that was a NOOP. DAG size: 1 [2019-09-10 04:17:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 49 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 04:17:17,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:17:17,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2019-09-10 04:17:17,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:17:17,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 04:17:17,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 04:17:17,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-09-10 04:17:17,244 INFO L87 Difference]: Start difference. First operand 228187 states and 267792 transitions. Second operand 16 states. [2019-09-10 04:17:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:17:19,067 INFO L93 Difference]: Finished difference Result 248270 states and 286671 transitions. [2019-09-10 04:17:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 04:17:19,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 193 [2019-09-10 04:17:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:17:19,687 INFO L225 Difference]: With dead ends: 248270 [2019-09-10 04:17:19,688 INFO L226 Difference]: Without dead ends: 248270 [2019-09-10 04:17:19,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 377 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:17:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248270 states. [2019-09-10 04:17:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248270 to 242430. [2019-09-10 04:17:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242430 states. [2019-09-10 04:17:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242430 states to 242430 states and 280684 transitions. [2019-09-10 04:17:23,819 INFO L78 Accepts]: Start accepts. Automaton has 242430 states and 280684 transitions. Word has length 193 [2019-09-10 04:17:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:17:23,819 INFO L475 AbstractCegarLoop]: Abstraction has 242430 states and 280684 transitions. [2019-09-10 04:17:23,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 04:17:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 242430 states and 280684 transitions. [2019-09-10 04:17:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 04:17:23,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:17:23,834 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 04:17:23,834 INFO L418 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:17:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1677286676, now seen corresponding path program 1 times [2019-09-10 04:17:23,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:17:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:23,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:23,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:17:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-10 04:17:23,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:23,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:17:23,958 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 04:17:23,959 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [175], [177], [179], [182], [185], [187], [189], [193], [195], [196], [199], [202], [218], [221], [223], [225], [237], [240], [243], [247], [249], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [281], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:17:23,960 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:17:23,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:17:23,968 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:17:28,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:17:28,557 INFO L272 AbstractInterpreter]: Visited 97 different actions 2208 times. Merged at 25 different actions 694 times. Widened at 1 different actions 7 times. Performed 16098 root evaluator evaluations with a maximum evaluation depth of 6. Performed 16098 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 174 fixpoints after 7 different actions. Largest state had 83 variables. [2019-09-10 04:17:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:28,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:17:28,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:28,558 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:17:28,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:28,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:17:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:28,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 04:17:28,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:17:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 135 proven. 31 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:17:28,819 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:17:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 38 proven. 39 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-10 04:17:29,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:17:29,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 17 [2019-09-10 04:17:29,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:17:29,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:17:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:17:29,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:17:29,075 INFO L87 Difference]: Start difference. First operand 242430 states and 280684 transitions. Second operand 12 states. [2019-09-10 04:17:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:17:30,973 INFO L93 Difference]: Finished difference Result 147173 states and 167717 transitions. [2019-09-10 04:17:30,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 04:17:30,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 193 [2019-09-10 04:17:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:17:31,268 INFO L225 Difference]: With dead ends: 147173 [2019-09-10 04:17:31,268 INFO L226 Difference]: Without dead ends: 145364 [2019-09-10 04:17:31,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 387 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2019-09-10 04:17:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145364 states. [2019-09-10 04:17:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145364 to 136885. [2019-09-10 04:17:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136885 states. [2019-09-10 04:17:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136885 states to 136885 states and 156604 transitions. [2019-09-10 04:17:33,339 INFO L78 Accepts]: Start accepts. Automaton has 136885 states and 156604 transitions. Word has length 193 [2019-09-10 04:17:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:17:33,340 INFO L475 AbstractCegarLoop]: Abstraction has 136885 states and 156604 transitions. [2019-09-10 04:17:33,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 04:17:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 136885 states and 156604 transitions. [2019-09-10 04:17:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 04:17:33,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:17:33,352 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-10 04:17:33,352 INFO L418 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:17:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash -874635609, now seen corresponding path program 1 times [2019-09-10 04:17:33,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:17:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:33,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:33,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:17:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 38 proven. 64 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-10 04:17:34,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:34,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:17:34,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2019-09-10 04:17:34,123 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [218], [223], [225], [237], [240], [243], [247], [249], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [281], [283], [285], [288], [291], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:17:34,124 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:17:34,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:17:34,130 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:17:34,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:17:34,834 INFO L272 AbstractInterpreter]: Visited 95 different actions 1747 times. Merged at 24 different actions 523 times. Widened at 1 different actions 5 times. Performed 12837 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12837 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 125 fixpoints after 7 different actions. Largest state had 83 variables. [2019-09-10 04:17:34,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:34,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:17:34,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:34,834 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:17:34,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:34,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:17:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:34,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 04:17:34,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:17:35,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 117 proven. 64 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:17:35,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:17:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:36,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:36,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:36,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:17:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 59 proven. 44 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-10 04:17:37,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:17:37,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 17] total 46 [2019-09-10 04:17:37,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:17:37,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 04:17:37,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 04:17:37,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1888, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 04:17:37,035 INFO L87 Difference]: Start difference. First operand 136885 states and 156604 transitions. Second operand 34 states. [2019-09-10 04:17:37,523 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 04:17:37,710 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 04:17:38,116 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 04:17:38,523 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 04:17:38,847 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:17:45,380 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-10 04:17:46,269 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 04:17:48,167 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 04:17:48,531 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 04:17:50,059 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 04:17:50,222 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 04:17:50,789 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 04:17:50,942 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 04:17:51,612 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 04:17:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:17:53,407 INFO L93 Difference]: Finished difference Result 385593 states and 440697 transitions. [2019-09-10 04:17:53,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 04:17:53,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 194 [2019-09-10 04:17:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:17:54,202 INFO L225 Difference]: With dead ends: 385593 [2019-09-10 04:17:54,203 INFO L226 Difference]: Without dead ends: 385593 [2019-09-10 04:17:54,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 395 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5101 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=3057, Invalid=16125, Unknown=0, NotChecked=0, Total=19182 [2019-09-10 04:17:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385593 states. [2019-09-10 04:18:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385593 to 304273. [2019-09-10 04:18:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304273 states. [2019-09-10 04:18:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304273 states to 304273 states and 349218 transitions. [2019-09-10 04:18:01,779 INFO L78 Accepts]: Start accepts. Automaton has 304273 states and 349218 transitions. Word has length 194 [2019-09-10 04:18:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:18:01,780 INFO L475 AbstractCegarLoop]: Abstraction has 304273 states and 349218 transitions. [2019-09-10 04:18:01,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 04:18:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 304273 states and 349218 transitions. [2019-09-10 04:18:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 04:18:01,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:18:01,802 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2019-09-10 04:18:01,802 INFO L418 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:18:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:18:01,803 INFO L82 PathProgramCache]: Analyzing trace with hash -440906523, now seen corresponding path program 1 times [2019-09-10 04:18:01,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:18:01,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:18:01,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:18:01,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:18:01,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:18:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:18:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 04:18:01,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:18:01,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:18:01,912 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2019-09-10 04:18:01,912 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [218], [223], [225], [237], [240], [243], [247], [249], [251], [253], [254], [255], [256], [259], [262], [265], [270], [273], [281], [283], [285], [288], [291], [293], [295], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:18:01,913 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:18:01,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:18:01,921 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:18:03,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:18:03,838 INFO L272 AbstractInterpreter]: Visited 96 different actions 1777 times. Merged at 24 different actions 514 times. Widened at 1 different actions 6 times. Performed 13215 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 123 fixpoints after 7 different actions. Largest state had 83 variables. [2019-09-10 04:18:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:18:03,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:18:03,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:18:03,838 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:18:03,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:18:03,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:18:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:18:03,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 04:18:03,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:18:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 97 proven. 78 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:18:04,083 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:18:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 26 proven. 52 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-10 04:18:04,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:18:04,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 20 [2019-09-10 04:18:04,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:18:04,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:18:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:18:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-09-10 04:18:04,337 INFO L87 Difference]: Start difference. First operand 304273 states and 349218 transitions. Second operand 13 states. [2019-09-10 04:18:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:18:08,069 INFO L93 Difference]: Finished difference Result 473876 states and 537640 transitions. [2019-09-10 04:18:08,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 04:18:08,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2019-09-10 04:18:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:18:10,790 INFO L225 Difference]: With dead ends: 473876 [2019-09-10 04:18:10,790 INFO L226 Difference]: Without dead ends: 473864 [2019-09-10 04:18:10,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 388 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1498, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 04:18:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473864 states. [2019-09-10 04:18:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473864 to 454825. [2019-09-10 04:18:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454825 states. [2019-09-10 04:18:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454825 states to 454825 states and 517009 transitions. [2019-09-10 04:18:25,490 INFO L78 Accepts]: Start accepts. Automaton has 454825 states and 517009 transitions. Word has length 194 [2019-09-10 04:18:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:18:25,490 INFO L475 AbstractCegarLoop]: Abstraction has 454825 states and 517009 transitions. [2019-09-10 04:18:25,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:18:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 454825 states and 517009 transitions. [2019-09-10 04:18:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 04:18:25,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:18:25,528 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 04:18:25,528 INFO L418 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:18:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:18:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2121765220, now seen corresponding path program 1 times [2019-09-10 04:18:25,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:18:25,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:18:25,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:18:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:18:25,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:18:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:18:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-10 04:18:25,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:18:25,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:18:25,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-09-10 04:18:25,622 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [208], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [278], [281], [283], [285], [297], [300], [305], [307], [309], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:18:25,623 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:18:25,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:18:25,631 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:18:27,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:18:27,016 INFO L272 AbstractInterpreter]: Visited 96 different actions 2571 times. Merged at 24 different actions 812 times. Widened at 1 different actions 9 times. Performed 18936 root evaluator evaluations with a maximum evaluation depth of 6. Performed 18936 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 196 fixpoints after 8 different actions. Largest state had 83 variables. [2019-09-10 04:18:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:18:27,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:18:27,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:18:27,016 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:18:27,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:18:27,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:18:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:18:32,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 04:18:32,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:18:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 166 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:18:32,663 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:18:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-10 04:18:32,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:18:32,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2019-09-10 04:18:32,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:18:32,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:18:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:18:32,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:18:32,781 INFO L87 Difference]: Start difference. First operand 454825 states and 517009 transitions. Second operand 8 states. [2019-09-10 04:18:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:18:34,432 INFO L93 Difference]: Finished difference Result 391318 states and 439697 transitions. [2019-09-10 04:18:34,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 04:18:34,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-09-10 04:18:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:18:35,886 INFO L225 Difference]: With dead ends: 391318 [2019-09-10 04:18:35,886 INFO L226 Difference]: Without dead ends: 391318 [2019-09-10 04:18:35,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:18:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391318 states. [2019-09-10 04:18:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391318 to 376060. [2019-09-10 04:18:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376060 states. [2019-09-10 04:18:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376060 states to 376060 states and 423360 transitions. [2019-09-10 04:18:47,374 INFO L78 Accepts]: Start accepts. Automaton has 376060 states and 423360 transitions. Word has length 195 [2019-09-10 04:18:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:18:47,375 INFO L475 AbstractCegarLoop]: Abstraction has 376060 states and 423360 transitions. [2019-09-10 04:18:47,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:18:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 376060 states and 423360 transitions. [2019-09-10 04:18:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 04:18:47,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:18:47,408 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 04:18:47,408 INFO L418 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:18:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:18:47,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1971378142, now seen corresponding path program 1 times [2019-09-10 04:18:47,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:18:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:18:47,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:18:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:18:47,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:18:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:18:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 96 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 04:18:48,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:18:48,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:18:48,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-09-10 04:18:48,147 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [103], [104], [105], [107], [116], [120], [122], [124], [130], [133], [136], [146], [148], [149], [150], [153], [156], [159], [164], [167], [175], [177], [179], [182], [185], [189], [193], [195], [196], [199], [202], [205], [208], [210], [213], [223], [225], [228], [231], [235], [251], [253], [254], [255], [256], [259], [262], [278], [281], [283], [285], [297], [300], [303], [307], [309], [311], [313], [314], [317], [319], [322], [324], [328], [329], [330], [331], [332], [333], [334], [335], [336], [337], [338], [339], [340], [341], [342] [2019-09-10 04:18:48,148 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:18:48,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:18:48,156 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:18:50,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:18:50,410 INFO L272 AbstractInterpreter]: Visited 96 different actions 2394 times. Merged at 24 different actions 787 times. Widened at 1 different actions 8 times. Performed 17395 root evaluator evaluations with a maximum evaluation depth of 6. Performed 17395 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 194 fixpoints after 8 different actions. Largest state had 83 variables. [2019-09-10 04:18:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:18:50,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:18:50,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:18:50,410 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:18:50,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:18:50,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:18:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:18:50,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 04:18:50,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:18:50,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:18:50,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:18:51,741 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-10 04:18:52,731 WARN L188 SmtUtils]: Spent 870.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-10 04:18:52,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:18:53,738 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-09-10 04:18:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 73 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:18:53,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:18:54,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:18:54,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:19:00,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:19:00,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:19:00,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:19:00,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:19:00,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:19:00,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:19:00,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:19:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 55 proven. 54 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:19:00,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:19:00,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 19] total 62 [2019-09-10 04:19:00,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:19:00,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 04:19:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 04:19:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3556, Unknown=1, NotChecked=0, Total=3782 [2019-09-10 04:19:00,833 INFO L87 Difference]: Start difference. First operand 376060 states and 423360 transitions. Second operand 45 states. [2019-09-10 04:19:01,390 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 04:19:10,238 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 04:19:11,770 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:19:28,203 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 04:19:37,232 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 04:19:38,549 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 04:19:54,394 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 04:19:59,245 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 04:20:02,237 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 04:20:04,452 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-10 04:20:04,887 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 04:20:10,723 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-09-10 04:20:10,992 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 04:20:12,670 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 04:20:13,192 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:20:15,906 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 04:20:16,102 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 04:20:16,533 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 04:20:20,572 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 04:20:26,861 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 04:20:27,100 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 04:20:27,662 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 04:20:27,904 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 04:20:28,809 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 04:20:29,139 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 04:20:30,151 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-09-10 04:20:30,367 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-09-10 04:20:31,525 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 04:20:32,621 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 04:20:39,510 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-09-10 04:20:39,709 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-09-10 04:20:39,937 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-09-10 04:20:40,150 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-09-10 04:20:41,407 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 04:20:42,275 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 04:20:42,503 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 04:20:42,910 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 04:20:43,164 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 04:20:44,530 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-09-10 04:20:44,803 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-09-10 04:20:46,214 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2019-09-10 04:20:46,439 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-09-10 04:20:48,560 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 04:20:48,792 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 04:20:49,318 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 04:20:49,531 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-09-10 04:20:49,732 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 04:20:49,923 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-09-10 04:20:50,238 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 04:20:50,438 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 04:20:50,825 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 04:20:51,051 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:20:51,235 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 04:20:52,415 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 04:20:54,109 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 04:20:54,356 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-09-10 04:20:54,572 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-09-10 04:20:57,006 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 04:20:58,070 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 04:20:58,431 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-09-10 04:20:58,917 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-09-10 04:21:00,283 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-09-10 04:21:00,724 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 04:21:03,485 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2019-09-10 04:21:03,904 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 04:21:09,312 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-10 04:21:13,641 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-09-10 04:21:13,955 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-10 04:21:15,050 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 04:21:17,653 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-09-10 04:21:17,846 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-09-10 04:21:18,369 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-10 04:21:23,089 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 04:21:24,674 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-09-10 04:21:24,848 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 04:21:26,240 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-09-10 04:21:26,526 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 04:21:26,710 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-10 04:21:26,893 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 04:21:27,065 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:21:29,704 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 04:21:30,155 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 04:21:30,418 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55