java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:10:15,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:10:15,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:10:15,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:10:15,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:10:15,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:10:15,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:10:15,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:10:15,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:10:15,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:10:15,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:10:15,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:10:15,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:10:15,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:10:15,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:10:15,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:10:15,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:10:15,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:10:15,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:10:15,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:10:15,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:10:15,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:10:15,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:10:15,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:10:15,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:10:15,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:10:15,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:10:15,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:10:15,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:10:15,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:10:15,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:10:15,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:10:15,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:10:15,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:10:15,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:10:15,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:10:15,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:10:15,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:10:15,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:10:15,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:10:15,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:10:15,177 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 08:10:15,192 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:10:15,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:10:15,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:10:15,193 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:10:15,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:10:15,193 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:10:15,194 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:10:15,194 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:10:15,194 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:10:15,194 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:10:15,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:10:15,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:10:15,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:10:15,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:10:15,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:10:15,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:10:15,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:10:15,196 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:10:15,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:10:15,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:10:15,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:10:15,197 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:10:15,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:10:15,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:10:15,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:10:15,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:10:15,198 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:10:15,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:10:15,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:10:15,199 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:10:15,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:10:15,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:10:15,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:10:15,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:10:15,252 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:10:15,253 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 08:10:15,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d51de85/4d24ddb60602470e80b5c2aba6e5a97f/FLAGb06a5656f [2019-09-10 08:10:15,758 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:10:15,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 08:10:15,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d51de85/4d24ddb60602470e80b5c2aba6e5a97f/FLAGb06a5656f [2019-09-10 08:10:16,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d51de85/4d24ddb60602470e80b5c2aba6e5a97f [2019-09-10 08:10:16,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:10:16,137 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:10:16,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:10:16,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:10:16,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:10:16,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5735c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16, skipping insertion in model container [2019-09-10 08:10:16,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,152 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:10:16,212 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:10:16,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:10:16,623 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:10:16,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:10:16,745 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:10:16,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16 WrapperNode [2019-09-10 08:10:16,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:10:16,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:10:16,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:10:16,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:10:16,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (1/1) ... [2019-09-10 08:10:16,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:10:16,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:10:16,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:10:16,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:10:16,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (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 08:10:16,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:10:16,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:10:16,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:10:16,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:10:16,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:10:16,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:10:16,864 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:10:16,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:10:16,864 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:10:16,865 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:10:16,865 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:10:16,865 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:10:16,865 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:10:16,865 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:10:16,865 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:10:16,866 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:10:16,866 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:10:16,866 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:10:16,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:10:16,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:10:16,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:10:17,529 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:10:17,530 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:10:17,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:10:17 BoogieIcfgContainer [2019-09-10 08:10:17,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:10:17,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:10:17,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:10:17,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:10:17,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:10:16" (1/3) ... [2019-09-10 08:10:17,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff95436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:10:17, skipping insertion in model container [2019-09-10 08:10:17,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:16" (2/3) ... [2019-09-10 08:10:17,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff95436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:10:17, skipping insertion in model container [2019-09-10 08:10:17,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:10:17" (3/3) ... [2019-09-10 08:10:17,545 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 08:10:17,555 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:10:17,575 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:10:17,594 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:10:17,623 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:10:17,624 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:10:17,624 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:10:17,624 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:10:17,624 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:10:17,624 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:10:17,625 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:10:17,625 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:10:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2019-09-10 08:10:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:10:17,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:17,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:17,682 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1596383191, now seen corresponding path program 1 times [2019-09-10 08:10:17,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:17,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:17,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:17,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:17,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:18,165 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 08:10:18,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:18,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:18,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:18,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:18,192 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-09-10 08:10:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:18,264 INFO L93 Difference]: Finished difference Result 187 states and 304 transitions. [2019-09-10 08:10:18,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:18,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:10:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:18,287 INFO L225 Difference]: With dead ends: 187 [2019-09-10 08:10:18,287 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 08:10:18,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 08:10:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-10 08:10:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-10 08:10:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2019-09-10 08:10:18,370 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 76 [2019-09-10 08:10:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:18,372 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2019-09-10 08:10:18,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2019-09-10 08:10:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:10:18,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:18,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:18,379 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash 959202196, now seen corresponding path program 1 times [2019-09-10 08:10:18,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:18,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:18,587 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 08:10:18,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:18,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:18,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:18,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:18,590 INFO L87 Difference]: Start difference. First operand 177 states and 254 transitions. Second operand 3 states. [2019-09-10 08:10:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:18,632 INFO L93 Difference]: Finished difference Result 291 states and 433 transitions. [2019-09-10 08:10:18,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:18,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 08:10:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:18,639 INFO L225 Difference]: With dead ends: 291 [2019-09-10 08:10:18,639 INFO L226 Difference]: Without dead ends: 291 [2019-09-10 08:10:18,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-10 08:10:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-09-10 08:10:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-10 08:10:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2019-09-10 08:10:18,662 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 77 [2019-09-10 08:10:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:18,662 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2019-09-10 08:10:18,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2019-09-10 08:10:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 08:10:18,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:18,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:18,668 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash -927003067, now seen corresponding path program 1 times [2019-09-10 08:10:18,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:18,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:18,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:18,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:18,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:18,831 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 08:10:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:18,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:18,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:18,837 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 3 states. [2019-09-10 08:10:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:18,881 INFO L93 Difference]: Finished difference Result 499 states and 761 transitions. [2019-09-10 08:10:18,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:18,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 08:10:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:18,888 INFO L225 Difference]: With dead ends: 499 [2019-09-10 08:10:18,888 INFO L226 Difference]: Without dead ends: 499 [2019-09-10 08:10:18,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-10 08:10:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2019-09-10 08:10:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-09-10 08:10:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 760 transitions. [2019-09-10 08:10:18,941 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 760 transitions. Word has length 78 [2019-09-10 08:10:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:18,942 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 760 transitions. [2019-09-10 08:10:18,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 760 transitions. [2019-09-10 08:10:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:10:18,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:18,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:18,945 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1219899588, now seen corresponding path program 1 times [2019-09-10 08:10:18,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:18,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:18,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:18,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:18,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:19,028 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 08:10:19,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:19,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:19,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:19,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:19,030 INFO L87 Difference]: Start difference. First operand 497 states and 760 transitions. Second operand 3 states. [2019-09-10 08:10:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:19,059 INFO L93 Difference]: Finished difference Result 883 states and 1361 transitions. [2019-09-10 08:10:19,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:19,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 08:10:19,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:19,065 INFO L225 Difference]: With dead ends: 883 [2019-09-10 08:10:19,065 INFO L226 Difference]: Without dead ends: 883 [2019-09-10 08:10:19,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-10 08:10:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2019-09-10 08:10:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-10 08:10:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1360 transitions. [2019-09-10 08:10:19,095 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1360 transitions. Word has length 79 [2019-09-10 08:10:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:19,096 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1360 transitions. [2019-09-10 08:10:19,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1360 transitions. [2019-09-10 08:10:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:10:19,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:19,098 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] [2019-09-10 08:10:19,099 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:19,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1078210598, now seen corresponding path program 1 times [2019-09-10 08:10:19,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:19,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:19,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:19,213 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 08:10:19,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:19,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:19,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:19,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:19,216 INFO L87 Difference]: Start difference. First operand 881 states and 1360 transitions. Second operand 3 states. [2019-09-10 08:10:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:19,247 INFO L93 Difference]: Finished difference Result 1587 states and 2449 transitions. [2019-09-10 08:10:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:19,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 08:10:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:19,256 INFO L225 Difference]: With dead ends: 1587 [2019-09-10 08:10:19,256 INFO L226 Difference]: Without dead ends: 1587 [2019-09-10 08:10:19,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-09-10 08:10:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1585. [2019-09-10 08:10:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2019-09-10 08:10:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2448 transitions. [2019-09-10 08:10:19,294 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2448 transitions. Word has length 80 [2019-09-10 08:10:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:19,296 INFO L475 AbstractCegarLoop]: Abstraction has 1585 states and 2448 transitions. [2019-09-10 08:10:19,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2448 transitions. [2019-09-10 08:10:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:10:19,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:19,303 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] [2019-09-10 08:10:19,303 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:19,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:19,303 INFO L82 PathProgramCache]: Analyzing trace with hash 847671569, now seen corresponding path program 1 times [2019-09-10 08:10:19,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:19,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:19,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:19,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:19,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:19,382 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 08:10:19,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:19,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:19,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:19,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:19,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:19,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:19,385 INFO L87 Difference]: Start difference. First operand 1585 states and 2448 transitions. Second operand 3 states. [2019-09-10 08:10:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:19,425 INFO L93 Difference]: Finished difference Result 2867 states and 4401 transitions. [2019-09-10 08:10:19,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:19,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 08:10:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:19,440 INFO L225 Difference]: With dead ends: 2867 [2019-09-10 08:10:19,440 INFO L226 Difference]: Without dead ends: 2867 [2019-09-10 08:10:19,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2019-09-10 08:10:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2865. [2019-09-10 08:10:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-10 08:10:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4400 transitions. [2019-09-10 08:10:19,526 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4400 transitions. Word has length 81 [2019-09-10 08:10:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:19,528 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4400 transitions. [2019-09-10 08:10:19,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4400 transitions. [2019-09-10 08:10:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:10:19,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:19,538 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] [2019-09-10 08:10:19,543 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash 12169119, now seen corresponding path program 1 times [2019-09-10 08:10:19,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:19,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:19,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:19,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:19,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:19,683 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 08:10:19,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:19,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:19,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:19,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:19,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:19,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:19,685 INFO L87 Difference]: Start difference. First operand 2865 states and 4400 transitions. Second operand 5 states. [2019-09-10 08:10:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:19,971 INFO L93 Difference]: Finished difference Result 5683 states and 8721 transitions. [2019-09-10 08:10:19,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:19,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:10:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:19,998 INFO L225 Difference]: With dead ends: 5683 [2019-09-10 08:10:19,999 INFO L226 Difference]: Without dead ends: 5683 [2019-09-10 08:10:19,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:10:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2019-09-10 08:10:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5681. [2019-09-10 08:10:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-10 08:10:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8720 transitions. [2019-09-10 08:10:20,135 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8720 transitions. Word has length 82 [2019-09-10 08:10:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:20,136 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8720 transitions. [2019-09-10 08:10:20,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8720 transitions. [2019-09-10 08:10:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:10:20,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:20,137 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] [2019-09-10 08:10:20,137 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:20,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:20,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1733499994, now seen corresponding path program 1 times [2019-09-10 08:10:20,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:20,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:20,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:20,243 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 08:10:20,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:20,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:20,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:20,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:20,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:20,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:20,245 INFO L87 Difference]: Start difference. First operand 5681 states and 8720 transitions. Second operand 5 states. [2019-09-10 08:10:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:20,402 INFO L93 Difference]: Finished difference Result 5681 states and 8656 transitions. [2019-09-10 08:10:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:20,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:10:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:20,427 INFO L225 Difference]: With dead ends: 5681 [2019-09-10 08:10:20,427 INFO L226 Difference]: Without dead ends: 5681 [2019-09-10 08:10:20,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:10:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-10 08:10:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5681. [2019-09-10 08:10:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-10 08:10:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8656 transitions. [2019-09-10 08:10:20,594 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8656 transitions. Word has length 82 [2019-09-10 08:10:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:20,595 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8656 transitions. [2019-09-10 08:10:20,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8656 transitions. [2019-09-10 08:10:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:10:20,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:20,597 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] [2019-09-10 08:10:20,597 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash 286470399, now seen corresponding path program 1 times [2019-09-10 08:10:20,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:20,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:20,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:20,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:20,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:20,759 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 08:10:20,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:20,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:20,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:20,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:20,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:20,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:20,762 INFO L87 Difference]: Start difference. First operand 5681 states and 8656 transitions. Second operand 5 states. [2019-09-10 08:10:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:20,943 INFO L93 Difference]: Finished difference Result 5681 states and 8592 transitions. [2019-09-10 08:10:20,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:20,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:10:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:20,970 INFO L225 Difference]: With dead ends: 5681 [2019-09-10 08:10:20,970 INFO L226 Difference]: Without dead ends: 5681 [2019-09-10 08:10:20,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:10:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-10 08:10:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5681. [2019-09-10 08:10:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-10 08:10:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8592 transitions. [2019-09-10 08:10:21,099 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8592 transitions. Word has length 82 [2019-09-10 08:10:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:21,099 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8592 transitions. [2019-09-10 08:10:21,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8592 transitions. [2019-09-10 08:10:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:10:21,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:21,101 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] [2019-09-10 08:10:21,101 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1555560134, now seen corresponding path program 1 times [2019-09-10 08:10:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:21,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:21,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:21,194 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 08:10:21,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:21,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:21,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:21,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:21,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:21,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:21,196 INFO L87 Difference]: Start difference. First operand 5681 states and 8592 transitions. Second operand 5 states. [2019-09-10 08:10:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:21,352 INFO L93 Difference]: Finished difference Result 5681 states and 8528 transitions. [2019-09-10 08:10:21,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:21,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:10:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:21,377 INFO L225 Difference]: With dead ends: 5681 [2019-09-10 08:10:21,377 INFO L226 Difference]: Without dead ends: 5681 [2019-09-10 08:10:21,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:10:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-10 08:10:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5681. [2019-09-10 08:10:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-10 08:10:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8528 transitions. [2019-09-10 08:10:21,579 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8528 transitions. Word has length 82 [2019-09-10 08:10:21,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:21,580 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8528 transitions. [2019-09-10 08:10:21,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8528 transitions. [2019-09-10 08:10:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:10:21,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:21,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:21,581 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1275335605, now seen corresponding path program 1 times [2019-09-10 08:10:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:21,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:21,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:21,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:21,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:21,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:21,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:21,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:21,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:21,709 INFO L87 Difference]: Start difference. First operand 5681 states and 8528 transitions. Second operand 5 states. [2019-09-10 08:10:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:21,833 INFO L93 Difference]: Finished difference Result 5681 states and 8464 transitions. [2019-09-10 08:10:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:21,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:10:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:21,850 INFO L225 Difference]: With dead ends: 5681 [2019-09-10 08:10:21,850 INFO L226 Difference]: Without dead ends: 5681 [2019-09-10 08:10:21,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:10:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-09-10 08:10:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5681. [2019-09-10 08:10:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-09-10 08:10:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 8464 transitions. [2019-09-10 08:10:21,949 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 8464 transitions. Word has length 82 [2019-09-10 08:10:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:21,950 INFO L475 AbstractCegarLoop]: Abstraction has 5681 states and 8464 transitions. [2019-09-10 08:10:21,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 8464 transitions. [2019-09-10 08:10:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:10:21,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:21,951 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] [2019-09-10 08:10:21,951 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1745763686, now seen corresponding path program 1 times [2019-09-10 08:10:21,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:21,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:21,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:21,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:21,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:22,189 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 08:10:22,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:22,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:22,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:22,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:22,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:22,192 INFO L87 Difference]: Start difference. First operand 5681 states and 8464 transitions. Second operand 8 states. [2019-09-10 08:10:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:22,653 INFO L93 Difference]: Finished difference Result 56387 states and 83193 transitions. [2019-09-10 08:10:22,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:10:22,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-10 08:10:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:22,823 INFO L225 Difference]: With dead ends: 56387 [2019-09-10 08:10:22,823 INFO L226 Difference]: Without dead ends: 56387 [2019-09-10 08:10:22,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:10:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56387 states. [2019-09-10 08:10:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56387 to 16945. [2019-09-10 08:10:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16945 states. [2019-09-10 08:10:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16945 states to 16945 states and 25040 transitions. [2019-09-10 08:10:23,636 INFO L78 Accepts]: Start accepts. Automaton has 16945 states and 25040 transitions. Word has length 82 [2019-09-10 08:10:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:23,636 INFO L475 AbstractCegarLoop]: Abstraction has 16945 states and 25040 transitions. [2019-09-10 08:10:23,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 16945 states and 25040 transitions. [2019-09-10 08:10:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:10:23,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:23,638 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] [2019-09-10 08:10:23,638 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash 760119925, now seen corresponding path program 1 times [2019-09-10 08:10:23,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:23,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:23,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:23,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:23,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:23,715 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 08:10:23,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:23,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:10:23,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:23,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:10:23,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:10:23,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:23,716 INFO L87 Difference]: Start difference. First operand 16945 states and 25040 transitions. Second operand 3 states. [2019-09-10 08:10:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:23,783 INFO L93 Difference]: Finished difference Result 21045 states and 30835 transitions. [2019-09-10 08:10:23,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:10:23,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 08:10:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:23,825 INFO L225 Difference]: With dead ends: 21045 [2019-09-10 08:10:23,825 INFO L226 Difference]: Without dead ends: 21045 [2019-09-10 08:10:23,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:10:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21045 states. [2019-09-10 08:10:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21045 to 21043. [2019-09-10 08:10:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21043 states. [2019-09-10 08:10:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21043 states to 21043 states and 30834 transitions. [2019-09-10 08:10:24,599 INFO L78 Accepts]: Start accepts. Automaton has 21043 states and 30834 transitions. Word has length 84 [2019-09-10 08:10:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:24,599 INFO L475 AbstractCegarLoop]: Abstraction has 21043 states and 30834 transitions. [2019-09-10 08:10:24,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:10:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21043 states and 30834 transitions. [2019-09-10 08:10:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:10:24,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:24,600 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] [2019-09-10 08:10:24,601 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash 780169268, now seen corresponding path program 1 times [2019-09-10 08:10:24,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:24,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:24,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:24,900 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 08:10:24,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:24,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:24,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:24,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:24,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:24,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:24,901 INFO L87 Difference]: Start difference. First operand 21043 states and 30834 transitions. Second operand 8 states. [2019-09-10 08:10:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:25,179 INFO L93 Difference]: Finished difference Result 26681 states and 39093 transitions. [2019-09-10 08:10:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:25,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-10 08:10:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:25,231 INFO L225 Difference]: With dead ends: 26681 [2019-09-10 08:10:25,231 INFO L226 Difference]: Without dead ends: 26681 [2019-09-10 08:10:25,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:10:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26681 states. [2019-09-10 08:10:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26681 to 21043. [2019-09-10 08:10:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21043 states. [2019-09-10 08:10:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21043 states to 21043 states and 30674 transitions. [2019-09-10 08:10:25,677 INFO L78 Accepts]: Start accepts. Automaton has 21043 states and 30674 transitions. Word has length 84 [2019-09-10 08:10:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:25,677 INFO L475 AbstractCegarLoop]: Abstraction has 21043 states and 30674 transitions. [2019-09-10 08:10:25,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 21043 states and 30674 transitions. [2019-09-10 08:10:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:10:25,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:25,678 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] [2019-09-10 08:10:25,679 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1586465785, now seen corresponding path program 1 times [2019-09-10 08:10:25,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:25,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:25,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:25,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:25,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:25,793 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 08:10:25,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:25,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:25,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:25,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:25,795 INFO L87 Difference]: Start difference. First operand 21043 states and 30674 transitions. Second operand 5 states. [2019-09-10 08:10:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:25,931 INFO L93 Difference]: Finished difference Result 40837 states and 58801 transitions. [2019-09-10 08:10:25,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:10:25,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 08:10:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:26,015 INFO L225 Difference]: With dead ends: 40837 [2019-09-10 08:10:26,015 INFO L226 Difference]: Without dead ends: 40837 [2019-09-10 08:10:26,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:10:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40837 states. [2019-09-10 08:10:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40837 to 21875. [2019-09-10 08:10:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21875 states. [2019-09-10 08:10:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21875 states to 21875 states and 31474 transitions. [2019-09-10 08:10:26,567 INFO L78 Accepts]: Start accepts. Automaton has 21875 states and 31474 transitions. Word has length 85 [2019-09-10 08:10:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:26,567 INFO L475 AbstractCegarLoop]: Abstraction has 21875 states and 31474 transitions. [2019-09-10 08:10:26,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 21875 states and 31474 transitions. [2019-09-10 08:10:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:10:26,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:26,576 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:26,577 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:26,577 INFO L82 PathProgramCache]: Analyzing trace with hash -784533912, now seen corresponding path program 1 times [2019-09-10 08:10:26,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:26,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:26,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:26,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:26,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:10:26,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:26,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:26,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:26,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:26,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:26,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:26,759 INFO L87 Difference]: Start difference. First operand 21875 states and 31474 transitions. Second operand 8 states. [2019-09-10 08:10:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:27,158 INFO L93 Difference]: Finished difference Result 102079 states and 147064 transitions. [2019-09-10 08:10:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:27,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:10:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:27,344 INFO L225 Difference]: With dead ends: 102079 [2019-09-10 08:10:27,345 INFO L226 Difference]: Without dead ends: 102079 [2019-09-10 08:10:27,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:10:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102079 states. [2019-09-10 08:10:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102079 to 35027. [2019-09-10 08:10:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35027 states. [2019-09-10 08:10:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35027 states to 35027 states and 50162 transitions. [2019-09-10 08:10:29,242 INFO L78 Accepts]: Start accepts. Automaton has 35027 states and 50162 transitions. Word has length 115 [2019-09-10 08:10:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:29,242 INFO L475 AbstractCegarLoop]: Abstraction has 35027 states and 50162 transitions. [2019-09-10 08:10:29,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 35027 states and 50162 transitions. [2019-09-10 08:10:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:10:29,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:29,253 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:29,253 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1354552530, now seen corresponding path program 1 times [2019-09-10 08:10:29,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:29,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:29,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:10:29,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:29,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:29,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:29,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:29,470 INFO L87 Difference]: Start difference. First operand 35027 states and 50162 transitions. Second operand 8 states. [2019-09-10 08:10:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:29,901 INFO L93 Difference]: Finished difference Result 113727 states and 163640 transitions. [2019-09-10 08:10:29,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:29,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:10:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:30,057 INFO L225 Difference]: With dead ends: 113727 [2019-09-10 08:10:30,057 INFO L226 Difference]: Without dead ends: 113727 [2019-09-10 08:10:30,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:10:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113727 states. [2019-09-10 08:10:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113727 to 42355. [2019-09-10 08:10:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42355 states. [2019-09-10 08:10:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42355 states to 42355 states and 60690 transitions. [2019-09-10 08:10:31,401 INFO L78 Accepts]: Start accepts. Automaton has 42355 states and 60690 transitions. Word has length 115 [2019-09-10 08:10:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:31,401 INFO L475 AbstractCegarLoop]: Abstraction has 42355 states and 60690 transitions. [2019-09-10 08:10:31,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 42355 states and 60690 transitions. [2019-09-10 08:10:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:10:31,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:31,410 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:31,411 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:31,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1652537018, now seen corresponding path program 1 times [2019-09-10 08:10:31,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:31,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:31,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:31,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:31,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:10:31,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 08:10:31,538 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [138], [140], [143], [151], [153], [156], [164], [166], [169], [177], [179], [182], [190], [192], [195], [198], [203], [205], [208], [215], [217], [220], [221], [223], [232], [235], [239], [241], [244], [250], [253], [256], [258], [273], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [348], [350], [353], [356], [358], [373], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:10:31,589 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:10:31,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:10:31,783 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:10:32,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:10:32,858 INFO L272 AbstractInterpreter]: Visited 107 different actions 1045 times. Merged at 60 different actions 811 times. Widened at 26 different actions 134 times. Performed 3920 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3920 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 104 fixpoints after 21 different actions. Largest state had 156 variables. [2019-09-10 08:10:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:32,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:10:32,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:32,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:10:32,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:32,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:10:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:33,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:10:33,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:10:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:10:33,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:10:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:10:33,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:10:33,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 15 [2019-09-10 08:10:33,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:33,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:33,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:10:33,497 INFO L87 Difference]: Start difference. First operand 42355 states and 60690 transitions. Second operand 8 states. [2019-09-10 08:10:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:34,103 INFO L93 Difference]: Finished difference Result 91741 states and 131415 transitions. [2019-09-10 08:10:34,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:34,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:10:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:34,286 INFO L225 Difference]: With dead ends: 91741 [2019-09-10 08:10:34,287 INFO L226 Difference]: Without dead ends: 91741 [2019-09-10 08:10:34,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:10:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91741 states. [2019-09-10 08:10:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91741 to 56851. [2019-09-10 08:10:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56851 states. [2019-09-10 08:10:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56851 states to 56851 states and 81266 transitions. [2019-09-10 08:10:35,510 INFO L78 Accepts]: Start accepts. Automaton has 56851 states and 81266 transitions. Word has length 115 [2019-09-10 08:10:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:35,511 INFO L475 AbstractCegarLoop]: Abstraction has 56851 states and 81266 transitions. [2019-09-10 08:10:35,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56851 states and 81266 transitions. [2019-09-10 08:10:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:10:35,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:35,524 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:35,525 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:35,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:35,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1676282240, now seen corresponding path program 1 times [2019-09-10 08:10:35,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:35,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:35,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:35,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:35,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:36,696 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 3 [2019-09-10 08:10:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:36,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:36,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:10:36,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 08:10:36,731 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [138], [140], [143], [151], [153], [156], [164], [166], [169], [177], [179], [182], [185], [190], [192], [195], [203], [205], [208], [215], [217], [220], [221], [223], [232], [235], [239], [248], [250], [253], [256], [258], [266], [269], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [348], [350], [353], [356], [358], [373], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:10:36,735 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:10:36,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:10:36,764 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:10:37,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:10:37,352 INFO L272 AbstractInterpreter]: Visited 107 different actions 831 times. Merged at 60 different actions 626 times. Widened at 25 different actions 101 times. Performed 3055 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3055 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 81 fixpoints after 22 different actions. Largest state had 156 variables. [2019-09-10 08:10:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:37,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:10:37,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:37,353 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 08:10:37,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:37,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:10:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:37,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:10:37,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:10:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:10:37,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:10:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:10:38,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:10:38,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 15 [2019-09-10 08:10:38,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:38,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:38,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:10:38,043 INFO L87 Difference]: Start difference. First operand 56851 states and 81266 transitions. Second operand 8 states. [2019-09-10 08:10:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:38,438 INFO L93 Difference]: Finished difference Result 106239 states and 151992 transitions. [2019-09-10 08:10:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:38,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:10:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:38,579 INFO L225 Difference]: With dead ends: 106239 [2019-09-10 08:10:38,579 INFO L226 Difference]: Without dead ends: 106239 [2019-09-10 08:10:38,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:10:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106239 states. [2019-09-10 08:10:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106239 to 71347. [2019-09-10 08:10:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71347 states. [2019-09-10 08:10:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71347 states to 71347 states and 101842 transitions. [2019-09-10 08:10:39,554 INFO L78 Accepts]: Start accepts. Automaton has 71347 states and 101842 transitions. Word has length 115 [2019-09-10 08:10:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:39,554 INFO L475 AbstractCegarLoop]: Abstraction has 71347 states and 101842 transitions. [2019-09-10 08:10:39,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 71347 states and 101842 transitions. [2019-09-10 08:10:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:10:39,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:39,564 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:39,564 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2048808134, now seen corresponding path program 1 times [2019-09-10 08:10:39,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:39,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:39,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:39,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:10:39,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:39,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:39,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:39,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:39,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:39,787 INFO L87 Difference]: Start difference. First operand 71347 states and 101842 transitions. Second operand 8 states. [2019-09-10 08:10:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:40,394 INFO L93 Difference]: Finished difference Result 120735 states and 172568 transitions. [2019-09-10 08:10:40,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:40,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:10:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:40,549 INFO L225 Difference]: With dead ends: 120735 [2019-09-10 08:10:40,549 INFO L226 Difference]: Without dead ends: 120735 [2019-09-10 08:10:40,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:10:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120735 states. [2019-09-10 08:10:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120735 to 85843. [2019-09-10 08:10:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85843 states. [2019-09-10 08:10:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85843 states to 85843 states and 122418 transitions. [2019-09-10 08:10:42,161 INFO L78 Accepts]: Start accepts. Automaton has 85843 states and 122418 transitions. Word has length 115 [2019-09-10 08:10:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:42,162 INFO L475 AbstractCegarLoop]: Abstraction has 85843 states and 122418 transitions. [2019-09-10 08:10:42,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 85843 states and 122418 transitions. [2019-09-10 08:10:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:10:42,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:42,172 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:42,172 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:42,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:42,173 INFO L82 PathProgramCache]: Analyzing trace with hash 333801332, now seen corresponding path program 1 times [2019-09-10 08:10:42,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:42,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:42,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:42,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:42,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:42,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:42,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:10:42,285 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 08:10:42,285 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [138], [140], [143], [151], [153], [156], [159], [164], [166], [169], [177], [179], [182], [190], [192], [195], [203], [205], [208], [215], [217], [220], [221], [223], [232], [235], [239], [248], [250], [253], [256], [258], [273], [275], [278], [281], [283], [298], [300], [303], [306], [308], [316], [319], [325], [328], [331], [333], [348], [350], [353], [356], [358], [373], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:10:42,288 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:10:42,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:10:42,315 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:10:42,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:10:42,975 INFO L272 AbstractInterpreter]: Visited 107 different actions 1019 times. Merged at 60 different actions 789 times. Widened at 27 different actions 144 times. Performed 3837 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3837 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 107 fixpoints after 24 different actions. Largest state had 156 variables. [2019-09-10 08:10:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:42,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:10:42,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:42,976 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 08:10:42,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:42,991 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 08:10:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:43,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:10:43,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:10:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:10:43,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:10:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:10:43,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:10:43,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 15 [2019-09-10 08:10:43,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:43,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:43,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:43,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:10:43,376 INFO L87 Difference]: Start difference. First operand 85843 states and 122418 transitions. Second operand 8 states. [2019-09-10 08:10:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:45,585 INFO L93 Difference]: Finished difference Result 135231 states and 193144 transitions. [2019-09-10 08:10:45,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:45,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:10:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:45,745 INFO L225 Difference]: With dead ends: 135231 [2019-09-10 08:10:45,745 INFO L226 Difference]: Without dead ends: 135231 [2019-09-10 08:10:45,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:10:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135231 states. [2019-09-10 08:10:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135231 to 100339. [2019-09-10 08:10:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100339 states. [2019-09-10 08:10:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100339 states to 100339 states and 142994 transitions. [2019-09-10 08:10:46,603 INFO L78 Accepts]: Start accepts. Automaton has 100339 states and 142994 transitions. Word has length 115 [2019-09-10 08:10:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:46,603 INFO L475 AbstractCegarLoop]: Abstraction has 100339 states and 142994 transitions. [2019-09-10 08:10:46,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 100339 states and 142994 transitions. [2019-09-10 08:10:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:10:46,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:46,613 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:46,613 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:46,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 90667176, now seen corresponding path program 1 times [2019-09-10 08:10:46,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:46,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:46,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:46,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:46,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:10:46,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:46,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:10:46,705 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 08:10:46,705 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [138], [140], [143], [151], [153], [156], [164], [166], [169], [177], [179], [182], [190], [192], [195], [203], [205], [208], [211], [215], [217], [220], [221], [223], [225], [230], [232], [235], [248], [250], [253], [256], [258], [273], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [348], [350], [353], [356], [358], [373], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:10:46,708 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:10:46,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:10:46,734 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:10:47,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:10:47,304 INFO L272 AbstractInterpreter]: Visited 107 different actions 1026 times. Merged at 60 different actions 779 times. Widened at 27 different actions 149 times. Performed 3818 root evaluator evaluations with a maximum evaluation depth of 8. Performed 3818 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 118 fixpoints after 26 different actions. Largest state had 156 variables. [2019-09-10 08:10:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:47,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:10:47,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:10:47,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 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 08:10:47,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:47,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:10:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:47,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:10:47,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:10:47,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:48,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:10:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:10:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:48,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:10:48,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 20 [2019-09-10 08:10:48,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:10:48,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:10:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:10:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:10:48,465 INFO L87 Difference]: Start difference. First operand 100339 states and 142994 transitions. Second operand 12 states. [2019-09-10 08:10:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:57,292 INFO L93 Difference]: Finished difference Result 535485 states and 744311 transitions. [2019-09-10 08:10:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 08:10:57,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-09-10 08:10:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:57,842 INFO L225 Difference]: With dead ends: 535485 [2019-09-10 08:10:57,842 INFO L226 Difference]: Without dead ends: 535485 [2019-09-10 08:10:57,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1274, Invalid=3696, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 08:10:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535485 states. [2019-09-10 08:11:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535485 to 290963. [2019-09-10 08:11:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290963 states. [2019-09-10 08:11:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290963 states to 290963 states and 407314 transitions. [2019-09-10 08:11:05,789 INFO L78 Accepts]: Start accepts. Automaton has 290963 states and 407314 transitions. Word has length 116 [2019-09-10 08:11:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:05,789 INFO L475 AbstractCegarLoop]: Abstraction has 290963 states and 407314 transitions. [2019-09-10 08:11:05,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:11:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 290963 states and 407314 transitions. [2019-09-10 08:11:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:11:05,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:05,802 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:05,803 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:05,803 INFO L82 PathProgramCache]: Analyzing trace with hash -827392191, now seen corresponding path program 1 times [2019-09-10 08:11:05,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:05,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:05,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:06,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:11:06,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:11:06,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 08:11:06,060 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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [138], [140], [143], [146], [151], [153], [156], [164], [166], [169], [177], [179], [182], [190], [192], [195], [203], [205], [208], [215], [217], [220], [221], [223], [232], [235], [239], [248], [250], [253], [256], [258], [273], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [341], [344], [350], [353], [356], [358], [366], [369], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:11:06,062 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:11:06,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:11:06,088 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:11:06,710 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:11:06,711 INFO L272 AbstractInterpreter]: Visited 109 different actions 1024 times. Merged at 62 different actions 801 times. Widened at 23 different actions 147 times. Performed 3843 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3843 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 102 fixpoints after 21 different actions. Largest state had 156 variables. [2019-09-10 08:11:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:06,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:11:06,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:11:06,711 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) [2019-09-10 08:11:06,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:06,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:11:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:06,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:11:06,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:11:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:07,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:11:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:07,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:11:07,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:11:07,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:11:07,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:11:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:11:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:11:07,515 INFO L87 Difference]: Start difference. First operand 290963 states and 407314 transitions. Second operand 17 states. [2019-09-10 08:11:22,805 WARN L188 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 08:11:24,101 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:11:24,852 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:11:25,908 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-10 08:13:02,115 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:13:29,902 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:13:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:33,722 INFO L93 Difference]: Finished difference Result 9544293 states and 13023463 transitions. [2019-09-10 08:13:33,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 411 states. [2019-09-10 08:13:33,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 117 [2019-09-10 08:13:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted.