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.4.1.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:26:59,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:26:59,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:26:59,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:26:59,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:26:59,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:26:59,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:26:59,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:26:59,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:26:59,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:26:59,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:26:59,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:26:59,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:26:59,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:26:59,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:26:59,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:26:59,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:26:59,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:26:59,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:26:59,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:26:59,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:26:59,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:26:59,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:26:59,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:26:59,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:26:59,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:26:59,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:26:59,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:26:59,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:26:59,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:26:59,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:26:59,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:26:59,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:26:59,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:26:59,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:26:59,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:26:59,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:26:59,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:26:59,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:26:59,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:26:59,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:26:59,411 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:26:59,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:26:59,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:26:59,426 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:26:59,426 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:26:59,427 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:26:59,427 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:26:59,427 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:26:59,427 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:26:59,427 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:26:59,428 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:26:59,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:26:59,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:26:59,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:26:59,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:26:59,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:26:59,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:26:59,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:26:59,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:26:59,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:26:59,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:26:59,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:26:59,431 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:26:59,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:26:59,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:26:59,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:26:59,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:26:59,432 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:26:59,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:26:59,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:26:59,432 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:26:59,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:26:59,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:26:59,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:26:59,476 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:26:59,477 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:26:59,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2019-09-10 04:26:59,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bde165a3/b0890560831e469eb1d96216261ba727/FLAGa43e1b3d9 [2019-09-10 04:27:00,096 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:27:00,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2019-09-10 04:27:00,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bde165a3/b0890560831e469eb1d96216261ba727/FLAGa43e1b3d9 [2019-09-10 04:27:00,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bde165a3/b0890560831e469eb1d96216261ba727 [2019-09-10 04:27:00,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:27:00,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:27:00,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:27:00,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:27:00,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:27:00,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d62613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00, skipping insertion in model container [2019-09-10 04:27:00,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,418 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:27:00,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:27:00,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:27:00,772 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:27:00,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:27:00,848 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:27:00,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00 WrapperNode [2019-09-10 04:27:00,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:27:00,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:27:00,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:27:00,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:27:00,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (1/1) ... [2019-09-10 04:27:00,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:27:00,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:27:00,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:27:00,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:27:00,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:27:00,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:27:00,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:27:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:27:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:27:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:27:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:27:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:27:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:27:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:27:00,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:27:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:27:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:27:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:27:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:27:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:27:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:27:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:27:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:27:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:27:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:27:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:27:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:27:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:27:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:27:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:27:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:27:01,561 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:27:01,562 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:27:01,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:27:01 BoogieIcfgContainer [2019-09-10 04:27:01,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:27:01,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:27:01,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:27:01,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:27:01,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:27:00" (1/3) ... [2019-09-10 04:27:01,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8b73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:27:01, skipping insertion in model container [2019-09-10 04:27:01,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:27:00" (2/3) ... [2019-09-10 04:27:01,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8b73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:27:01, skipping insertion in model container [2019-09-10 04:27:01,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:27:01" (3/3) ... [2019-09-10 04:27:01,574 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2019-09-10 04:27:01,584 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:27:01,593 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:27:01,611 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:27:01,652 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:27:01,652 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:27:01,652 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:27:01,652 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:27:01,653 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:27:01,653 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:27:01,653 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:27:01,653 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:27:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2019-09-10 04:27:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 04:27:01,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:01,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:01,717 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2014503021, now seen corresponding path program 1 times [2019-09-10 04:27:01,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:01,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:01,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:02,121 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:27:02,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:02,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:02,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:02,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:02,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:02,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:02,159 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 5 states. [2019-09-10 04:27:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:02,302 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2019-09-10 04:27:02,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:27:02,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 04:27:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:02,325 INFO L225 Difference]: With dead ends: 109 [2019-09-10 04:27:02,325 INFO L226 Difference]: Without dead ends: 100 [2019-09-10 04:27:02,328 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:27:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-10 04:27:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-10 04:27:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 04:27:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2019-09-10 04:27:02,395 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 54 [2019-09-10 04:27:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:02,396 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2019-09-10 04:27:02,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2019-09-10 04:27:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 04:27:02,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:02,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:02,403 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:02,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash -193101352, now seen corresponding path program 1 times [2019-09-10 04:27:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:02,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:02,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:02,845 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:27:02,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:02,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:27:02,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:02,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:27:02,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:27:02,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:27:02,849 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand 11 states. [2019-09-10 04:27:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:05,685 INFO L93 Difference]: Finished difference Result 689 states and 979 transitions. [2019-09-10 04:27:05,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 04:27:05,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-09-10 04:27:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:05,697 INFO L225 Difference]: With dead ends: 689 [2019-09-10 04:27:05,697 INFO L226 Difference]: Without dead ends: 689 [2019-09-10 04:27:05,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:27:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-10 04:27:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 492. [2019-09-10 04:27:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-09-10 04:27:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 686 transitions. [2019-09-10 04:27:05,785 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 686 transitions. Word has length 76 [2019-09-10 04:27:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:05,787 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 686 transitions. [2019-09-10 04:27:05,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:27:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 686 transitions. [2019-09-10 04:27:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:05,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:05,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:05,795 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:05,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:05,799 INFO L82 PathProgramCache]: Analyzing trace with hash -992152536, now seen corresponding path program 1 times [2019-09-10 04:27:05,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:05,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:05,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:05,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:05,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:05,905 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:27:05,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:05,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:27:05,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:05,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:27:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:27:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:27:05,907 INFO L87 Difference]: Start difference. First operand 492 states and 686 transitions. Second operand 3 states. [2019-09-10 04:27:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:05,937 INFO L93 Difference]: Finished difference Result 905 states and 1262 transitions. [2019-09-10 04:27:05,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:27:05,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 04:27:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:05,946 INFO L225 Difference]: With dead ends: 905 [2019-09-10 04:27:05,946 INFO L226 Difference]: Without dead ends: 905 [2019-09-10 04:27:05,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:27:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-10 04:27:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903. [2019-09-10 04:27:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-10 04:27:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1261 transitions. [2019-09-10 04:27:06,027 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1261 transitions. Word has length 78 [2019-09-10 04:27:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:06,028 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1261 transitions. [2019-09-10 04:27:06,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:27:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1261 transitions. [2019-09-10 04:27:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:06,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:06,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:06,032 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2015112304, now seen corresponding path program 1 times [2019-09-10 04:27:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:06,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:06,172 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:27:06,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:06,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:06,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:06,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:06,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:06,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:06,174 INFO L87 Difference]: Start difference. First operand 903 states and 1261 transitions. Second operand 5 states. [2019-09-10 04:27:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:06,628 INFO L93 Difference]: Finished difference Result 1404 states and 1934 transitions. [2019-09-10 04:27:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:27:06,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:27:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:06,638 INFO L225 Difference]: With dead ends: 1404 [2019-09-10 04:27:06,638 INFO L226 Difference]: Without dead ends: 1404 [2019-09-10 04:27:06,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:27:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2019-09-10 04:27:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1402. [2019-09-10 04:27:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-09-10 04:27:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1933 transitions. [2019-09-10 04:27:06,696 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1933 transitions. Word has length 78 [2019-09-10 04:27:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:06,696 INFO L475 AbstractCegarLoop]: Abstraction has 1402 states and 1933 transitions. [2019-09-10 04:27:06,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1933 transitions. [2019-09-10 04:27:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:06,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:06,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:06,699 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 828457530, now seen corresponding path program 1 times [2019-09-10 04:27:06,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:06,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:06,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:06,798 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:27:06,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:06,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:06,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:06,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:06,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:06,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:06,801 INFO L87 Difference]: Start difference. First operand 1402 states and 1933 transitions. Second operand 5 states. [2019-09-10 04:27:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:07,185 INFO L93 Difference]: Finished difference Result 2625 states and 3594 transitions. [2019-09-10 04:27:07,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:27:07,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:27:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:07,204 INFO L225 Difference]: With dead ends: 2625 [2019-09-10 04:27:07,204 INFO L226 Difference]: Without dead ends: 2625 [2019-09-10 04:27:07,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:27:07,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2019-09-10 04:27:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2623. [2019-09-10 04:27:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2623 states. [2019-09-10 04:27:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 3593 transitions. [2019-09-10 04:27:07,328 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 3593 transitions. Word has length 78 [2019-09-10 04:27:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:07,329 INFO L475 AbstractCegarLoop]: Abstraction has 2623 states and 3593 transitions. [2019-09-10 04:27:07,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3593 transitions. [2019-09-10 04:27:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:07,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:07,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:07,332 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:07,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2024202800, now seen corresponding path program 1 times [2019-09-10 04:27:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:07,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:07,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:07,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:07,589 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:27:07,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:07,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:27:07,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:07,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:27:07,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:27:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:27:07,591 INFO L87 Difference]: Start difference. First operand 2623 states and 3593 transitions. Second operand 11 states. [2019-09-10 04:27:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:10,062 INFO L93 Difference]: Finished difference Result 3737 states and 5297 transitions. [2019-09-10 04:27:10,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 04:27:10,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-09-10 04:27:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:10,092 INFO L225 Difference]: With dead ends: 3737 [2019-09-10 04:27:10,092 INFO L226 Difference]: Without dead ends: 3737 [2019-09-10 04:27:10,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:27:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2019-09-10 04:27:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 2641. [2019-09-10 04:27:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2641 states. [2019-09-10 04:27:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3589 transitions. [2019-09-10 04:27:10,275 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3589 transitions. Word has length 78 [2019-09-10 04:27:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:10,276 INFO L475 AbstractCegarLoop]: Abstraction has 2641 states and 3589 transitions. [2019-09-10 04:27:10,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:27:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3589 transitions. [2019-09-10 04:27:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:10,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:10,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:10,286 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash -346219996, now seen corresponding path program 1 times [2019-09-10 04:27:10,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:10,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:10,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:10,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:10,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:10,402 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:27:10,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:10,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:27:10,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:10,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:27:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:27:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:27:10,405 INFO L87 Difference]: Start difference. First operand 2641 states and 3589 transitions. Second operand 9 states. [2019-09-10 04:27:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:10,977 INFO L93 Difference]: Finished difference Result 3283 states and 4378 transitions. [2019-09-10 04:27:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:27:10,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 04:27:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:10,994 INFO L225 Difference]: With dead ends: 3283 [2019-09-10 04:27:10,994 INFO L226 Difference]: Without dead ends: 3283 [2019-09-10 04:27:10,995 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:27:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2019-09-10 04:27:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 2685. [2019-09-10 04:27:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2019-09-10 04:27:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3645 transitions. [2019-09-10 04:27:11,096 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3645 transitions. Word has length 78 [2019-09-10 04:27:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:11,098 INFO L475 AbstractCegarLoop]: Abstraction has 2685 states and 3645 transitions. [2019-09-10 04:27:11,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:27:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3645 transitions. [2019-09-10 04:27:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:27:11,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:11,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:11,099 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1910587116, now seen corresponding path program 1 times [2019-09-10 04:27:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:11,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:11,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:11,199 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:27:11,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:27:11,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:11,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:27:11,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:27:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:27:11,201 INFO L87 Difference]: Start difference. First operand 2685 states and 3645 transitions. Second operand 9 states. [2019-09-10 04:27:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:11,855 INFO L93 Difference]: Finished difference Result 3777 states and 5101 transitions. [2019-09-10 04:27:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:27:11,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 04:27:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:11,877 INFO L225 Difference]: With dead ends: 3777 [2019-09-10 04:27:11,877 INFO L226 Difference]: Without dead ends: 3771 [2019-09-10 04:27:11,878 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:27:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2019-09-10 04:27:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 2738. [2019-09-10 04:27:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-09-10 04:27:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3722 transitions. [2019-09-10 04:27:11,996 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3722 transitions. Word has length 78 [2019-09-10 04:27:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:11,997 INFO L475 AbstractCegarLoop]: Abstraction has 2738 states and 3722 transitions. [2019-09-10 04:27:11,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:27:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3722 transitions. [2019-09-10 04:27:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:27:11,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:11,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:11,998 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:11,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:11,999 INFO L82 PathProgramCache]: Analyzing trace with hash -19622377, now seen corresponding path program 1 times [2019-09-10 04:27:11,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:12,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:12,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:12,078 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:27:12,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:12,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:27:12,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:12,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:27:12,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:27:12,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:27:12,080 INFO L87 Difference]: Start difference. First operand 2738 states and 3722 transitions. Second operand 5 states. [2019-09-10 04:27:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:12,515 INFO L93 Difference]: Finished difference Result 3495 states and 4757 transitions. [2019-09-10 04:27:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:27:12,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 04:27:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:12,540 INFO L225 Difference]: With dead ends: 3495 [2019-09-10 04:27:12,540 INFO L226 Difference]: Without dead ends: 3495 [2019-09-10 04:27:12,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:27:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2019-09-10 04:27:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3420. [2019-09-10 04:27:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3420 states. [2019-09-10 04:27:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 4655 transitions. [2019-09-10 04:27:12,685 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 4655 transitions. Word has length 79 [2019-09-10 04:27:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:12,685 INFO L475 AbstractCegarLoop]: Abstraction has 3420 states and 4655 transitions. [2019-09-10 04:27:12,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:27:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 4655 transitions. [2019-09-10 04:27:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:27:12,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:12,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:27:12,687 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1627802584, now seen corresponding path program 1 times [2019-09-10 04:27:12,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:12,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:12,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:27:12,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:27:12,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:27:12,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:12,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:27:12,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:27:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:27:12,852 INFO L87 Difference]: Start difference. First operand 3420 states and 4655 transitions. Second operand 8 states. [2019-09-10 04:27:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:27:12,942 INFO L93 Difference]: Finished difference Result 4214 states and 5864 transitions. [2019-09-10 04:27:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:27:12,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-10 04:27:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:27:12,969 INFO L225 Difference]: With dead ends: 4214 [2019-09-10 04:27:12,969 INFO L226 Difference]: Without dead ends: 4214 [2019-09-10 04:27:12,970 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:27:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2019-09-10 04:27:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 3798. [2019-09-10 04:27:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3798 states. [2019-09-10 04:27:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 5037 transitions. [2019-09-10 04:27:13,144 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 5037 transitions. Word has length 79 [2019-09-10 04:27:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:27:13,144 INFO L475 AbstractCegarLoop]: Abstraction has 3798 states and 5037 transitions. [2019-09-10 04:27:13,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:27:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 5037 transitions. [2019-09-10 04:27:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:27:13,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:27:13,149 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, 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:27:13,149 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:27:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1342328927, now seen corresponding path program 1 times [2019-09-10 04:27:13,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:27:13,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:27:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:27:13,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:27:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:27:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:27:13,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:27:13,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:27:13,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2019-09-10 04:27:13,300 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [218], [220], [222], [225], [229], [231], [232], [235], [238], [243], [246], [253], [255], [258], [262], [264], [265], [288], [291], [295], [297], [298], [299], [300], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:27:13,392 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:27:13,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:27:13,578 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:27:14,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:27:14,547 INFO L272 AbstractInterpreter]: Visited 91 different actions 624 times. Merged at 14 different actions 123 times. Widened at 1 different actions 3 times. Performed 5829 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5829 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 6 different actions. Largest state had 94 variables. [2019-09-10 04:27:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:27:14,552 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:27:14,846 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 77.17% of their original sizes. [2019-09-10 04:27:14,846 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:27:18,546 INFO L420 sIntCurrentIteration]: We unified 123 AI predicates to 123 [2019-09-10 04:27:18,546 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:27:18,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:27:18,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [5] total 73 [2019-09-10 04:27:18,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:27:18,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 04:27:18,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 04:27:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=4424, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 04:27:18,550 INFO L87 Difference]: Start difference. First operand 3798 states and 5037 transitions. Second operand 70 states. [2019-09-10 04:29:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:29:33,413 INFO L93 Difference]: Finished difference Result 6576 states and 9139 transitions. [2019-09-10 04:29:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 312 states. [2019-09-10 04:29:33,413 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 124 [2019-09-10 04:29:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:29:33,447 INFO L225 Difference]: With dead ends: 6576 [2019-09-10 04:29:33,448 INFO L226 Difference]: Without dead ends: 6576 [2019-09-10 04:29:33,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49610 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=8224, Invalid=116738, Unknown=0, NotChecked=0, Total=124962 [2019-09-10 04:29:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2019-09-10 04:29:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 5527. [2019-09-10 04:29:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5527 states. [2019-09-10 04:29:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 7322 transitions. [2019-09-10 04:29:33,655 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 7322 transitions. Word has length 124 [2019-09-10 04:29:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:29:33,656 INFO L475 AbstractCegarLoop]: Abstraction has 5527 states and 7322 transitions. [2019-09-10 04:29:33,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 04:29:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 7322 transitions. [2019-09-10 04:29:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:29:33,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:29:33,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:29:33,663 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:29:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:29:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1704375859, now seen corresponding path program 1 times [2019-09-10 04:29:33,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:29:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:29:33,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:29:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:29:33,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:29:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:29:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:29:34,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:29:34,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:29:34,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2019-09-10 04:29:34,209 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [218], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [268], [284], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [311], [314], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:29:34,223 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:29:34,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:29:34,246 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:29:34,941 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:29:34,942 INFO L272 AbstractInterpreter]: Visited 97 different actions 957 times. Merged at 18 different actions 221 times. Widened at 1 different actions 2 times. Performed 8574 root evaluator evaluations with a maximum evaluation depth of 5. Performed 8574 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 7 different actions. Largest state had 94 variables. [2019-09-10 04:29:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:29:34,942 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:29:35,139 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 77.62% of their original sizes. [2019-09-10 04:29:35,140 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:29:39,037 INFO L420 sIntCurrentIteration]: We unified 123 AI predicates to 123 [2019-09-10 04:29:39,037 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:29:39,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:29:39,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [14] total 84 [2019-09-10 04:29:39,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:29:39,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 04:29:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 04:29:39,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=4674, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 04:29:39,039 INFO L87 Difference]: Start difference. First operand 5527 states and 7322 transitions. Second operand 72 states. [2019-09-10 04:32:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:25,543 INFO L93 Difference]: Finished difference Result 10136 states and 14316 transitions. [2019-09-10 04:32:25,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 297 states. [2019-09-10 04:32:25,543 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 124 [2019-09-10 04:32:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:25,581 INFO L225 Difference]: With dead ends: 10136 [2019-09-10 04:32:25,581 INFO L226 Difference]: Without dead ends: 10124 [2019-09-10 04:32:25,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45218 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=8457, Invalid=108165, Unknown=0, NotChecked=0, Total=116622 [2019-09-10 04:32:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2019-09-10 04:32:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 8046. [2019-09-10 04:32:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8046 states. [2019-09-10 04:32:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8046 states to 8046 states and 10727 transitions. [2019-09-10 04:32:25,893 INFO L78 Accepts]: Start accepts. Automaton has 8046 states and 10727 transitions. Word has length 124 [2019-09-10 04:32:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:25,894 INFO L475 AbstractCegarLoop]: Abstraction has 8046 states and 10727 transitions. [2019-09-10 04:32:25,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 04:32:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 8046 states and 10727 transitions. [2019-09-10 04:32:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:32:25,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:25,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:32:25,900 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1799940107, now seen corresponding path program 1 times [2019-09-10 04:32:25,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:25,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:25,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:25,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:25,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:32:25,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:32:25,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:32:25,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2019-09-10 04:32:25,999 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [218], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [268], [271], [276], [279], [286], [288], [291], [295], [297], [298], [299], [300], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:32:26,007 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:32:26,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:32:26,019 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:32:26,474 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:32:26,475 INFO L272 AbstractInterpreter]: Visited 94 different actions 850 times. Merged at 16 different actions 181 times. Widened at 1 different actions 3 times. Performed 7851 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7851 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 7 different actions. Largest state had 94 variables. [2019-09-10 04:32:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:26,475 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:32:26,614 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 77.36% of their original sizes. [2019-09-10 04:32:26,614 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:32:30,053 INFO L420 sIntCurrentIteration]: We unified 123 AI predicates to 123 [2019-09-10 04:32:30,053 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:32:30,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:32:30,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [5] total 73 [2019-09-10 04:32:30,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:30,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 04:32:30,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 04:32:30,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 04:32:30,056 INFO L87 Difference]: Start difference. First operand 8046 states and 10727 transitions. Second operand 70 states. [2019-09-10 04:35:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:01,707 INFO L93 Difference]: Finished difference Result 15136 states and 21477 transitions. [2019-09-10 04:35:01,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 375 states. [2019-09-10 04:35:01,707 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 124 [2019-09-10 04:35:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:01,764 INFO L225 Difference]: With dead ends: 15136 [2019-09-10 04:35:01,764 INFO L226 Difference]: Without dead ends: 15136 [2019-09-10 04:35:01,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69862 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=10344, Invalid=160638, Unknown=0, NotChecked=0, Total=170982 [2019-09-10 04:35:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15136 states. [2019-09-10 04:35:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15136 to 12429. [2019-09-10 04:35:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12429 states. [2019-09-10 04:35:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12429 states to 12429 states and 16624 transitions. [2019-09-10 04:35:02,158 INFO L78 Accepts]: Start accepts. Automaton has 12429 states and 16624 transitions. Word has length 124 [2019-09-10 04:35:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:02,158 INFO L475 AbstractCegarLoop]: Abstraction has 12429 states and 16624 transitions. [2019-09-10 04:35:02,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 04:35:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12429 states and 16624 transitions. [2019-09-10 04:35:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:35:02,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:02,169 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, 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:35:02,169 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash 665707565, now seen corresponding path program 1 times [2019-09-10 04:35:02,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:02,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:02,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:35:02,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:35:02,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:35:02,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2019-09-10 04:35:02,269 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [205], [210], [213], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [288], [291], [295], [297], [298], [299], [300], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:35:02,271 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:35:02,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:35:02,282 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:35:02,696 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:35:02,696 INFO L272 AbstractInterpreter]: Visited 91 different actions 613 times. Merged at 14 different actions 120 times. Widened at 1 different actions 3 times. Performed 6024 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6024 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 6 different actions. Largest state had 94 variables. [2019-09-10 04:35:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:02,697 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:35:02,859 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 85.19% of their original sizes. [2019-09-10 04:35:02,860 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:35:10,263 INFO L420 sIntCurrentIteration]: We unified 123 AI predicates to 123 [2019-09-10 04:35:10,263 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:35:10,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:35:10,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [5] total 78 [2019-09-10 04:35:10,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:10,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 04:35:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 04:35:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=4910, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 04:35:10,266 INFO L87 Difference]: Start difference. First operand 12429 states and 16624 transitions. Second operand 75 states. [2019-09-10 04:36:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:05,447 INFO L93 Difference]: Finished difference Result 14853 states and 20530 transitions. [2019-09-10 04:36:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-10 04:36:05,448 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 124 [2019-09-10 04:36:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:05,489 INFO L225 Difference]: With dead ends: 14853 [2019-09-10 04:36:05,489 INFO L226 Difference]: Without dead ends: 14853 [2019-09-10 04:36:05,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6986 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1555, Invalid=17905, Unknown=0, NotChecked=0, Total=19460 [2019-09-10 04:36:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14853 states. [2019-09-10 04:36:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14853 to 13743. [2019-09-10 04:36:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13743 states. [2019-09-10 04:36:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13743 states to 13743 states and 18373 transitions. [2019-09-10 04:36:05,837 INFO L78 Accepts]: Start accepts. Automaton has 13743 states and 18373 transitions. Word has length 124 [2019-09-10 04:36:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:05,838 INFO L475 AbstractCegarLoop]: Abstraction has 13743 states and 18373 transitions. [2019-09-10 04:36:05,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-10 04:36:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13743 states and 18373 transitions. [2019-09-10 04:36:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:36:05,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:05,847 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, 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:36:05,848 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2105500958, now seen corresponding path program 1 times [2019-09-10 04:36:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:05,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:05,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:05,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:36:05,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:05,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:05,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:36:05,943 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [173], [175], [178], [182], [184], [189], [197], [198], [199], [202], [218], [220], [222], [225], [229], [231], [232], [255], [258], [262], [264], [265], [268], [284], [286], [288], [291], [295], [297], [298], [299], [300], [303], [319], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:36:05,947 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:05,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:05,962 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:06,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:36:06,561 INFO L272 AbstractInterpreter]: Visited 95 different actions 990 times. Merged at 22 different actions 246 times. Widened at 1 different actions 2 times. Performed 9007 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9007 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 52 fixpoints after 8 different actions. Largest state had 94 variables. [2019-09-10 04:36:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:06,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:36:06,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:06,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:36:06,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:06,588 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:36:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:06,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:36:06,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:36:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:36:06,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:36:06,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:06,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:06,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:36:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:36:07,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:36:07,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:36:07,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:36:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:36:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:36:07,114 INFO L87 Difference]: Start difference. First operand 13743 states and 18373 transitions. Second operand 13 states. [2019-09-10 04:36:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:08,330 INFO L93 Difference]: Finished difference Result 13965 states and 18678 transitions. [2019-09-10 04:36:08,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:36:08,330 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2019-09-10 04:36:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:08,370 INFO L225 Difference]: With dead ends: 13965 [2019-09-10 04:36:08,370 INFO L226 Difference]: Without dead ends: 13965 [2019-09-10 04:36:08,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:36:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13965 states. [2019-09-10 04:36:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13965 to 13743. [2019-09-10 04:36:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13743 states. [2019-09-10 04:36:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13743 states to 13743 states and 18123 transitions. [2019-09-10 04:36:08,658 INFO L78 Accepts]: Start accepts. Automaton has 13743 states and 18123 transitions. Word has length 125 [2019-09-10 04:36:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:08,659 INFO L475 AbstractCegarLoop]: Abstraction has 13743 states and 18123 transitions. [2019-09-10 04:36:08,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:36:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 13743 states and 18123 transitions. [2019-09-10 04:36:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:36:08,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:08,667 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, 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:36:08,667 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash -174264350, now seen corresponding path program 1 times [2019-09-10 04:36:08,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:08,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:08,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:36:08,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:08,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:08,759 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:36:08,759 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [173], [175], [178], [182], [184], [189], [197], [198], [199], [202], [218], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [288], [291], [295], [297], [298], [299], [300], [303], [319], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:36:08,760 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:08,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:08,771 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:09,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:36:09,302 INFO L272 AbstractInterpreter]: Visited 95 different actions 934 times. Merged at 21 different actions 238 times. Widened at 1 different actions 3 times. Performed 8530 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8530 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 56 fixpoints after 9 different actions. Largest state had 94 variables. [2019-09-10 04:36:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:09,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:36:09,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:09,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 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:36:09,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:09,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:36:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:09,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:36:09,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:36:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 04:36:09,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:36:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:36:09,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:36:09,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:36:09,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:09,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:36:09,601 INFO L87 Difference]: Start difference. First operand 13743 states and 18123 transitions. Second operand 5 states. [2019-09-10 04:36:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:09,949 INFO L93 Difference]: Finished difference Result 16896 states and 21706 transitions. [2019-09-10 04:36:09,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:36:09,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-10 04:36:09,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:09,999 INFO L225 Difference]: With dead ends: 16896 [2019-09-10 04:36:09,999 INFO L226 Difference]: Without dead ends: 16896 [2019-09-10 04:36:10,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 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:36:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16896 states. [2019-09-10 04:36:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16896 to 16150. [2019-09-10 04:36:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16150 states. [2019-09-10 04:36:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16150 states to 16150 states and 20741 transitions. [2019-09-10 04:36:10,346 INFO L78 Accepts]: Start accepts. Automaton has 16150 states and 20741 transitions. Word has length 125 [2019-09-10 04:36:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:10,347 INFO L475 AbstractCegarLoop]: Abstraction has 16150 states and 20741 transitions. [2019-09-10 04:36:10,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 16150 states and 20741 transitions. [2019-09-10 04:36:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:36:10,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:10,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:36:10,359 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2012736920, now seen corresponding path program 1 times [2019-09-10 04:36:10,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:10,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:10,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:36:10,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:10,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:10,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:36:10,840 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [173], [175], [178], [182], [184], [189], [197], [198], [199], [202], [218], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [268], [284], [286], [288], [291], [295], [297], [298], [299], [300], [303], [319], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:36:10,841 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:10,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:10,853 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:11,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:36:11,696 INFO L272 AbstractInterpreter]: Visited 98 different actions 1168 times. Merged at 24 different actions 310 times. Widened at 1 different actions 3 times. Performed 10241 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 78 fixpoints after 9 different actions. Largest state had 94 variables. [2019-09-10 04:36:11,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:11,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:36:11,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:11,696 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:36:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:11,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:36:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:11,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:36:11,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:36:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 04:36:11,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:36:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:36:12,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:36:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [19, 5] total 23 [2019-09-10 04:36:12,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:12,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-09-10 04:36:12,086 INFO L87 Difference]: Start difference. First operand 16150 states and 20741 transitions. Second operand 5 states. [2019-09-10 04:36:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:12,464 INFO L93 Difference]: Finished difference Result 24723 states and 31062 transitions. [2019-09-10 04:36:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:36:12,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-10 04:36:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:12,527 INFO L225 Difference]: With dead ends: 24723 [2019-09-10 04:36:12,527 INFO L226 Difference]: Without dead ends: 24723 [2019-09-10 04:36:12,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:36:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24723 states. [2019-09-10 04:36:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24723 to 24128. [2019-09-10 04:36:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24128 states. [2019-09-10 04:36:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24128 states to 24128 states and 30356 transitions. [2019-09-10 04:36:13,016 INFO L78 Accepts]: Start accepts. Automaton has 24128 states and 30356 transitions. Word has length 125 [2019-09-10 04:36:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:13,017 INFO L475 AbstractCegarLoop]: Abstraction has 24128 states and 30356 transitions. [2019-09-10 04:36:13,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 24128 states and 30356 transitions. [2019-09-10 04:36:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:36:13,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:13,024 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, 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:36:13,024 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:13,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:13,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1379257125, now seen corresponding path program 1 times [2019-09-10 04:36:13,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:13,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:13,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:13,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:36:13,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:13,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:13,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:36:13,380 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [192], [197], [198], [199], [202], [218], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [268], [284], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [311], [314], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:36:13,382 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:13,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:13,391 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:14,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:36:14,355 INFO L272 AbstractInterpreter]: Visited 98 different actions 1159 times. Merged at 21 different actions 291 times. Widened at 1 different actions 3 times. Performed 10160 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 68 fixpoints after 7 different actions. Largest state had 94 variables. [2019-09-10 04:36:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:14,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:36:14,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:14,356 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:36:14,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:14,382 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:36:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:14,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 04:36:14,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:36:14,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:36:15,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:36:16,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:36:16,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:36:16,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 44 [2019-09-10 04:36:16,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:36:16,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 04:36:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 04:36:16,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1742, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 04:36:16,180 INFO L87 Difference]: Start difference. First operand 24128 states and 30356 transitions. Second operand 31 states. [2019-09-10 04:36:16,523 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:36:28,032 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 04:36:30,531 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 04:36:31,804 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-10 04:36:35,129 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 04:36:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:43,538 INFO L93 Difference]: Finished difference Result 165024 states and 209454 transitions. [2019-09-10 04:36:43,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-09-10 04:36:43,538 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 126 [2019-09-10 04:36:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:43,959 INFO L225 Difference]: With dead ends: 165024 [2019-09-10 04:36:43,960 INFO L226 Difference]: Without dead ends: 164802 [2019-09-10 04:36:43,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18183 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=7181, Invalid=46411, Unknown=0, NotChecked=0, Total=53592 [2019-09-10 04:36:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164802 states. [2019-09-10 04:36:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164802 to 149580. [2019-09-10 04:36:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149580 states. [2019-09-10 04:36:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149580 states to 149580 states and 190424 transitions. [2019-09-10 04:36:47,024 INFO L78 Accepts]: Start accepts. Automaton has 149580 states and 190424 transitions. Word has length 126 [2019-09-10 04:36:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:47,024 INFO L475 AbstractCegarLoop]: Abstraction has 149580 states and 190424 transitions. [2019-09-10 04:36:47,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 04:36:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 149580 states and 190424 transitions. [2019-09-10 04:36:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:36:47,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:47,030 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, 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] [2019-09-10 04:36:47,030 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:47,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:47,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1598206587, now seen corresponding path program 1 times [2019-09-10 04:36:47,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:47,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:47,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:47,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:47,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:36:47,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:47,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:47,107 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:36:47,107 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [192], [197], [198], [199], [202], [205], [210], [213], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [288], [291], [295], [297], [298], [299], [300], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:36:47,109 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:47,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:47,118 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:47,646 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:36:47,647 INFO L272 AbstractInterpreter]: Visited 92 different actions 716 times. Merged at 17 different actions 167 times. Widened at 1 different actions 3 times. Performed 7726 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7726 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 26 fixpoints after 6 different actions. Largest state had 94 variables. [2019-09-10 04:36:47,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:47,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:36:47,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:47,647 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:36:49,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:49,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:36:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:49,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:36:49,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:36:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:36:50,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:36:50,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:36:50,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:36:50,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:36:50,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:36:50,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:36:50,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:36:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:36:50,252 INFO L87 Difference]: Start difference. First operand 149580 states and 190424 transitions. Second operand 13 states. [2019-09-10 04:36:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:51,307 INFO L93 Difference]: Finished difference Result 80740 states and 103558 transitions. [2019-09-10 04:36:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:36:51,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 126 [2019-09-10 04:36:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:51,510 INFO L225 Difference]: With dead ends: 80740 [2019-09-10 04:36:51,510 INFO L226 Difference]: Without dead ends: 80737 [2019-09-10 04:36:51,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:36:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80737 states. [2019-09-10 04:36:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80737 to 76127. [2019-09-10 04:36:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76127 states. [2019-09-10 04:36:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76127 states to 76127 states and 95578 transitions. [2019-09-10 04:36:52,896 INFO L78 Accepts]: Start accepts. Automaton has 76127 states and 95578 transitions. Word has length 126 [2019-09-10 04:36:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:52,897 INFO L475 AbstractCegarLoop]: Abstraction has 76127 states and 95578 transitions. [2019-09-10 04:36:52,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:36:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 76127 states and 95578 transitions. [2019-09-10 04:36:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:36:52,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:52,901 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, 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:36:52,902 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:52,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1078207681, now seen corresponding path program 1 times [2019-09-10 04:36:52,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:52,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:52,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:52,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:36:52,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:52,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:52,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:36:52,984 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [205], [210], [213], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [268], [271], [276], [279], [286], [288], [291], [295], [297], [298], [299], [300], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:36:52,985 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:52,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:52,994 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:53,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:36:53,646 INFO L272 AbstractInterpreter]: Visited 97 different actions 910 times. Merged at 19 different actions 213 times. Widened at 1 different actions 2 times. Performed 8661 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8661 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 40 fixpoints after 8 different actions. Largest state had 94 variables. [2019-09-10 04:36:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:53,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:36:53,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:53,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:36:53,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:53,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:36:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:53,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:36:53,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:36:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:36:53,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:36:53,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:53,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:53,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:36:54,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:36:54,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:36:54,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:36:54,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:36:54,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:36:54,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:36:54,054 INFO L87 Difference]: Start difference. First operand 76127 states and 95578 transitions. Second operand 13 states. [2019-09-10 04:36:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:54,903 INFO L93 Difference]: Finished difference Result 46472 states and 59385 transitions. [2019-09-10 04:36:54,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:36:54,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 126 [2019-09-10 04:36:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:55,034 INFO L225 Difference]: With dead ends: 46472 [2019-09-10 04:36:55,034 INFO L226 Difference]: Without dead ends: 46472 [2019-09-10 04:36:55,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:36:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46472 states. [2019-09-10 04:36:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46472 to 44531. [2019-09-10 04:36:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44531 states. [2019-09-10 04:36:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44531 states to 44531 states and 55390 transitions. [2019-09-10 04:36:56,788 INFO L78 Accepts]: Start accepts. Automaton has 44531 states and 55390 transitions. Word has length 126 [2019-09-10 04:36:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:56,788 INFO L475 AbstractCegarLoop]: Abstraction has 44531 states and 55390 transitions. [2019-09-10 04:36:56,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:36:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 44531 states and 55390 transitions. [2019-09-10 04:36:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:36:56,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:56,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:36:56,793 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash -837403913, now seen corresponding path program 1 times [2019-09-10 04:36:56,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:56,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:56,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:36:57,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:57,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:57,162 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:36:57,162 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [205], [210], [213], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [268], [271], [276], [279], [286], [288], [291], [295], [297], [298], [299], [300], [303], [319], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:36:57,164 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:57,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:57,172 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:57,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:36:57,950 INFO L272 AbstractInterpreter]: Visited 100 different actions 1553 times. Merged at 21 different actions 401 times. Widened at 1 different actions 6 times. Performed 14401 root evaluator evaluations with a maximum evaluation depth of 6. Performed 14401 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 92 fixpoints after 8 different actions. Largest state had 94 variables. [2019-09-10 04:36:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:57,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:36:57,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:57,951 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:36:57,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:57,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:36:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:58,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 04:36:58,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:36:58,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:36:58,768 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:36:59,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:36:59,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:36:59,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 52 [2019-09-10 04:36:59,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:36:59,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 04:36:59,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 04:36:59,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2466, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 04:36:59,976 INFO L87 Difference]: Start difference. First operand 44531 states and 55390 transitions. Second operand 37 states. [2019-09-10 04:37:03,019 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 04:37:03,446 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 04:37:04,047 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 04:37:04,209 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 04:37:04,533 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 04:37:04,691 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:37:11,446 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:37:12,826 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 04:37:14,849 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:37:15,436 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 04:37:15,854 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 04:37:17,161 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 04:37:19,987 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 04:37:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:37:22,672 INFO L93 Difference]: Finished difference Result 110717 states and 137610 transitions. [2019-09-10 04:37:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-10 04:37:22,673 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 126 [2019-09-10 04:37:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:37:22,896 INFO L225 Difference]: With dead ends: 110717 [2019-09-10 04:37:22,896 INFO L226 Difference]: Without dead ends: 110555 [2019-09-10 04:37:22,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 312 SyntacticMatches, 3 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13819 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=5835, Invalid=38055, Unknown=0, NotChecked=0, Total=43890 [2019-09-10 04:37:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110555 states. [2019-09-10 04:37:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110555 to 102541. [2019-09-10 04:37:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102541 states. [2019-09-10 04:37:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102541 states to 102541 states and 127958 transitions. [2019-09-10 04:37:24,518 INFO L78 Accepts]: Start accepts. Automaton has 102541 states and 127958 transitions. Word has length 126 [2019-09-10 04:37:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:37:24,519 INFO L475 AbstractCegarLoop]: Abstraction has 102541 states and 127958 transitions. [2019-09-10 04:37:24,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 04:37:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 102541 states and 127958 transitions. [2019-09-10 04:37:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:37:24,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:37:24,523 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, 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:37:24,523 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:37:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash -16756831, now seen corresponding path program 1 times [2019-09-10 04:37:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:37:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:24,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:24,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:37:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:37:24,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:24,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:37:24,593 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:37:24,593 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [268], [271], [276], [279], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [311], [314], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:37:24,595 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:37:24,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:37:24,604 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:37:24,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:37:24,978 INFO L272 AbstractInterpreter]: Visited 97 different actions 843 times. Merged at 19 different actions 201 times. Widened at 1 different actions 2 times. Performed 6627 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6627 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 41 fixpoints after 7 different actions. Largest state had 94 variables. [2019-09-10 04:37:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:24,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:37:24,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:24,979 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:37:25,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:25,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:37:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:25,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:37:25,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:37:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:37:25,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:37:25,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:25,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:37:25,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:37:25,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:37:25,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:37:25,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:37:25,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:37:25,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:37:25,840 INFO L87 Difference]: Start difference. First operand 102541 states and 127958 transitions. Second operand 13 states. [2019-09-10 04:37:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:37:26,632 INFO L93 Difference]: Finished difference Result 14608 states and 17560 transitions. [2019-09-10 04:37:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:37:26,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 126 [2019-09-10 04:37:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:37:26,657 INFO L225 Difference]: With dead ends: 14608 [2019-09-10 04:37:26,657 INFO L226 Difference]: Without dead ends: 14608 [2019-09-10 04:37:26,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:37:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14608 states. [2019-09-10 04:37:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14608 to 12708. [2019-09-10 04:37:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12708 states. [2019-09-10 04:37:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12708 states to 12708 states and 15106 transitions. [2019-09-10 04:37:26,835 INFO L78 Accepts]: Start accepts. Automaton has 12708 states and 15106 transitions. Word has length 126 [2019-09-10 04:37:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:37:26,835 INFO L475 AbstractCegarLoop]: Abstraction has 12708 states and 15106 transitions. [2019-09-10 04:37:26,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:37:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 12708 states and 15106 transitions. [2019-09-10 04:37:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:37:26,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:37:26,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:37:26,837 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:37:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash 357696498, now seen corresponding path program 1 times [2019-09-10 04:37:26,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:37:26,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:26,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:26,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:26,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:37:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 04:37:27,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:27,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:37:27,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:37:27,156 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [205], [208], [220], [222], [225], [229], [231], [232], [235], [251], [253], [255], [258], [262], [264], [265], [268], [271], [276], [279], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [311], [314], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:37:27,157 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:37:27,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:37:27,163 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:37:27,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:37:27,565 INFO L272 AbstractInterpreter]: Visited 101 different actions 931 times. Merged at 21 different actions 218 times. Widened at 1 different actions 1 times. Performed 8110 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 51 fixpoints after 8 different actions. Largest state had 94 variables. [2019-09-10 04:37:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:27,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:37:27,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:27,566 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:37:27,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:27,593 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:37:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:27,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 04:37:27,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:37:28,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:37:28,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:37:28,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:29,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:29,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:37:30,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:37:30,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 54 [2019-09-10 04:37:30,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:37:30,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 04:37:30,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 04:37:30,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2674, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:37:30,017 INFO L87 Difference]: Start difference. First operand 12708 states and 15106 transitions. Second operand 38 states. [2019-09-10 04:37:32,219 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 04:37:32,838 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:37:33,001 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 04:37:33,489 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 04:37:33,861 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 04:37:34,042 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 04:37:34,523 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:37:34,920 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:37:35,546 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 04:37:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:37:46,431 INFO L93 Difference]: Finished difference Result 31145 states and 37211 transitions. [2019-09-10 04:37:46,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-10 04:37:46,431 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 127 [2019-09-10 04:37:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:37:46,483 INFO L225 Difference]: With dead ends: 31145 [2019-09-10 04:37:46,484 INFO L226 Difference]: Without dead ends: 31088 [2019-09-10 04:37:46,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 249 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7342 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=3423, Invalid=23309, Unknown=0, NotChecked=0, Total=26732 [2019-09-10 04:37:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31088 states. [2019-09-10 04:37:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31088 to 29288. [2019-09-10 04:37:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2019-09-10 04:37:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 35331 transitions. [2019-09-10 04:37:46,929 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 35331 transitions. Word has length 127 [2019-09-10 04:37:46,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:37:46,930 INFO L475 AbstractCegarLoop]: Abstraction has 29288 states and 35331 transitions. [2019-09-10 04:37:46,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 04:37:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 35331 transitions. [2019-09-10 04:37:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:37:46,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:37:46,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:37:46,932 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:37:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:46,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1512101067, now seen corresponding path program 1 times [2019-09-10 04:37:46,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:37:46,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:46,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:46,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:46,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:37:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:37:48,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:48,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:37:48,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:37:48,737 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [205], [208], [220], [222], [225], [229], [231], [232], [235], [238], [243], [246], [253], [255], [258], [262], [264], [265], [268], [271], [274], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [311], [314], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:37:48,738 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:37:48,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:37:48,746 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:37:49,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:37:49,270 INFO L272 AbstractInterpreter]: Visited 102 different actions 1097 times. Merged at 21 different actions 256 times. Widened at 1 different actions 3 times. Performed 9735 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9735 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 60 fixpoints after 7 different actions. Largest state had 94 variables. [2019-09-10 04:37:49,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:49,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:37:49,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:49,271 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:37:49,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:49,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:37:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:49,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 04:37:49,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:37:50,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:50,560 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-10 04:37:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:37:52,104 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:37:52,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:37:52,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:52,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:53,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:53,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 04:37:55,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:37:55,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 27, 27] total 86 [2019-09-10 04:37:55,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:37:55,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 04:37:55,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 04:37:55,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=6886, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 04:37:55,167 INFO L87 Difference]: Start difference. First operand 29288 states and 35331 transitions. Second operand 63 states. [2019-09-10 04:37:57,808 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-09-10 04:37:59,007 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2019-09-10 04:37:59,252 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 40 [2019-09-10 04:37:59,489 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 26 [2019-09-10 04:37:59,741 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2019-09-10 04:38:00,260 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2019-09-10 04:38:00,574 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 45 [2019-09-10 04:38:00,950 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 62 [2019-09-10 04:38:01,509 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2019-09-10 04:38:02,458 WARN L188 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 79 [2019-09-10 04:38:02,897 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 75 [2019-09-10 04:38:03,279 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 59 [2019-09-10 04:38:03,549 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-09-10 04:38:03,865 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-10 04:38:04,639 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-09-10 04:38:05,515 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 04:38:07,486 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 04:38:15,539 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 04:38:16,135 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 04:38:16,535 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 04:38:22,352 WARN L188 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 04:38:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:24,363 INFO L93 Difference]: Finished difference Result 33580 states and 40045 transitions. [2019-09-10 04:38:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-10 04:38:24,363 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 128 [2019-09-10 04:38:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:24,417 INFO L225 Difference]: With dead ends: 33580 [2019-09-10 04:38:24,417 INFO L226 Difference]: Without dead ends: 33274 [2019-09-10 04:38:24,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 229 SyntacticMatches, 10 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11076 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=4574, Invalid=37246, Unknown=0, NotChecked=0, Total=41820 [2019-09-10 04:38:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33274 states. [2019-09-10 04:38:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33274 to 30687. [2019-09-10 04:38:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30687 states. [2019-09-10 04:38:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30687 states to 30687 states and 36984 transitions. [2019-09-10 04:38:24,900 INFO L78 Accepts]: Start accepts. Automaton has 30687 states and 36984 transitions. Word has length 128 [2019-09-10 04:38:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:24,900 INFO L475 AbstractCegarLoop]: Abstraction has 30687 states and 36984 transitions. [2019-09-10 04:38:24,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 04:38:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 30687 states and 36984 transitions. [2019-09-10 04:38:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 04:38:24,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:24,902 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, 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:38:24,902 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1597345389, now seen corresponding path program 1 times [2019-09-10 04:38:24,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:24,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:24,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 04:38:26,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:38:26,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:38:26,258 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 04:38:26,258 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [192], [197], [198], [199], [202], [205], [208], [220], [222], [225], [229], [231], [232], [235], [238], [241], [253], [255], [258], [262], [264], [265], [268], [271], [274], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [311], [314], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:38:26,259 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:38:26,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:38:26,266 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:38:26,700 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:38:26,700 INFO L272 AbstractInterpreter]: Visited 101 different actions 1068 times. Merged at 21 different actions 260 times. Widened at 1 different actions 3 times. Performed 9687 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9687 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 60 fixpoints after 6 different actions. Largest state had 94 variables. [2019-09-10 04:38:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:26,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:38:26,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:38:26,701 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:38:26,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:26,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:38:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:26,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 04:38:26,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:38:27,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:38:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:38:29,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:38:29,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:38:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:38:31,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:38:31,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 16, 16] total 72 [2019-09-10 04:38:31,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:38:31,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-10 04:38:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-10 04:38:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4883, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 04:38:31,076 INFO L87 Difference]: Start difference. First operand 30687 states and 36984 transitions. Second operand 59 states. [2019-09-10 04:38:31,510 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 04:38:32,041 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2019-09-10 04:38:33,584 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 04:38:33,903 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 04:38:34,631 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 04:38:34,885 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-10 04:38:35,126 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 04:38:35,391 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 04:38:35,714 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 04:38:36,076 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 72 [2019-09-10 04:38:36,443 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 04:38:36,872 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-10 04:38:37,392 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2019-09-10 04:38:37,880 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-09-10 04:38:38,344 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 04:38:38,846 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-09-10 04:38:39,412 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-09-10 04:38:39,923 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 101 [2019-09-10 04:38:40,419 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-09-10 04:38:40,729 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 04:38:41,075 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 04:38:41,912 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-10 04:38:42,149 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 04:38:42,424 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 04:38:42,920 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-09-10 04:38:43,282 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 04:38:43,489 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 04:38:44,350 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 04:38:51,764 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 04:38:52,139 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 04:38:52,588 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:38:53,026 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 04:38:53,501 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:38:53,925 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 04:38:54,216 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:38:54,498 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 04:38:55,293 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:38:55,730 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 04:38:56,039 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:38:56,375 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 04:38:56,940 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 04:38:58,443 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 04:38:58,906 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 04:38:59,349 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 04:38:59,900 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-10 04:39:00,921 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 04:39:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:07,047 INFO L93 Difference]: Finished difference Result 34580 states and 40747 transitions. [2019-09-10 04:39:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-10 04:39:07,047 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 129 [2019-09-10 04:39:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:07,107 INFO L225 Difference]: With dead ends: 34580 [2019-09-10 04:39:07,107 INFO L226 Difference]: Without dead ends: 34274 [2019-09-10 04:39:07,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 219 SyntacticMatches, 20 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14555 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=5081, Invalid=46675, Unknown=0, NotChecked=0, Total=51756 [2019-09-10 04:39:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34274 states. [2019-09-10 04:39:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34274 to 31031. [2019-09-10 04:39:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31031 states. [2019-09-10 04:39:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31031 states to 31031 states and 37054 transitions. [2019-09-10 04:39:07,596 INFO L78 Accepts]: Start accepts. Automaton has 31031 states and 37054 transitions. Word has length 129 [2019-09-10 04:39:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:07,596 INFO L475 AbstractCegarLoop]: Abstraction has 31031 states and 37054 transitions. [2019-09-10 04:39:07,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-10 04:39:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 31031 states and 37054 transitions. [2019-09-10 04:39:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 04:39:07,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:07,599 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:39:07,599 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:07,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2067358211, now seen corresponding path program 1 times [2019-09-10 04:39:07,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:07,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:07,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:07,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:07,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-10 04:39:07,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:07,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:07,688 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2019-09-10 04:39:07,689 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [173], [175], [178], [182], [184], [189], [197], [198], [199], [202], [205], [208], [220], [222], [225], [229], [231], [232], [235], [238], [241], [253], [255], [258], [262], [264], [265], [268], [271], [274], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [309], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:39:07,690 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:07,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:07,700 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:08,285 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:08,285 INFO L272 AbstractInterpreter]: Visited 102 different actions 1252 times. Merged at 24 different actions 310 times. Widened at 1 different actions 4 times. Performed 10941 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10941 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 75 fixpoints after 8 different actions. Largest state had 94 variables. [2019-09-10 04:39:08,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:08,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:08,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:08,285 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:39:08,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:08,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:08,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 04:39:08,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:39:08,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-10 04:39:08,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:39:08,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 7 [2019-09-10 04:39:08,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:08,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:39:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:39:08,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:39:08,544 INFO L87 Difference]: Start difference. First operand 31031 states and 37054 transitions. Second operand 4 states. [2019-09-10 04:39:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:08,765 INFO L93 Difference]: Finished difference Result 36385 states and 42866 transitions. [2019-09-10 04:39:08,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:39:08,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-10 04:39:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:08,825 INFO L225 Difference]: With dead ends: 36385 [2019-09-10 04:39:08,826 INFO L226 Difference]: Without dead ends: 36385 [2019-09-10 04:39:08,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 346 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:39:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36385 states. [2019-09-10 04:39:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36385 to 33047. [2019-09-10 04:39:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33047 states. [2019-09-10 04:39:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33047 states to 33047 states and 38800 transitions. [2019-09-10 04:39:09,326 INFO L78 Accepts]: Start accepts. Automaton has 33047 states and 38800 transitions. Word has length 175 [2019-09-10 04:39:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:09,327 INFO L475 AbstractCegarLoop]: Abstraction has 33047 states and 38800 transitions. [2019-09-10 04:39:09,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:39:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33047 states and 38800 transitions. [2019-09-10 04:39:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 04:39:09,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:09,333 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, 4, 4, 4, 4, 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, 1, 1, 1] [2019-09-10 04:39:09,333 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:09,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:09,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2003241732, now seen corresponding path program 1 times [2019-09-10 04:39:09,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:09,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:09,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:09,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:09,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 42 proven. 87 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-10 04:39:09,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:09,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:09,828 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2019-09-10 04:39:09,828 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [173], [175], [178], [182], [184], [189], [197], [198], [199], [202], [205], [208], [218], [220], [222], [225], [229], [231], [232], [235], [238], [241], [251], [253], [255], [258], [262], [264], [265], [268], [271], [274], [284], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [309], [319], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:39:09,831 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:09,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:09,838 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:11,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:11,346 INFO L272 AbstractInterpreter]: Visited 106 different actions 2928 times. Merged at 30 different actions 976 times. Widened at 1 different actions 9 times. Performed 21909 root evaluator evaluations with a maximum evaluation depth of 6. Performed 21909 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 272 fixpoints after 10 different actions. Largest state had 94 variables. [2019-09-10 04:39:11,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:11,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:11,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:11,346 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:39:11,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:11,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:11,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 04:39:11,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:11,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:12,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 48 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:39:12,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:13,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:13,711 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-10 04:39:14,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:14,154 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-09-10 04:39:14,294 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:14,416 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:14,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:14,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:14,712 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:14,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:14,939 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,042 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,133 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,220 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,423 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,686 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,776 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:15,874 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 42 proven. 65 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-10 04:39:16,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:16,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 20] total 55 [2019-09-10 04:39:16,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:16,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 04:39:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 04:39:16,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2734, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:39:16,027 INFO L87 Difference]: Start difference. First operand 33047 states and 38800 transitions. Second operand 40 states. [2019-09-10 04:39:16,494 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:39:16,674 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 04:39:16,864 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:39:17,698 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 04:39:17,969 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:39:18,265 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 04:39:18,530 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 04:39:18,960 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:39:19,332 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 04:39:19,627 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 04:39:19,827 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:39:21,096 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:39:21,320 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:39:21,859 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 04:39:22,361 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:39:22,755 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 04:39:23,044 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:39:24,071 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 04:39:24,539 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 04:39:24,870 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 04:39:25,042 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 04:39:25,383 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 04:39:25,665 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 04:39:26,021 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 04:39:26,321 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 04:39:26,492 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 04:39:26,662 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 04:39:27,038 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 04:39:27,336 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 04:39:27,793 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 04:39:28,034 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 04:39:28,337 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:39:28,773 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:39:29,166 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 04:39:30,495 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 04:39:30,816 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:39:31,258 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:39:32,005 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:39:32,272 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:39:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:32,871 INFO L93 Difference]: Finished difference Result 41252 states and 48378 transitions. [2019-09-10 04:39:32,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 04:39:32,872 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 221 [2019-09-10 04:39:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:32,951 INFO L225 Difference]: With dead ends: 41252 [2019-09-10 04:39:32,951 INFO L226 Difference]: Without dead ends: 41252 [2019-09-10 04:39:32,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 402 SyntacticMatches, 27 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1759, Invalid=8341, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 04:39:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41252 states. [2019-09-10 04:39:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41252 to 40104. [2019-09-10 04:39:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40104 states. [2019-09-10 04:39:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40104 states to 40104 states and 47172 transitions. [2019-09-10 04:39:33,531 INFO L78 Accepts]: Start accepts. Automaton has 40104 states and 47172 transitions. Word has length 221 [2019-09-10 04:39:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:33,531 INFO L475 AbstractCegarLoop]: Abstraction has 40104 states and 47172 transitions. [2019-09-10 04:39:33,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 04:39:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 40104 states and 47172 transitions. [2019-09-10 04:39:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 04:39:33,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:33,540 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:39:33,541 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:33,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2080142530, now seen corresponding path program 1 times [2019-09-10 04:39:33,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:33,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:33,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:33,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:33,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 64 proven. 9 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-10 04:39:33,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:33,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:33,641 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2019-09-10 04:39:33,642 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [173], [175], [178], [182], [184], [189], [197], [198], [199], [202], [205], [208], [218], [220], [222], [225], [229], [231], [232], [235], [238], [241], [251], [253], [255], [258], [262], [264], [265], [268], [271], [274], [284], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [309], [319], [321], [323], [326], [328], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:39:33,643 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:33,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:33,651 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:35,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:35,389 INFO L272 AbstractInterpreter]: Visited 107 different actions 3006 times. Merged at 30 different actions 993 times. Widened at 1 different actions 10 times. Performed 21379 root evaluator evaluations with a maximum evaluation depth of 6. Performed 21379 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 278 fixpoints after 10 different actions. Largest state had 94 variables. [2019-09-10 04:39:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:35,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:35,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:35,389 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:39:35,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:35,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:35,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 04:39:35,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 140 proven. 60 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 04:39:35,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:35,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 50 proven. 23 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-10 04:39:35,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:35,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 22 [2019-09-10 04:39:35,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:35,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 04:39:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 04:39:35,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-09-10 04:39:35,984 INFO L87 Difference]: Start difference. First operand 40104 states and 47172 transitions. Second operand 14 states. [2019-09-10 04:39:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:37,171 INFO L93 Difference]: Finished difference Result 23603 states and 27128 transitions. [2019-09-10 04:39:37,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 04:39:37,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 221 [2019-09-10 04:39:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:37,207 INFO L225 Difference]: With dead ends: 23603 [2019-09-10 04:39:37,207 INFO L226 Difference]: Without dead ends: 23357 [2019-09-10 04:39:37,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 433 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 04:39:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23357 states. [2019-09-10 04:39:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23357 to 22309. [2019-09-10 04:39:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22309 states. [2019-09-10 04:39:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22309 states to 22309 states and 25720 transitions. [2019-09-10 04:39:37,514 INFO L78 Accepts]: Start accepts. Automaton has 22309 states and 25720 transitions. Word has length 221 [2019-09-10 04:39:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:37,515 INFO L475 AbstractCegarLoop]: Abstraction has 22309 states and 25720 transitions. [2019-09-10 04:39:37,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 04:39:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22309 states and 25720 transitions. [2019-09-10 04:39:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-10 04:39:37,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:37,520 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:39:37,520 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1790343307, now seen corresponding path program 1 times [2019-09-10 04:39:37,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:37,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:37,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:37,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:37,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 38 proven. 81 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-10 04:39:38,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:38,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:38,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2019-09-10 04:39:38,090 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [139], [140], [141], [143], [152], [157], [159], [161], [167], [170], [175], [178], [182], [195], [197], [198], [199], [202], [205], [208], [218], [220], [222], [225], [229], [231], [232], [235], [238], [241], [243], [246], [253], [255], [258], [262], [264], [265], [268], [271], [274], [284], [286], [288], [291], [295], [297], [298], [299], [300], [303], [306], [309], [311], [314], [321], [323], [326], [330], [332], [333], [336], [338], [341], [343], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363] [2019-09-10 04:39:38,092 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:38,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:38,102 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:39,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:39,657 INFO L272 AbstractInterpreter]: Visited 106 different actions 3302 times. Merged at 26 different actions 1020 times. Widened at 1 different actions 10 times. Performed 26896 root evaluator evaluations with a maximum evaluation depth of 6. Performed 26896 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 292 fixpoints after 10 different actions. Largest state had 94 variables. [2019-09-10 04:39:39,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:39,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:39,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:39,658 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:39:39,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:39,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:39,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 04:39:39,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:40,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:40,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 75 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:39:40,997 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:41,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:41,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 04:39:42,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,188 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-09-10 04:39:42,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:42,669 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-09-10 04:39:44,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 48 proven. 59 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 04:39:44,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:44,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 20] total 55 [2019-09-10 04:39:44,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:44,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 04:39:44,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 04:39:44,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2732, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:39:44,809 INFO L87 Difference]: Start difference. First operand 22309 states and 25720 transitions. Second operand 40 states.