java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:19:32,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:19:32,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:19:32,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:19:32,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:19:32,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:19:32,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:19:32,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:19:32,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:19:32,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:19:32,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:19:32,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:19:32,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:19:32,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:19:32,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:19:32,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:19:32,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:19:32,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:19:32,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:19:32,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:19:32,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:19:32,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:19:32,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:19:32,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:19:32,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:19:32,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:19:32,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:19:32,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:19:32,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:19:32,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:19:32,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:19:32,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:19:32,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:19:32,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:19:32,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:19:32,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:19:32,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:19:32,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:19:32,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:19:32,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:19:32,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:19:32,772 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:19:32,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:19:32,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:19:32,792 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:19:32,792 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:19:32,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:19:32,793 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:19:32,793 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:19:32,794 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:19:32,794 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:19:32,794 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:19:32,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:19:32,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:19:32,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:19:32,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:19:32,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:19:32,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:19:32,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:19:32,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:19:32,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:19:32,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:19:32,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:19:32,799 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:19:32,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:19:32,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:19:32,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:19:32,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:19:32,800 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:19:32,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:19:32,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:19:32,801 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:19:32,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:19:32,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:19:32,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:19:32,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:19:32,864 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:19:32,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2019-09-10 04:19:32,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a946a22c/440be76d57734074a0c51f8890157cea/FLAGb154426ba [2019-09-10 04:19:33,479 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:19:33,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2019-09-10 04:19:33,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a946a22c/440be76d57734074a0c51f8890157cea/FLAGb154426ba [2019-09-10 04:19:33,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a946a22c/440be76d57734074a0c51f8890157cea [2019-09-10 04:19:33,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:19:33,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:19:33,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:19:33,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:19:33,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:19:33,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:19:33" (1/1) ... [2019-09-10 04:19:33,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3bbca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:33, skipping insertion in model container [2019-09-10 04:19:33,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:19:33" (1/1) ... [2019-09-10 04:19:33,861 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:19:33,916 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:19:34,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:19:34,258 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:19:34,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:19:34,338 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:19:34,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34 WrapperNode [2019-09-10 04:19:34,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:19:34,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:19:34,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:19:34,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:19:34,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (1/1) ... [2019-09-10 04:19:34,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (1/1) ... [2019-09-10 04:19:34,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (1/1) ... [2019-09-10 04:19:34,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (1/1) ... [2019-09-10 04:19:34,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (1/1) ... [2019-09-10 04:19:34,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (1/1) ... [2019-09-10 04:19:34,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (1/1) ... [2019-09-10 04:19:34,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:19:34,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:19:34,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:19:34,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:19:34,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (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:19:34,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:19:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:19:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:19:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:19:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:19:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:19:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:19:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:19:34,493 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:19:34,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:19:34,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:19:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:19:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:19:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:19:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:19:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:19:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:19:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:19:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:19:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:19:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:19:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:19:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:19:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:19:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:19:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:19:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:19:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:19:35,235 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:19:35,235 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:19:35,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:19:35 BoogieIcfgContainer [2019-09-10 04:19:35,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:19:35,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:19:35,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:19:35,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:19:35,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:19:33" (1/3) ... [2019-09-10 04:19:35,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d49d341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:19:35, skipping insertion in model container [2019-09-10 04:19:35,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:19:34" (2/3) ... [2019-09-10 04:19:35,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d49d341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:19:35, skipping insertion in model container [2019-09-10 04:19:35,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:19:35" (3/3) ... [2019-09-10 04:19:35,251 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2019-09-10 04:19:35,262 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:19:35,272 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:19:35,289 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:19:35,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:19:35,329 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:19:35,329 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:19:35,329 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:19:35,330 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:19:35,330 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:19:35,330 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:19:35,330 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:19:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-09-10 04:19:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 04:19:35,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:35,367 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] [2019-09-10 04:19:35,369 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1562469407, now seen corresponding path program 1 times [2019-09-10 04:19:35,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:35,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:35,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:35,838 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:19:35,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:35,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:19:35,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:35,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:19:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:19:35,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:19:35,874 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 5 states. [2019-09-10 04:19:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:36,073 INFO L93 Difference]: Finished difference Result 154 states and 231 transitions. [2019-09-10 04:19:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:19:36,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 04:19:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:36,089 INFO L225 Difference]: With dead ends: 154 [2019-09-10 04:19:36,089 INFO L226 Difference]: Without dead ends: 145 [2019-09-10 04:19:36,091 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:19:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-10 04:19:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-10 04:19:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-10 04:19:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 191 transitions. [2019-09-10 04:19:36,148 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 191 transitions. Word has length 61 [2019-09-10 04:19:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:36,148 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 191 transitions. [2019-09-10 04:19:36,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:19:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2019-09-10 04:19:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 04:19:36,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:36,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:36,153 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1599260074, now seen corresponding path program 1 times [2019-09-10 04:19:36,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:36,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:36,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:36,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:36,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:36,470 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:19:36,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:36,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:19:36,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:36,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:19:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:19:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:19:36,476 INFO L87 Difference]: Start difference. First operand 145 states and 191 transitions. Second operand 13 states. [2019-09-10 04:19:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:42,011 INFO L93 Difference]: Finished difference Result 1193 states and 1726 transitions. [2019-09-10 04:19:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 04:19:42,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2019-09-10 04:19:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:42,030 INFO L225 Difference]: With dead ends: 1193 [2019-09-10 04:19:42,031 INFO L226 Difference]: Without dead ends: 1193 [2019-09-10 04:19:42,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 04:19:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-09-10 04:19:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1173. [2019-09-10 04:19:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-09-10 04:19:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1716 transitions. [2019-09-10 04:19:42,153 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1716 transitions. Word has length 92 [2019-09-10 04:19:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:42,154 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1716 transitions. [2019-09-10 04:19:42,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:19:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1716 transitions. [2019-09-10 04:19:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:19:42,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:42,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:42,161 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash 912193131, now seen corresponding path program 1 times [2019-09-10 04:19:42,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:42,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:42,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:42,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:42,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:19:42,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:42,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:19:42,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:42,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:19:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:19:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:19:42,381 INFO L87 Difference]: Start difference. First operand 1173 states and 1716 transitions. Second operand 11 states. [2019-09-10 04:19:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:42,520 INFO L93 Difference]: Finished difference Result 1298 states and 1918 transitions. [2019-09-10 04:19:42,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:19:42,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2019-09-10 04:19:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:42,531 INFO L225 Difference]: With dead ends: 1298 [2019-09-10 04:19:42,531 INFO L226 Difference]: Without dead ends: 1298 [2019-09-10 04:19:42,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:19:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-09-10 04:19:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1227. [2019-09-10 04:19:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-09-10 04:19:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1770 transitions. [2019-09-10 04:19:42,607 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1770 transitions. Word has length 93 [2019-09-10 04:19:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:42,608 INFO L475 AbstractCegarLoop]: Abstraction has 1227 states and 1770 transitions. [2019-09-10 04:19:42,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:19:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1770 transitions. [2019-09-10 04:19:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:19:42,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:42,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:42,613 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1257150770, now seen corresponding path program 1 times [2019-09-10 04:19:42,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:42,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:42,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:42,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:42,783 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:19:42,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:42,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:19:42,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:42,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:19:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:19:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:19:42,785 INFO L87 Difference]: Start difference. First operand 1227 states and 1770 transitions. Second operand 7 states. [2019-09-10 04:19:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:43,634 INFO L93 Difference]: Finished difference Result 4298 states and 6273 transitions. [2019-09-10 04:19:43,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:19:43,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-09-10 04:19:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:43,657 INFO L225 Difference]: With dead ends: 4298 [2019-09-10 04:19:43,657 INFO L226 Difference]: Without dead ends: 4298 [2019-09-10 04:19:43,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:19:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-09-10 04:19:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4292. [2019-09-10 04:19:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-09-10 04:19:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6270 transitions. [2019-09-10 04:19:43,809 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6270 transitions. Word has length 94 [2019-09-10 04:19:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:43,809 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6270 transitions. [2019-09-10 04:19:43,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:19:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6270 transitions. [2019-09-10 04:19:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:19:43,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:43,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:43,814 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash -559353761, now seen corresponding path program 1 times [2019-09-10 04:19:43,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:43,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:43,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:43,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:43,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:43,937 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:19:43,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:43,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:19:43,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:43,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:19:43,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:19:43,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:19:43,939 INFO L87 Difference]: Start difference. First operand 4292 states and 6270 transitions. Second operand 9 states. [2019-09-10 04:19:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:44,732 INFO L93 Difference]: Finished difference Result 6169 states and 9115 transitions. [2019-09-10 04:19:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:19:44,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:19:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:44,762 INFO L225 Difference]: With dead ends: 6169 [2019-09-10 04:19:44,762 INFO L226 Difference]: Without dead ends: 6169 [2019-09-10 04:19:44,763 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:19:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-09-10 04:19:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 4487. [2019-09-10 04:19:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-09-10 04:19:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 6559 transitions. [2019-09-10 04:19:44,965 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 6559 transitions. Word has length 95 [2019-09-10 04:19:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:44,966 INFO L475 AbstractCegarLoop]: Abstraction has 4487 states and 6559 transitions. [2019-09-10 04:19:44,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:19:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 6559 transitions. [2019-09-10 04:19:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:19:44,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:44,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:44,969 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2126618187, now seen corresponding path program 1 times [2019-09-10 04:19:44,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:44,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:44,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:44,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:44,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:45,081 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:19:45,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:45,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:19:45,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:45,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:19:45,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:19:45,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:19:45,084 INFO L87 Difference]: Start difference. First operand 4487 states and 6559 transitions. Second operand 9 states. [2019-09-10 04:19:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:45,924 INFO L93 Difference]: Finished difference Result 6995 states and 10260 transitions. [2019-09-10 04:19:45,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:19:45,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:19:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:45,973 INFO L225 Difference]: With dead ends: 6995 [2019-09-10 04:19:45,973 INFO L226 Difference]: Without dead ends: 6983 [2019-09-10 04:19:45,974 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:19:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6983 states. [2019-09-10 04:19:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6983 to 4452. [2019-09-10 04:19:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4452 states. [2019-09-10 04:19:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 6502 transitions. [2019-09-10 04:19:46,265 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 6502 transitions. Word has length 95 [2019-09-10 04:19:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:46,268 INFO L475 AbstractCegarLoop]: Abstraction has 4452 states and 6502 transitions. [2019-09-10 04:19:46,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:19:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 6502 transitions. [2019-09-10 04:19:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:19:46,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:46,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:46,275 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:46,275 INFO L82 PathProgramCache]: Analyzing trace with hash -528895007, now seen corresponding path program 1 times [2019-09-10 04:19:46,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:46,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:46,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:46,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:46,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:46,412 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:19:46,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:46,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:19:46,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:46,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:19:46,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:19:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:19:46,414 INFO L87 Difference]: Start difference. First operand 4452 states and 6502 transitions. Second operand 9 states. [2019-09-10 04:19:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:47,168 INFO L93 Difference]: Finished difference Result 6230 states and 9073 transitions. [2019-09-10 04:19:47,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:19:47,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:19:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:47,210 INFO L225 Difference]: With dead ends: 6230 [2019-09-10 04:19:47,211 INFO L226 Difference]: Without dead ends: 6218 [2019-09-10 04:19:47,211 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:19:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6218 states. [2019-09-10 04:19:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6218 to 4432. [2019-09-10 04:19:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4432 states. [2019-09-10 04:19:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 6469 transitions. [2019-09-10 04:19:47,348 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 6469 transitions. Word has length 95 [2019-09-10 04:19:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:47,349 INFO L475 AbstractCegarLoop]: Abstraction has 4432 states and 6469 transitions. [2019-09-10 04:19:47,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:19:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 6469 transitions. [2019-09-10 04:19:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:19:47,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:47,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:47,352 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash -985246047, now seen corresponding path program 1 times [2019-09-10 04:19:47,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:47,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:47,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:47,486 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:19:47,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:47,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:19:47,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:47,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:19:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:19:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:19:47,488 INFO L87 Difference]: Start difference. First operand 4432 states and 6469 transitions. Second operand 9 states. [2019-09-10 04:19:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:48,383 INFO L93 Difference]: Finished difference Result 5468 states and 7902 transitions. [2019-09-10 04:19:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:19:48,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:19:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:48,408 INFO L225 Difference]: With dead ends: 5468 [2019-09-10 04:19:48,408 INFO L226 Difference]: Without dead ends: 5456 [2019-09-10 04:19:48,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:19:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2019-09-10 04:19:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 4429. [2019-09-10 04:19:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4429 states. [2019-09-10 04:19:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4429 states to 4429 states and 6462 transitions. [2019-09-10 04:19:48,553 INFO L78 Accepts]: Start accepts. Automaton has 4429 states and 6462 transitions. Word has length 95 [2019-09-10 04:19:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:48,554 INFO L475 AbstractCegarLoop]: Abstraction has 4429 states and 6462 transitions. [2019-09-10 04:19:48,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:19:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4429 states and 6462 transitions. [2019-09-10 04:19:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:19:48,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:48,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:48,556 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1498657653, now seen corresponding path program 1 times [2019-09-10 04:19:48,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:48,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:48,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:48,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:48,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:48,754 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:19:48,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:19:48,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:19:48,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:48,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:19:48,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:19:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:19:48,756 INFO L87 Difference]: Start difference. First operand 4429 states and 6462 transitions. Second operand 9 states. [2019-09-10 04:19:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:49,568 INFO L93 Difference]: Finished difference Result 4711 states and 6749 transitions. [2019-09-10 04:19:49,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:19:49,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:19:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:49,681 INFO L225 Difference]: With dead ends: 4711 [2019-09-10 04:19:49,681 INFO L226 Difference]: Without dead ends: 4699 [2019-09-10 04:19:49,682 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:19:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2019-09-10 04:19:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4443. [2019-09-10 04:19:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4443 states. [2019-09-10 04:19:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 6481 transitions. [2019-09-10 04:19:49,790 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 6481 transitions. Word has length 95 [2019-09-10 04:19:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:49,790 INFO L475 AbstractCegarLoop]: Abstraction has 4443 states and 6481 transitions. [2019-09-10 04:19:49,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:19:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 6481 transitions. [2019-09-10 04:19:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:19:49,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:49,796 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, 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] [2019-09-10 04:19:49,796 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1664544683, now seen corresponding path program 1 times [2019-09-10 04:19:49,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:49,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:49,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 04:19:49,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:19:49,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:19:49,963 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 04:19:49,967 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [230], [235], [240], [241], [242], [245], [267], [269], [287], [288], [291], [313], [315], [345], [346], [349], [371], [373], [403], [404], [407], [429], [431], [461], [462], [463], [464], [467], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:19:50,049 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:19:50,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:19:50,217 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:19:51,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:19:51,085 INFO L272 AbstractInterpreter]: Visited 99 different actions 480 times. Merged at 14 different actions 96 times. Widened at 1 different actions 2 times. Performed 5705 root evaluator evaluations with a maximum evaluation depth of 7. Performed 5705 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 7 fixpoints after 2 different actions. Largest state had 129 variables. [2019-09-10 04:19:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:51,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:19:51,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:19:51,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:19:51,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:51,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:19:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:51,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:19:51,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:19:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 04:19:51,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:19:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:19:51,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:19:51,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:19:51,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:51,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:19:51,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:19:51,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:19:51,571 INFO L87 Difference]: Start difference. First operand 4443 states and 6481 transitions. Second operand 5 states. [2019-09-10 04:19:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:52,122 INFO L93 Difference]: Finished difference Result 6501 states and 9435 transitions. [2019-09-10 04:19:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:19:52,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-10 04:19:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:52,143 INFO L225 Difference]: With dead ends: 6501 [2019-09-10 04:19:52,143 INFO L226 Difference]: Without dead ends: 6501 [2019-09-10 04:19:52,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:19:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6501 states. [2019-09-10 04:19:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6501 to 6493. [2019-09-10 04:19:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6493 states. [2019-09-10 04:19:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 9428 transitions. [2019-09-10 04:19:52,346 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 9428 transitions. Word has length 145 [2019-09-10 04:19:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:52,346 INFO L475 AbstractCegarLoop]: Abstraction has 6493 states and 9428 transitions. [2019-09-10 04:19:52,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:19:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 9428 transitions. [2019-09-10 04:19:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:19:52,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:52,350 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:52,350 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:52,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2105135428, now seen corresponding path program 1 times [2019-09-10 04:19:52,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:52,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:52,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 04:19:52,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:19:52,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:19:52,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2019-09-10 04:19:52,440 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [285], [287], [288], [291], [313], [315], [345], [346], [349], [371], [373], [403], [404], [407], [429], [431], [461], [462], [463], [464], [467], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:19:52,448 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:19:52,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:19:52,475 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:19:53,049 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:19:53,049 INFO L272 AbstractInterpreter]: Visited 99 different actions 374 times. Merged at 11 different actions 55 times. Widened at 1 different actions 1 times. Performed 4559 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 129 variables. [2019-09-10 04:19:53,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:53,050 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:19:53,548 INFO L227 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 79.1% of their original sizes. [2019-09-10 04:19:53,548 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:19:58,195 INFO L420 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2019-09-10 04:19:58,195 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:19:58,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:19:58,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [78] imperfect sequences [4] total 80 [2019-09-10 04:19:58,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:58,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 04:19:58,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 04:19:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=5453, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 04:19:58,199 INFO L87 Difference]: Start difference. First operand 6493 states and 9428 transitions. Second operand 78 states. [2019-09-10 04:21:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:01,226 INFO L93 Difference]: Finished difference Result 7764 states and 11340 transitions. [2019-09-10 04:21:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-10 04:21:01,226 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 146 [2019-09-10 04:21:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:01,272 INFO L225 Difference]: With dead ends: 7764 [2019-09-10 04:21:01,272 INFO L226 Difference]: Without dead ends: 7764 [2019-09-10 04:21:01,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14583 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=3893, Invalid=37113, Unknown=0, NotChecked=0, Total=41006 [2019-09-10 04:21:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2019-09-10 04:21:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 7049. [2019-09-10 04:21:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-09-10 04:21:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 10192 transitions. [2019-09-10 04:21:01,468 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 10192 transitions. Word has length 146 [2019-09-10 04:21:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:01,468 INFO L475 AbstractCegarLoop]: Abstraction has 7049 states and 10192 transitions. [2019-09-10 04:21:01,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 04:21:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 10192 transitions. [2019-09-10 04:21:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:21:01,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:01,474 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:01,475 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:01,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2088158721, now seen corresponding path program 1 times [2019-09-10 04:21:01,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:01,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:01,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 04:21:01,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:01,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:01,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:21:01,608 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [274], [277], [281], [285], [287], [288], [291], [313], [315], [345], [346], [349], [371], [373], [403], [404], [407], [429], [431], [461], [462], [463], [464], [467], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:21:01,618 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:01,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:01,649 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:02,013 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:21:02,015 INFO L272 AbstractInterpreter]: Visited 101 different actions 386 times. Merged at 11 different actions 55 times. Widened at 1 different actions 1 times. Performed 4586 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4586 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 129 variables. [2019-09-10 04:21:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:02,015 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:21:02,345 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 78.76% of their original sizes. [2019-09-10 04:21:02,345 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:21:06,594 INFO L420 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2019-09-10 04:21:06,594 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:21:06,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:21:06,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [80] imperfect sequences [5] total 83 [2019-09-10 04:21:06,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:06,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-10 04:21:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-10 04:21:06,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=5757, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 04:21:06,599 INFO L87 Difference]: Start difference. First operand 7049 states and 10192 transitions. Second operand 80 states. [2019-09-10 04:22:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:22:13,181 INFO L93 Difference]: Finished difference Result 8797 states and 12725 transitions. [2019-09-10 04:22:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-09-10 04:22:13,181 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 148 [2019-09-10 04:22:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:22:13,208 INFO L225 Difference]: With dead ends: 8797 [2019-09-10 04:22:13,208 INFO L226 Difference]: Without dead ends: 8797 [2019-09-10 04:22:13,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19644 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=5223, Invalid=49767, Unknown=0, NotChecked=0, Total=54990 [2019-09-10 04:22:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8797 states. [2019-09-10 04:22:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8797 to 7533. [2019-09-10 04:22:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7533 states. [2019-09-10 04:22:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7533 states to 7533 states and 10865 transitions. [2019-09-10 04:22:13,407 INFO L78 Accepts]: Start accepts. Automaton has 7533 states and 10865 transitions. Word has length 148 [2019-09-10 04:22:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:22:13,408 INFO L475 AbstractCegarLoop]: Abstraction has 7533 states and 10865 transitions. [2019-09-10 04:22:13,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-10 04:22:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7533 states and 10865 transitions. [2019-09-10 04:22:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:22:13,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:22:13,414 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, 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:22:13,414 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:22:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:22:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash 520894295, now seen corresponding path program 1 times [2019-09-10 04:22:13,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:22:13,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:22:13,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:22:13,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:22:13,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:22:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:22:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 04:22:13,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:22:13,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:22:13,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:22:13,570 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [274], [277], [281], [285], [287], [288], [291], [313], [315], [345], [346], [349], [371], [373], [403], [404], [407], [410], [413], [418], [421], [429], [431], [461], [462], [463], [464], [467], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:22:13,574 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:22:13,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:22:13,591 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:22:14,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:22:14,950 INFO L272 AbstractInterpreter]: Visited 107 different actions 860 times. Merged at 19 different actions 189 times. Widened at 1 different actions 4 times. Performed 12040 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12040 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 25 fixpoints after 6 different actions. Largest state had 129 variables. [2019-09-10 04:22:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:22:14,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:22:14,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:22:14,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 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:22:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:22:14,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:22:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:22:15,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 04:22:15,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:22:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 04:22:15,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:22:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 04:22:15,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:22:15,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5, 16] total 30 [2019-09-10 04:22:15,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:22:15,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 04:22:15,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 04:22:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:22:15,909 INFO L87 Difference]: Start difference. First operand 7533 states and 10865 transitions. Second operand 14 states. [2019-09-10 04:22:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:22:18,386 INFO L93 Difference]: Finished difference Result 10541 states and 15235 transitions. [2019-09-10 04:22:18,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:22:18,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 148 [2019-09-10 04:22:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:22:18,420 INFO L225 Difference]: With dead ends: 10541 [2019-09-10 04:22:18,420 INFO L226 Difference]: Without dead ends: 10541 [2019-09-10 04:22:18,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 266 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2019-09-10 04:22:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10541 states. [2019-09-10 04:22:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10541 to 10531. [2019-09-10 04:22:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10531 states. [2019-09-10 04:22:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 15230 transitions. [2019-09-10 04:22:18,621 INFO L78 Accepts]: Start accepts. Automaton has 10531 states and 15230 transitions. Word has length 148 [2019-09-10 04:22:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:22:18,622 INFO L475 AbstractCegarLoop]: Abstraction has 10531 states and 15230 transitions. [2019-09-10 04:22:18,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 04:22:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 10531 states and 15230 transitions. [2019-09-10 04:22:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:22:18,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:22:18,627 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, 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:22:18,627 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:22:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:22:18,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1323739313, now seen corresponding path program 1 times [2019-09-10 04:22:18,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:22:18,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:22:18,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:22:18,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:22:18,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:22:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:22:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:22:18,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:22:18,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:22:18,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:22:18,721 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [285], [287], [288], [291], [313], [315], [345], [346], [349], [371], [373], [403], [404], [407], [429], [431], [433], [436], [439], [443], [459], [461], [462], [463], [464], [467], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:22:18,725 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:22:18,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:22:18,745 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:22:19,303 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:22:19,304 INFO L272 AbstractInterpreter]: Visited 104 different actions 506 times. Merged at 13 different actions 84 times. Widened at 1 different actions 2 times. Performed 6305 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6305 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 129 variables. [2019-09-10 04:22:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:22:19,304 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:22:19,502 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 78.83% of their original sizes. [2019-09-10 04:22:19,502 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:22:24,141 INFO L420 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2019-09-10 04:22:24,141 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:22:24,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:22:24,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [80] imperfect sequences [4] total 82 [2019-09-10 04:22:24,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:22:24,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-10 04:22:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-10 04:22:24,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=5757, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 04:22:24,144 INFO L87 Difference]: Start difference. First operand 10531 states and 15230 transitions. Second operand 80 states. [2019-09-10 04:23:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:23:45,424 INFO L93 Difference]: Finished difference Result 13745 states and 19953 transitions. [2019-09-10 04:23:45,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-10 04:23:45,424 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 148 [2019-09-10 04:23:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:23:45,460 INFO L225 Difference]: With dead ends: 13745 [2019-09-10 04:23:45,460 INFO L226 Difference]: Without dead ends: 13745 [2019-09-10 04:23:45,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17386 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=4701, Invalid=44361, Unknown=0, NotChecked=0, Total=49062 [2019-09-10 04:23:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13745 states. [2019-09-10 04:23:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13745 to 12268. [2019-09-10 04:23:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12268 states. [2019-09-10 04:23:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12268 states to 12268 states and 17658 transitions. [2019-09-10 04:23:45,735 INFO L78 Accepts]: Start accepts. Automaton has 12268 states and 17658 transitions. Word has length 148 [2019-09-10 04:23:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:23:45,736 INFO L475 AbstractCegarLoop]: Abstraction has 12268 states and 17658 transitions. [2019-09-10 04:23:45,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-10 04:23:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12268 states and 17658 transitions. [2019-09-10 04:23:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:23:45,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:23:45,743 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, 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:23:45,743 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:23:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:23:45,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1354198067, now seen corresponding path program 1 times [2019-09-10 04:23:45,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:23:45,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:23:45,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:23:45,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:23:45,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:23:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:23:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:23:45,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:23:45,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:23:45,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:23:45,878 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [285], [287], [288], [291], [313], [315], [345], [346], [349], [371], [373], [403], [404], [407], [429], [431], [433], [436], [439], [443], [459], [461], [462], [463], [464], [467], [470], [473], [478], [481], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:23:45,879 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:23:45,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:23:45,896 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:23:47,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:23:47,050 INFO L272 AbstractInterpreter]: Visited 110 different actions 1083 times. Merged at 21 different actions 252 times. Widened at 1 different actions 3 times. Performed 13622 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13622 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 42 fixpoints after 6 different actions. Largest state had 129 variables. [2019-09-10 04:23:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:23:47,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:23:47,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:23:47,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:23:47,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:23:47,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:23:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:23:47,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 04:23:47,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:23:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:23:47,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:23:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:23:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:23:47,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 15] total 28 [2019-09-10 04:23:47,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:23:47,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:23:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:23:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2019-09-10 04:23:47,853 INFO L87 Difference]: Start difference. First operand 12268 states and 17658 transitions. Second operand 13 states. [2019-09-10 04:23:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:23:49,896 INFO L93 Difference]: Finished difference Result 14074 states and 20281 transitions. [2019-09-10 04:23:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:23:49,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2019-09-10 04:23:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:23:49,931 INFO L225 Difference]: With dead ends: 14074 [2019-09-10 04:23:49,931 INFO L226 Difference]: Without dead ends: 14074 [2019-09-10 04:23:49,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 269 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:23:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14074 states. [2019-09-10 04:23:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14074 to 14064. [2019-09-10 04:23:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14064 states. [2019-09-10 04:23:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14064 states to 14064 states and 20276 transitions. [2019-09-10 04:23:50,177 INFO L78 Accepts]: Start accepts. Automaton has 14064 states and 20276 transitions. Word has length 148 [2019-09-10 04:23:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:23:50,177 INFO L475 AbstractCegarLoop]: Abstraction has 14064 states and 20276 transitions. [2019-09-10 04:23:50,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:23:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 14064 states and 20276 transitions. [2019-09-10 04:23:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:23:50,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:23:50,186 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:23:50,186 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:23:50,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:23:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1453488345, now seen corresponding path program 1 times [2019-09-10 04:23:50,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:23:50,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:23:50,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:23:50,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:23:50,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:23:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:23:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:23:50,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:23:50,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:23:50,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:23:50,284 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [285], [287], [288], [291], [313], [315], [345], [346], [349], [371], [373], [375], [378], [381], [385], [401], [403], [404], [407], [429], [431], [461], [462], [463], [464], [467], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:23:50,286 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:23:50,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:23:50,302 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:23:50,814 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:23:50,815 INFO L272 AbstractInterpreter]: Visited 109 different actions 723 times. Merged at 18 different actions 151 times. Widened at 1 different actions 3 times. Performed 9742 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9742 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 20 fixpoints after 5 different actions. Largest state had 129 variables. [2019-09-10 04:23:50,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:23:50,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:23:50,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:23:50,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:23:50,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:23:50,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:23:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:23:50,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 04:23:50,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:23:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:23:51,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:23:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:23:51,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:23:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 04:23:51,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:23:51,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:23:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:23:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:23:51,119 INFO L87 Difference]: Start difference. First operand 14064 states and 20276 transitions. Second operand 3 states. [2019-09-10 04:23:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:23:51,181 INFO L93 Difference]: Finished difference Result 25439 states and 36736 transitions. [2019-09-10 04:23:51,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:23:51,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-10 04:23:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:23:51,246 INFO L225 Difference]: With dead ends: 25439 [2019-09-10 04:23:51,246 INFO L226 Difference]: Without dead ends: 25439 [2019-09-10 04:23:51,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 293 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:23:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25439 states. [2019-09-10 04:23:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25439 to 25437. [2019-09-10 04:23:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25437 states. [2019-09-10 04:23:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25437 states to 25437 states and 36735 transitions. [2019-09-10 04:23:51,675 INFO L78 Accepts]: Start accepts. Automaton has 25437 states and 36735 transitions. Word has length 148 [2019-09-10 04:23:51,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:23:51,675 INFO L475 AbstractCegarLoop]: Abstraction has 25437 states and 36735 transitions. [2019-09-10 04:23:51,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:23:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 25437 states and 36735 transitions. [2019-09-10 04:23:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:23:51,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:23:51,686 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, 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:23:51,686 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:23:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:23:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1879380631, now seen corresponding path program 1 times [2019-09-10 04:23:51,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:23:51,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:23:51,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:23:51,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:23:51,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:23:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:23:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:23:51,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:23:51,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:23:51,775 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:23:51,776 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [285], [287], [288], [291], [294], [297], [302], [305], [313], [315], [345], [346], [349], [371], [373], [375], [378], [381], [385], [401], [403], [404], [407], [429], [431], [461], [462], [463], [464], [467], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:23:51,777 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:23:51,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:23:51,793 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:23:52,549 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:23:52,550 INFO L272 AbstractInterpreter]: Visited 106 different actions 828 times. Merged at 15 different actions 165 times. Widened at 1 different actions 3 times. Performed 12219 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 21 fixpoints after 6 different actions. Largest state had 129 variables. [2019-09-10 04:23:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:23:52,550 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:23:52,718 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 78.59% of their original sizes. [2019-09-10 04:23:52,718 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:23:57,471 INFO L420 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2019-09-10 04:23:57,472 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:23:57,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:23:57,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [83] imperfect sequences [5] total 86 [2019-09-10 04:23:57,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:23:57,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-10 04:23:57,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-10 04:23:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=6259, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 04:23:57,475 INFO L87 Difference]: Start difference. First operand 25437 states and 36735 transitions. Second operand 83 states. [2019-09-10 04:28:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:28:02,061 INFO L93 Difference]: Finished difference Result 36097 states and 51950 transitions. [2019-09-10 04:28:02,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 502 states. [2019-09-10 04:28:02,061 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 148 [2019-09-10 04:28:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:28:02,149 INFO L225 Difference]: With dead ends: 36097 [2019-09-10 04:28:02,150 INFO L226 Difference]: Without dead ends: 36097 [2019-09-10 04:28:02,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 547 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127034 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=21366, Invalid=279486, Unknown=0, NotChecked=0, Total=300852 [2019-09-10 04:28:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36097 states. [2019-09-10 04:28:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36097 to 32307. [2019-09-10 04:28:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32307 states. [2019-09-10 04:28:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32307 states to 32307 states and 45773 transitions. [2019-09-10 04:28:02,789 INFO L78 Accepts]: Start accepts. Automaton has 32307 states and 45773 transitions. Word has length 148 [2019-09-10 04:28:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:28:02,789 INFO L475 AbstractCegarLoop]: Abstraction has 32307 states and 45773 transitions. [2019-09-10 04:28:02,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-10 04:28:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32307 states and 45773 transitions. [2019-09-10 04:28:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:28:02,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:28:02,804 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, 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:28:02,804 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:28:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1626032845, now seen corresponding path program 1 times [2019-09-10 04:28:02,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:28:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:28:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:28:02,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:28:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:28:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:28:02,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:28:02,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:28:02,917 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:28:02,918 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [285], [287], [288], [291], [294], [297], [302], [305], [315], [317], [320], [323], [327], [343], [345], [346], [349], [371], [373], [403], [404], [407], [429], [431], [461], [462], [463], [464], [467], [489], [491], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:28:02,920 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:28:02,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:28:02,941 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:28:03,443 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:28:03,443 INFO L272 AbstractInterpreter]: Visited 104 different actions 622 times. Merged at 13 different actions 104 times. Widened at 1 different actions 2 times. Performed 8436 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8436 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 4 different actions. Largest state had 129 variables. [2019-09-10 04:28:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:28:03,443 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:28:03,548 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 78.89% of their original sizes. [2019-09-10 04:28:03,549 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:28:09,400 INFO L420 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2019-09-10 04:28:09,400 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:28:09,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:28:09,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [81] imperfect sequences [5] total 84 [2019-09-10 04:28:09,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:28:09,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 04:28:09,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 04:28:09,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=5940, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 04:28:09,402 INFO L87 Difference]: Start difference. First operand 32307 states and 45773 transitions. Second operand 81 states. [2019-09-10 04:32:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:33,163 INFO L93 Difference]: Finished difference Result 65104 states and 90785 transitions. [2019-09-10 04:32:33,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 600 states. [2019-09-10 04:32:33,164 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 148 [2019-09-10 04:32:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:33,275 INFO L225 Difference]: With dead ends: 65104 [2019-09-10 04:32:33,276 INFO L226 Difference]: Without dead ends: 65104 [2019-09-10 04:32:33,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 643 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183512 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=26963, Invalid=388417, Unknown=0, NotChecked=0, Total=415380 [2019-09-10 04:32:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65104 states. [2019-09-10 04:32:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65104 to 53790. [2019-09-10 04:32:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53790 states. [2019-09-10 04:32:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53790 states to 53790 states and 73947 transitions. [2019-09-10 04:32:34,212 INFO L78 Accepts]: Start accepts. Automaton has 53790 states and 73947 transitions. Word has length 148 [2019-09-10 04:32:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:34,212 INFO L475 AbstractCegarLoop]: Abstraction has 53790 states and 73947 transitions. [2019-09-10 04:32:34,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 04:32:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 53790 states and 73947 transitions. [2019-09-10 04:32:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:32:34,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:34,237 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, 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:32:34,237 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1498627863, now seen corresponding path program 1 times [2019-09-10 04:32:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:34,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:34,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:32:34,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:32:34,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:32:34,322 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:32:34,322 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [285], [287], [288], [291], [294], [297], [302], [305], [313], [315], [345], [346], [349], [371], [373], [403], [404], [407], [429], [431], [461], [462], [463], [464], [467], [489], [491], [493], [496], [499], [503], [519], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:32:34,324 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:32:34,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:32:34,340 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:32:35,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:32:35,304 INFO L272 AbstractInterpreter]: Visited 110 different actions 1340 times. Merged at 21 different actions 319 times. Widened at 1 different actions 5 times. Performed 17760 root evaluator evaluations with a maximum evaluation depth of 6. Performed 17760 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 52 fixpoints after 7 different actions. Largest state had 129 variables. [2019-09-10 04:32:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:35,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:32:35,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:32:35,305 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:32:35,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:35,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:32:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:35,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 04:32:35,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:32:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 04:32:35,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:32:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 04:32:36,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:32:36,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 14] total 26 [2019-09-10 04:32:36,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:36,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:32:36,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:32:36,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:32:36,020 INFO L87 Difference]: Start difference. First operand 53790 states and 73947 transitions. Second operand 12 states. [2019-09-10 04:32:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:37,465 INFO L93 Difference]: Finished difference Result 55010 states and 75698 transitions. [2019-09-10 04:32:37,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:32:37,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-09-10 04:32:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:37,569 INFO L225 Difference]: With dead ends: 55010 [2019-09-10 04:32:37,569 INFO L226 Difference]: Without dead ends: 55010 [2019-09-10 04:32:37,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 272 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2019-09-10 04:32:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55010 states. [2019-09-10 04:32:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55010 to 55002. [2019-09-10 04:32:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55002 states. [2019-09-10 04:32:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55002 states to 55002 states and 75694 transitions. [2019-09-10 04:32:39,607 INFO L78 Accepts]: Start accepts. Automaton has 55002 states and 75694 transitions. Word has length 148 [2019-09-10 04:32:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:39,607 INFO L475 AbstractCegarLoop]: Abstraction has 55002 states and 75694 transitions. [2019-09-10 04:32:39,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 04:32:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 55002 states and 75694 transitions. [2019-09-10 04:32:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:32:39,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:39,628 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, 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:32:39,628 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2012039469, now seen corresponding path program 1 times [2019-09-10 04:32:39,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:39,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:39,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:32:39,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:32:39,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:32:39,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:32:39,708 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [285], [287], [288], [291], [313], [315], [345], [346], [349], [352], [355], [360], [363], [371], [373], [403], [404], [407], [429], [431], [461], [462], [463], [464], [467], [489], [491], [493], [496], [499], [503], [519], [521], [522], [525], [527], [530], [532], [536], [537], [538], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [551], [552], [553], [554] [2019-09-10 04:32:39,710 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:32:39,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:32:39,727 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:32:40,296 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:32:40,296 INFO L272 AbstractInterpreter]: Visited 106 different actions 714 times. Merged at 15 different actions 134 times. Widened at 1 different actions 2 times. Performed 9481 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9481 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 18 fixpoints after 5 different actions. Largest state had 129 variables. [2019-09-10 04:32:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:40,297 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:32:40,434 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 78.91% of their original sizes. [2019-09-10 04:32:40,434 INFO L418 sIntCurrentIteration]: Unifying AI predicates