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.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:30:26,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:30:26,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:30:26,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:30:26,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:30:26,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:30:26,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:30:26,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:30:26,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:30:26,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:30:26,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:30:26,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:30:26,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:30:26,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:30:26,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:30:26,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:30:26,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:30:26,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:30:26,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:30:26,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:30:26,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:30:26,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:30:26,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:30:26,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:30:26,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:30:26,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:30:26,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:30:26,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:30:26,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:30:26,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:30:26,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:30:26,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:30:26,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:30:26,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:30:26,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:30:26,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:30:26,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:30:26,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:30:26,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:30:26,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:30:26,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:30:26,234 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:30:26,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:30:26,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:30:26,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:30:26,251 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:30:26,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:30:26,256 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:30:26,256 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:30:26,256 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:30:26,256 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:30:26,256 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:30:26,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:30:26,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:30:26,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:30:26,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:30:26,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:30:26,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:30:26,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:30:26,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:30:26,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:30:26,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:30:26,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:30:26,262 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:30:26,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:30:26,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:30:26,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:30:26,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:30:26,263 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:30:26,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:30:26,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:30:26,264 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:30:26,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:30:26,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:30:26,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:30:26,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:30:26,324 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:30:26,325 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:30:26,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d03d245/7a81d3ce8ae443c0a5b0030d91786a58/FLAGc39f2e978 [2019-09-10 08:30:26,957 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:30:26,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:30:26,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d03d245/7a81d3ce8ae443c0a5b0030d91786a58/FLAGc39f2e978 [2019-09-10 08:30:27,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d03d245/7a81d3ce8ae443c0a5b0030d91786a58 [2019-09-10 08:30:27,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:30:27,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:30:27,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:30:27,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:30:27,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:30:27,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:30:27" (1/1) ... [2019-09-10 08:30:27,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b08670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:27, skipping insertion in model container [2019-09-10 08:30:27,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:30:27" (1/1) ... [2019-09-10 08:30:27,301 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:30:27,365 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:30:27,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:30:27,987 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:30:28,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:30:28,154 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:30:28,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28 WrapperNode [2019-09-10 08:30:28,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:30:28,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:30:28,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:30:28,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:30:28,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (1/1) ... [2019-09-10 08:30:28,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (1/1) ... [2019-09-10 08:30:28,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (1/1) ... [2019-09-10 08:30:28,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (1/1) ... [2019-09-10 08:30:28,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (1/1) ... [2019-09-10 08:30:28,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (1/1) ... [2019-09-10 08:30:28,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (1/1) ... [2019-09-10 08:30:28,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:30:28,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:30:28,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:30:28,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:30:28,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (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:30:28,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:30:28,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:30:28,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:30:28,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:30:28,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:30:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:30:28,289 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:30:28,290 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:30:28,290 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:30:28,290 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:30:28,290 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:30:28,290 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:30:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:30:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:30:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:30:29,086 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:30:29,086 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:30:29,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:30:29 BoogieIcfgContainer [2019-09-10 08:30:29,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:30:29,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:30:29,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:30:29,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:30:29,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:30:27" (1/3) ... [2019-09-10 08:30:29,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9987c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:30:29, skipping insertion in model container [2019-09-10 08:30:29,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:30:28" (2/3) ... [2019-09-10 08:30:29,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9987c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:30:29, skipping insertion in model container [2019-09-10 08:30:29,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:30:29" (3/3) ... [2019-09-10 08:30:29,096 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:30:29,106 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:30:29,126 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:30:29,143 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:30:29,169 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:30:29,170 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:30:29,170 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:30:29,170 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:30:29,170 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:30:29,170 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:30:29,171 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:30:29,171 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:30:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-09-10 08:30:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:30:29,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:29,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:29,209 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash -134323180, now seen corresponding path program 1 times [2019-09-10 08:30:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:29,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:29,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:29,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:29,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:29,743 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:30:29,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:29,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:29,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:29,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:29,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:29,769 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-09-10 08:30:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:29,850 INFO L93 Difference]: Finished difference Result 221 states and 360 transitions. [2019-09-10 08:30:29,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:29,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 08:30:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:29,867 INFO L225 Difference]: With dead ends: 221 [2019-09-10 08:30:29,868 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 08:30:29,869 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:30:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 08:30:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-09-10 08:30:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-10 08:30:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2019-09-10 08:30:29,939 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 91 [2019-09-10 08:30:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:29,940 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2019-09-10 08:30:29,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2019-09-10 08:30:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:30:29,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:29,945 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1153087707, now seen corresponding path program 1 times [2019-09-10 08:30:29,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:29,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:29,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:30,175 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:30:30,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:30,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:30,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:30,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:30,179 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand 3 states. [2019-09-10 08:30:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:30,235 INFO L93 Difference]: Finished difference Result 349 states and 519 transitions. [2019-09-10 08:30:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:30,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 08:30:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:30,244 INFO L225 Difference]: With dead ends: 349 [2019-09-10 08:30:30,244 INFO L226 Difference]: Without dead ends: 349 [2019-09-10 08:30:30,245 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:30:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-10 08:30:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-09-10 08:30:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-10 08:30:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 518 transitions. [2019-09-10 08:30:30,281 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 518 transitions. Word has length 92 [2019-09-10 08:30:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:30,282 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 518 transitions. [2019-09-10 08:30:30,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 518 transitions. [2019-09-10 08:30:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:30:30,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:30,285 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:30,286 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash 453064733, now seen corresponding path program 1 times [2019-09-10 08:30:30,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:30,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:30,438 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:30:30,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:30,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:30,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:30,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:30,445 INFO L87 Difference]: Start difference. First operand 347 states and 518 transitions. Second operand 3 states. [2019-09-10 08:30:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:30,492 INFO L93 Difference]: Finished difference Result 605 states and 923 transitions. [2019-09-10 08:30:30,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:30,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 08:30:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:30,504 INFO L225 Difference]: With dead ends: 605 [2019-09-10 08:30:30,505 INFO L226 Difference]: Without dead ends: 605 [2019-09-10 08:30:30,505 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:30:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-10 08:30:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-09-10 08:30:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-10 08:30:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 922 transitions. [2019-09-10 08:30:30,561 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 922 transitions. Word has length 93 [2019-09-10 08:30:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:30,562 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 922 transitions. [2019-09-10 08:30:30,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 922 transitions. [2019-09-10 08:30:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:30:30,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:30,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:30,577 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1052328474, now seen corresponding path program 1 times [2019-09-10 08:30:30,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:30,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:30,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:30,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:30,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:30,814 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:30:30,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:30,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:30,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:30,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:30,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:30,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:30,816 INFO L87 Difference]: Start difference. First operand 603 states and 922 transitions. Second operand 3 states. [2019-09-10 08:30:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:30,844 INFO L93 Difference]: Finished difference Result 1085 states and 1675 transitions. [2019-09-10 08:30:30,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:30,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 08:30:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:30,856 INFO L225 Difference]: With dead ends: 1085 [2019-09-10 08:30:30,856 INFO L226 Difference]: Without dead ends: 1085 [2019-09-10 08:30:30,857 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:30:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-10 08:30:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2019-09-10 08:30:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-09-10 08:30:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1674 transitions. [2019-09-10 08:30:30,889 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1674 transitions. Word has length 94 [2019-09-10 08:30:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:30,890 INFO L475 AbstractCegarLoop]: Abstraction has 1083 states and 1674 transitions. [2019-09-10 08:30:30,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1674 transitions. [2019-09-10 08:30:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:30:30,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:30,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:30,895 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash 178473406, now seen corresponding path program 1 times [2019-09-10 08:30:30,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:30,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:30,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:31,027 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:30:31,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:31,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:31,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:31,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:31,029 INFO L87 Difference]: Start difference. First operand 1083 states and 1674 transitions. Second operand 3 states. [2019-09-10 08:30:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:31,062 INFO L93 Difference]: Finished difference Result 1981 states and 3067 transitions. [2019-09-10 08:30:31,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:31,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 08:30:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:31,073 INFO L225 Difference]: With dead ends: 1981 [2019-09-10 08:30:31,073 INFO L226 Difference]: Without dead ends: 1981 [2019-09-10 08:30:31,074 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:30:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-10 08:30:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1979. [2019-09-10 08:30:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2019-09-10 08:30:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 3066 transitions. [2019-09-10 08:30:31,121 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 3066 transitions. Word has length 95 [2019-09-10 08:30:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:31,122 INFO L475 AbstractCegarLoop]: Abstraction has 1979 states and 3066 transitions. [2019-09-10 08:30:31,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3066 transitions. [2019-09-10 08:30:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:30:31,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:31,123 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:31,124 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash -502513908, now seen corresponding path program 1 times [2019-09-10 08:30:31,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:31,222 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:30:31,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:31,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:31,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:31,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:31,224 INFO L87 Difference]: Start difference. First operand 1979 states and 3066 transitions. Second operand 3 states. [2019-09-10 08:30:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:31,266 INFO L93 Difference]: Finished difference Result 3645 states and 5627 transitions. [2019-09-10 08:30:31,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:31,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 08:30:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:31,286 INFO L225 Difference]: With dead ends: 3645 [2019-09-10 08:30:31,286 INFO L226 Difference]: Without dead ends: 3645 [2019-09-10 08:30:31,287 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:30:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2019-09-10 08:30:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3643. [2019-09-10 08:30:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:30:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5626 transitions. [2019-09-10 08:30:31,406 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5626 transitions. Word has length 96 [2019-09-10 08:30:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:31,412 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5626 transitions. [2019-09-10 08:30:31,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5626 transitions. [2019-09-10 08:30:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:30:31,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:31,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:31,421 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:31,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1106092338, now seen corresponding path program 1 times [2019-09-10 08:30:31,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:31,560 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:30:31,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:31,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:30:31,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:31,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:30:31,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:30:31,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:30:31,562 INFO L87 Difference]: Start difference. First operand 3643 states and 5626 transitions. Second operand 5 states. [2019-09-10 08:30:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:31,751 INFO L93 Difference]: Finished difference Result 3643 states and 5594 transitions. [2019-09-10 08:30:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:30:31,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:30:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:31,770 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:30:31,771 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:30:31,771 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:30:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:30:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:30:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:30:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5594 transitions. [2019-09-10 08:30:31,864 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5594 transitions. Word has length 97 [2019-09-10 08:30:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:31,864 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5594 transitions. [2019-09-10 08:30:31,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:30:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5594 transitions. [2019-09-10 08:30:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:30:31,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:31,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:31,866 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1467544083, now seen corresponding path program 1 times [2019-09-10 08:30:31,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:31,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:32,066 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:30:32,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:32,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:30:32,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:32,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:30:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:30:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:30:32,068 INFO L87 Difference]: Start difference. First operand 3643 states and 5594 transitions. Second operand 5 states. [2019-09-10 08:30:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:32,241 INFO L93 Difference]: Finished difference Result 3643 states and 5562 transitions. [2019-09-10 08:30:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:30:32,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:30:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:32,259 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:30:32,259 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:30:32,260 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:30:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:30:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:30:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:30:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5562 transitions. [2019-09-10 08:30:32,355 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5562 transitions. Word has length 97 [2019-09-10 08:30:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:32,356 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5562 transitions. [2019-09-10 08:30:32,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:30:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5562 transitions. [2019-09-10 08:30:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:30:32,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:32,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:32,358 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:32,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash -193676078, now seen corresponding path program 1 times [2019-09-10 08:30:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:32,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:32,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:32,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:32,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:32,499 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:30:32,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:32,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:30:32,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:32,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:30:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:30:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:30:32,501 INFO L87 Difference]: Start difference. First operand 3643 states and 5562 transitions. Second operand 5 states. [2019-09-10 08:30:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:32,657 INFO L93 Difference]: Finished difference Result 3643 states and 5530 transitions. [2019-09-10 08:30:32,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:30:32,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:30:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:32,675 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:30:32,676 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:30:32,678 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:30:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:30:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:30:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:30:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5530 transitions. [2019-09-10 08:30:32,760 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5530 transitions. Word has length 97 [2019-09-10 08:30:32,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:32,760 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5530 transitions. [2019-09-10 08:30:32,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:30:32,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5530 transitions. [2019-09-10 08:30:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:30:32,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:32,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:32,762 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1657747635, now seen corresponding path program 1 times [2019-09-10 08:30:32,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:32,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:32,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:32,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:32,934 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:30:32,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:32,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:30:32,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:32,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:30:32,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:30:32,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:30:32,936 INFO L87 Difference]: Start difference. First operand 3643 states and 5530 transitions. Second operand 5 states. [2019-09-10 08:30:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:33,091 INFO L93 Difference]: Finished difference Result 3643 states and 5498 transitions. [2019-09-10 08:30:33,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:30:33,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:30:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:33,108 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:30:33,108 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:30:33,109 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:30:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:30:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:30:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:30:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5498 transitions. [2019-09-10 08:30:33,170 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5498 transitions. Word has length 97 [2019-09-10 08:30:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:33,170 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5498 transitions. [2019-09-10 08:30:33,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:30:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5498 transitions. [2019-09-10 08:30:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:30:33,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:33,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:33,172 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1190190066, now seen corresponding path program 1 times [2019-09-10 08:30:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:33,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:33,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:33,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:33,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:33,291 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:30:33,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:33,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:30:33,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:33,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:30:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:30:33,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:30:33,292 INFO L87 Difference]: Start difference. First operand 3643 states and 5498 transitions. Second operand 5 states. [2019-09-10 08:30:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:33,436 INFO L93 Difference]: Finished difference Result 3643 states and 5466 transitions. [2019-09-10 08:30:33,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:30:33,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:30:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:33,452 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:30:33,453 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:30:33,454 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:30:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:30:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:30:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:30:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5466 transitions. [2019-09-10 08:30:33,517 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5466 transitions. Word has length 97 [2019-09-10 08:30:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:33,517 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5466 transitions. [2019-09-10 08:30:33,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:30:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5466 transitions. [2019-09-10 08:30:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:30:33,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:33,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:33,519 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:33,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1777392041, now seen corresponding path program 1 times [2019-09-10 08:30:33,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:33,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:33,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:33,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:33,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:33,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:33,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:33,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:33,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:33,801 INFO L87 Difference]: Start difference. First operand 3643 states and 5466 transitions. Second operand 9 states. [2019-09-10 08:30:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:34,479 INFO L93 Difference]: Finished difference Result 46675 states and 69606 transitions. [2019-09-10 08:30:34,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:30:34,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:30:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:34,590 INFO L225 Difference]: With dead ends: 46675 [2019-09-10 08:30:34,591 INFO L226 Difference]: Without dead ends: 46675 [2019-09-10 08:30:34,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:30:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46675 states. [2019-09-10 08:30:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46675 to 10811. [2019-09-10 08:30:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10811 states. [2019-09-10 08:30:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10811 states to 10811 states and 16154 transitions. [2019-09-10 08:30:35,030 INFO L78 Accepts]: Start accepts. Automaton has 10811 states and 16154 transitions. Word has length 97 [2019-09-10 08:30:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:35,031 INFO L475 AbstractCegarLoop]: Abstraction has 10811 states and 16154 transitions. [2019-09-10 08:30:35,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 10811 states and 16154 transitions. [2019-09-10 08:30:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:30:35,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:35,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:35,032 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:35,033 INFO L82 PathProgramCache]: Analyzing trace with hash 430043314, now seen corresponding path program 1 times [2019-09-10 08:30:35,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:35,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:35,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:35,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:35,129 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:30:35,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:35,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:35,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:35,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:35,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:35,131 INFO L87 Difference]: Start difference. First operand 10811 states and 16154 transitions. Second operand 3 states. [2019-09-10 08:30:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:35,198 INFO L93 Difference]: Finished difference Result 17277 states and 25307 transitions. [2019-09-10 08:30:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:35,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 08:30:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:35,232 INFO L225 Difference]: With dead ends: 17277 [2019-09-10 08:30:35,232 INFO L226 Difference]: Without dead ends: 17277 [2019-09-10 08:30:35,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2019-09-10 08:30:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 17147. [2019-09-10 08:30:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17147 states. [2019-09-10 08:30:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17147 states to 17147 states and 25178 transitions. [2019-09-10 08:30:35,528 INFO L78 Accepts]: Start accepts. Automaton has 17147 states and 25178 transitions. Word has length 99 [2019-09-10 08:30:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:35,528 INFO L475 AbstractCegarLoop]: Abstraction has 17147 states and 25178 transitions. [2019-09-10 08:30:35,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 17147 states and 25178 transitions. [2019-09-10 08:30:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:30:35,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:35,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:35,530 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash 450092657, now seen corresponding path program 1 times [2019-09-10 08:30:35,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:35,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:35,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:35,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:35,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:36,004 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:30:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:36,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:36,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:36,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:36,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:36,007 INFO L87 Difference]: Start difference. First operand 17147 states and 25178 transitions. Second operand 9 states. [2019-09-10 08:30:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:36,640 INFO L93 Difference]: Finished difference Result 30657 states and 44765 transitions. [2019-09-10 08:30:36,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:30:36,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:30:36,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:36,709 INFO L225 Difference]: With dead ends: 30657 [2019-09-10 08:30:36,709 INFO L226 Difference]: Without dead ends: 30657 [2019-09-10 08:30:36,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:30:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30657 states. [2019-09-10 08:30:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30657 to 30651. [2019-09-10 08:30:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30651 states. [2019-09-10 08:30:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30651 states to 30651 states and 44762 transitions. [2019-09-10 08:30:37,748 INFO L78 Accepts]: Start accepts. Automaton has 30651 states and 44762 transitions. Word has length 99 [2019-09-10 08:30:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:37,748 INFO L475 AbstractCegarLoop]: Abstraction has 30651 states and 44762 transitions. [2019-09-10 08:30:37,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30651 states and 44762 transitions. [2019-09-10 08:30:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:30:37,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:37,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:37,750 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1066061208, now seen corresponding path program 1 times [2019-09-10 08:30:37,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:37,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:37,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:37,860 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:30:37,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:37,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:30:37,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:37,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:30:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:30:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:30:37,862 INFO L87 Difference]: Start difference. First operand 30651 states and 44762 transitions. Second operand 5 states. [2019-09-10 08:30:38,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:38,186 INFO L93 Difference]: Finished difference Result 56188 states and 81416 transitions. [2019-09-10 08:30:38,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:30:38,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 08:30:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:38,306 INFO L225 Difference]: With dead ends: 56188 [2019-09-10 08:30:38,307 INFO L226 Difference]: Without dead ends: 56188 [2019-09-10 08:30:38,307 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:30:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56188 states. [2019-09-10 08:30:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56188 to 31419. [2019-09-10 08:30:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31419 states. [2019-09-10 08:30:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31419 states to 31419 states and 45466 transitions. [2019-09-10 08:30:38,822 INFO L78 Accepts]: Start accepts. Automaton has 31419 states and 45466 transitions. Word has length 100 [2019-09-10 08:30:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:38,823 INFO L475 AbstractCegarLoop]: Abstraction has 31419 states and 45466 transitions. [2019-09-10 08:30:38,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:30:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 31419 states and 45466 transitions. [2019-09-10 08:30:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:30:38,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:38,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:38,825 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2144763645, now seen corresponding path program 1 times [2019-09-10 08:30:38,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:38,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:38,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:38,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:38,895 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:30:38,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:38,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:30:38,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:38,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:30:38,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:30:38,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:30:38,899 INFO L87 Difference]: Start difference. First operand 31419 states and 45466 transitions. Second operand 3 states. [2019-09-10 08:30:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:39,214 INFO L93 Difference]: Finished difference Result 46783 states and 67389 transitions. [2019-09-10 08:30:39,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:30:39,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 08:30:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:39,267 INFO L225 Difference]: With dead ends: 46783 [2019-09-10 08:30:39,267 INFO L226 Difference]: Without dead ends: 46783 [2019-09-10 08:30:39,268 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:30:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46783 states. [2019-09-10 08:30:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46783 to 46781. [2019-09-10 08:30:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46781 states. [2019-09-10 08:30:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46781 states to 46781 states and 67388 transitions. [2019-09-10 08:30:41,026 INFO L78 Accepts]: Start accepts. Automaton has 46781 states and 67388 transitions. Word has length 100 [2019-09-10 08:30:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:41,026 INFO L475 AbstractCegarLoop]: Abstraction has 46781 states and 67388 transitions. [2019-09-10 08:30:41,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:30:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 46781 states and 67388 transitions. [2019-09-10 08:30:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:30:41,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:41,038 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:41,038 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1614271803, now seen corresponding path program 1 times [2019-09-10 08:30:41,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:41,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:41,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:41,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:41,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:41,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:41,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:30:41,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:30:41,246 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], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [179], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [412], [415], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:30:41,314 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:30:41,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:30:41,561 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:30:42,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:30:42,573 INFO L272 AbstractInterpreter]: Visited 122 different actions 974 times. Merged at 65 different actions 744 times. Widened at 26 different actions 105 times. Performed 3680 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3680 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 98 fixpoints after 23 different actions. Largest state had 175 variables. [2019-09-10 08:30:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:42,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:30:42,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:42,579 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:30:42,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:42,595 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:30:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:42,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:30:42,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:30:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:30:43,063 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:30:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:30:43,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:30:43,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:30:43,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:43,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:43,230 INFO L87 Difference]: Start difference. First operand 46781 states and 67388 transitions. Second operand 9 states. [2019-09-10 08:30:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:44,053 INFO L93 Difference]: Finished difference Result 236555 states and 339427 transitions. [2019-09-10 08:30:44,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:30:44,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:30:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:44,672 INFO L225 Difference]: With dead ends: 236555 [2019-09-10 08:30:44,672 INFO L226 Difference]: Without dead ends: 236555 [2019-09-10 08:30:44,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236555 states. [2019-09-10 08:30:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236555 to 76797. [2019-09-10 08:30:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76797 states. [2019-09-10 08:30:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76797 states to 76797 states and 110044 transitions. [2019-09-10 08:30:49,647 INFO L78 Accepts]: Start accepts. Automaton has 76797 states and 110044 transitions. Word has length 135 [2019-09-10 08:30:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:49,647 INFO L475 AbstractCegarLoop]: Abstraction has 76797 states and 110044 transitions. [2019-09-10 08:30:49,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 76797 states and 110044 transitions. [2019-09-10 08:30:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:30:49,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:49,662 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:49,663 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2110676875, now seen corresponding path program 1 times [2019-09-10 08:30:49,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:49,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:49,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:49,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:49,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:30:49,820 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:30:49,822 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], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [192], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [387], [390], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:30:49,834 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:30:49,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:30:49,894 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:30:50,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:30:50,788 INFO L272 AbstractInterpreter]: Visited 122 different actions 1030 times. Merged at 63 different actions 789 times. Widened at 26 different actions 125 times. Performed 3779 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3779 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 95 fixpoints after 18 different actions. Largest state had 175 variables. [2019-09-10 08:30:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:50,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:30:50,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:50,789 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:30:50,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:50,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:30:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:50,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:30:50,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:30:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:30:51,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:30:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:30:51,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:30:51,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:30:51,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:51,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:51,308 INFO L87 Difference]: Start difference. First operand 76797 states and 110044 transitions. Second operand 9 states. [2019-09-10 08:30:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:52,184 INFO L93 Difference]: Finished difference Result 156427 states and 223779 transitions. [2019-09-10 08:30:52,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:30:52,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:30:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:52,385 INFO L225 Difference]: With dead ends: 156427 [2019-09-10 08:30:52,385 INFO L226 Difference]: Without dead ends: 156427 [2019-09-10 08:30:52,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156427 states. [2019-09-10 08:30:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156427 to 96701. [2019-09-10 08:30:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96701 states. [2019-09-10 08:30:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96701 states to 96701 states and 138332 transitions. [2019-09-10 08:30:55,431 INFO L78 Accepts]: Start accepts. Automaton has 96701 states and 138332 transitions. Word has length 135 [2019-09-10 08:30:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:55,431 INFO L475 AbstractCegarLoop]: Abstraction has 96701 states and 138332 transitions. [2019-09-10 08:30:55,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 96701 states and 138332 transitions. [2019-09-10 08:30:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:30:55,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:55,448 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:55,448 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1788947165, now seen corresponding path program 1 times [2019-09-10 08:30:55,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:55,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:55,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:55,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:55,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:55,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:55,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:30:55,570 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:30:55,570 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [231], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [312], [315], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:30:55,583 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:30:55,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:30:55,615 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:30:56,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:30:56,384 INFO L272 AbstractInterpreter]: Visited 122 different actions 1028 times. Merged at 65 different actions 790 times. Widened at 28 different actions 151 times. Performed 3808 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3808 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 96 fixpoints after 26 different actions. Largest state had 175 variables. [2019-09-10 08:30:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:56,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:30:56,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:56,385 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:30:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:56,408 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:30:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:56,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:30:56,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:30:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:30:56,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:30:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:30:56,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:30:56,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:30:56,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:56,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:56,907 INFO L87 Difference]: Start difference. First operand 96701 states and 138332 transitions. Second operand 9 states. [2019-09-10 08:30:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:57,367 INFO L93 Difference]: Finished difference Result 176331 states and 252067 transitions. [2019-09-10 08:30:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:30:57,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:30:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:57,876 INFO L225 Difference]: With dead ends: 176331 [2019-09-10 08:30:57,876 INFO L226 Difference]: Without dead ends: 176331 [2019-09-10 08:30:57,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176331 states. [2019-09-10 08:31:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176331 to 116605. [2019-09-10 08:31:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116605 states. [2019-09-10 08:31:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116605 states to 116605 states and 166620 transitions. [2019-09-10 08:31:01,630 INFO L78 Accepts]: Start accepts. Automaton has 116605 states and 166620 transitions. Word has length 135 [2019-09-10 08:31:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:01,631 INFO L475 AbstractCegarLoop]: Abstraction has 116605 states and 166620 transitions. [2019-09-10 08:31:01,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 116605 states and 166620 transitions. [2019-09-10 08:31:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:31:01,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:01,648 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:01,648 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:01,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1812692387, now seen corresponding path program 1 times [2019-09-10 08:31:01,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:01,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:01,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:01,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:01,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:31:01,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:31:01,783 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], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [244], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [287], [290], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:31:01,785 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:31:01,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:31:01,815 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:31:02,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:31:02,436 INFO L272 AbstractInterpreter]: Visited 122 different actions 983 times. Merged at 65 different actions 752 times. Widened at 27 different actions 109 times. Performed 3524 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3524 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 90 fixpoints after 25 different actions. Largest state had 175 variables. [2019-09-10 08:31:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:02,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:31:02,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:02,437 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:31:02,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:02,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:31:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:02,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:31:02,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:31:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:31:02,780 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:31:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:31:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:31:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:31:02,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:02,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:31:02,924 INFO L87 Difference]: Start difference. First operand 116605 states and 166620 transitions. Second operand 9 states. [2019-09-10 08:31:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:03,444 INFO L93 Difference]: Finished difference Result 196233 states and 280354 transitions. [2019-09-10 08:31:03,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:31:03,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:31:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:03,640 INFO L225 Difference]: With dead ends: 196233 [2019-09-10 08:31:03,641 INFO L226 Difference]: Without dead ends: 196233 [2019-09-10 08:31:03,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:31:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196233 states. [2019-09-10 08:31:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196233 to 136509. [2019-09-10 08:31:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136509 states. [2019-09-10 08:31:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136509 states to 136509 states and 194908 transitions. [2019-09-10 08:31:05,413 INFO L78 Accepts]: Start accepts. Automaton has 136509 states and 194908 transitions. Word has length 135 [2019-09-10 08:31:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:05,414 INFO L475 AbstractCegarLoop]: Abstraction has 136509 states and 194908 transitions. [2019-09-10 08:31:05,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 136509 states and 194908 transitions. [2019-09-10 08:31:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:31:05,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:05,428 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:05,428 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:05,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:05,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1416421271, now seen corresponding path program 1 times [2019-09-10 08:31:05,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:05,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:06,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:06,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:31:06,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:31:06,002 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], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [197], [199], [202], [210], [212], [215], [218], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [337], [340], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:31:06,006 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:31:06,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:31:06,035 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:31:06,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:31:06,619 INFO L272 AbstractInterpreter]: Visited 122 different actions 937 times. Merged at 65 different actions 712 times. Widened at 26 different actions 111 times. Performed 3434 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3434 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 88 fixpoints after 22 different actions. Largest state had 175 variables. [2019-09-10 08:31:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:06,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:31:06,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:06,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:31:06,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:06,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:31:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:06,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:31:06,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:31:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:31:06,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:31:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:31:07,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:31:07,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:31:07,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:07,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:07,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:31:07,114 INFO L87 Difference]: Start difference. First operand 136509 states and 194908 transitions. Second operand 9 states. [2019-09-10 08:31:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:07,811 INFO L93 Difference]: Finished difference Result 216139 states and 308643 transitions. [2019-09-10 08:31:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:31:07,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:31:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:08,046 INFO L225 Difference]: With dead ends: 216139 [2019-09-10 08:31:08,046 INFO L226 Difference]: Without dead ends: 216139 [2019-09-10 08:31:08,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:31:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216139 states. [2019-09-10 08:31:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216139 to 156413. [2019-09-10 08:31:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156413 states. [2019-09-10 08:31:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156413 states to 156413 states and 223196 transitions. [2019-09-10 08:31:10,288 INFO L78 Accepts]: Start accepts. Automaton has 156413 states and 223196 transitions. Word has length 135 [2019-09-10 08:31:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:10,288 INFO L475 AbstractCegarLoop]: Abstraction has 156413 states and 223196 transitions. [2019-09-10 08:31:10,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 156413 states and 223196 transitions. [2019-09-10 08:31:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:31:10,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:10,302 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,302 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash -495936559, now seen corresponding path program 1 times [2019-09-10 08:31:10,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:10,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:10,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:10,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:10,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:10,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:10,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:31:10,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:31:10,419 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], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [197], [199], [202], [205], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [362], [365], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:31:10,421 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:31:10,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:31:10,451 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:31:14,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:31:14,357 INFO L272 AbstractInterpreter]: Visited 122 different actions 1017 times. Merged at 65 different actions 781 times. Widened at 28 different actions 136 times. Performed 3783 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3783 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 99 fixpoints after 21 different actions. Largest state had 175 variables. [2019-09-10 08:31:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:14,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:31:14,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:14,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:31:14,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:14,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:31:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:14,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:31:14,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:31:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:31:14,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:31:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:31:14,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:31:14,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:31:14,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:14,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:31:14,791 INFO L87 Difference]: Start difference. First operand 156413 states and 223196 transitions. Second operand 9 states. [2019-09-10 08:31:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:15,362 INFO L93 Difference]: Finished difference Result 236043 states and 336931 transitions. [2019-09-10 08:31:15,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:31:15,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:31:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:15,613 INFO L225 Difference]: With dead ends: 236043 [2019-09-10 08:31:15,613 INFO L226 Difference]: Without dead ends: 236043 [2019-09-10 08:31:15,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:31:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236043 states. [2019-09-10 08:31:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236043 to 176317. [2019-09-10 08:31:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176317 states. [2019-09-10 08:31:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176317 states to 176317 states and 251484 transitions. [2019-09-10 08:31:17,650 INFO L78 Accepts]: Start accepts. Automaton has 176317 states and 251484 transitions. Word has length 135 [2019-09-10 08:31:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:17,651 INFO L475 AbstractCegarLoop]: Abstraction has 176317 states and 251484 transitions. [2019-09-10 08:31:17,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 176317 states and 251484 transitions. [2019-09-10 08:31:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:31:17,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:17,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:17,667 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:17,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1796801820, now seen corresponding path program 1 times [2019-09-10 08:31:17,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:17,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:17,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:17,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:17,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:31:17,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:17,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:17,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:17,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:17,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:17,860 INFO L87 Difference]: Start difference. First operand 176317 states and 251484 transitions. Second operand 9 states. [2019-09-10 08:31:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:19,237 INFO L93 Difference]: Finished difference Result 276747 states and 396707 transitions. [2019-09-10 08:31:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:31:19,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:31:19,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:19,509 INFO L225 Difference]: With dead ends: 276747 [2019-09-10 08:31:19,509 INFO L226 Difference]: Without dead ends: 276747 [2019-09-10 08:31:19,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:31:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276747 states. [2019-09-10 08:31:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276747 to 183101. [2019-09-10 08:31:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183101 states. [2019-09-10 08:31:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183101 states to 183101 states and 261340 transitions. [2019-09-10 08:31:22,186 INFO L78 Accepts]: Start accepts. Automaton has 183101 states and 261340 transitions. Word has length 136 [2019-09-10 08:31:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:22,186 INFO L475 AbstractCegarLoop]: Abstraction has 183101 states and 261340 transitions. [2019-09-10 08:31:22,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 183101 states and 261340 transitions. [2019-09-10 08:31:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:31:22,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:22,200 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:22,201 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash 658413086, now seen corresponding path program 1 times [2019-09-10 08:31:22,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:22,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:22,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:22,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:22,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:22,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:31:22,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:22,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:31:22,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:31:22,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:31:22,289 INFO L87 Difference]: Start difference. First operand 183101 states and 261340 transitions. Second operand 3 states. [2019-09-10 08:31:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:22,535 INFO L93 Difference]: Finished difference Result 129009 states and 184504 transitions. [2019-09-10 08:31:22,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:31:22,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-10 08:31:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:22,654 INFO L225 Difference]: With dead ends: 129009 [2019-09-10 08:31:22,655 INFO L226 Difference]: Without dead ends: 129009 [2019-09-10 08:31:22,655 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:31:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129009 states. [2019-09-10 08:31:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129009 to 129007. [2019-09-10 08:31:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129007 states. [2019-09-10 08:31:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129007 states to 129007 states and 184503 transitions. [2019-09-10 08:31:27,452 INFO L78 Accepts]: Start accepts. Automaton has 129007 states and 184503 transitions. Word has length 137 [2019-09-10 08:31:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:27,453 INFO L475 AbstractCegarLoop]: Abstraction has 129007 states and 184503 transitions. [2019-09-10 08:31:27,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:31:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 129007 states and 184503 transitions. [2019-09-10 08:31:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:31:27,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:27,463 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:27,463 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash -99959780, now seen corresponding path program 1 times [2019-09-10 08:31:27,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:27,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:27,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:27,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:27,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:31:27,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-09-10 08:31:27,728 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], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [158], [163], [171], [173], [176], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [257], [261], [263], [266], [267], [269], [271], [276], [278], [281], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [444], [446], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:31:27,744 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:31:27,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:31:27,772 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:31:28,595 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:31:28,595 INFO L272 AbstractInterpreter]: Visited 127 different actions 1283 times. Merged at 69 different actions 997 times. Widened at 30 different actions 167 times. Performed 4516 root evaluator evaluations with a maximum evaluation depth of 9. Performed 4516 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 165 fixpoints after 26 different actions. Largest state had 175 variables. [2019-09-10 08:31:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:28,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:31:28,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:28,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:31:28,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:28,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:31:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:28,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:31:28,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:31:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:31:28,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:31:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:31:29,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:31:29,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 08:31:29,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:31:29,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:31:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:31:29,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:31:29,005 INFO L87 Difference]: Start difference. First operand 129007 states and 184503 transitions. Second operand 12 states. [2019-09-10 08:31:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:34,985 INFO L93 Difference]: Finished difference Result 788456 states and 1098420 transitions. [2019-09-10 08:31:34,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 08:31:34,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-09-10 08:31:34,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:35,837 INFO L225 Difference]: With dead ends: 788456 [2019-09-10 08:31:35,837 INFO L226 Difference]: Without dead ends: 788456 [2019-09-10 08:31:35,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:31:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788456 states. [2019-09-10 08:31:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788456 to 356797. [2019-09-10 08:31:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356797 states. [2019-09-10 08:31:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356797 states to 356797 states and 497997 transitions. [2019-09-10 08:31:45,765 INFO L78 Accepts]: Start accepts. Automaton has 356797 states and 497997 transitions. Word has length 137 [2019-09-10 08:31:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:45,765 INFO L475 AbstractCegarLoop]: Abstraction has 356797 states and 497997 transitions. [2019-09-10 08:31:45,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:31:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 356797 states and 497997 transitions. [2019-09-10 08:31:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:31:45,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:45,772 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, 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:31:45,772 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2084830737, now seen corresponding path program 1 times [2019-09-10 08:31:45,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:45,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:45,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:45,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:45,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:47,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:47,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:31:47,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2019-09-10 08:31:47,009 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], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [158], [163], [166], [171], [173], [176], [179], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [412], [415], [421], [424], [427], [429], [437], [440], [446], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:31:47,011 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:31:47,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:31:47,038 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:31:47,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:31:47,948 INFO L272 AbstractInterpreter]: Visited 129 different actions 1313 times. Merged at 72 different actions 1032 times. Widened at 28 different actions 152 times. Performed 4638 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4638 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 134 fixpoints after 26 different actions. Largest state had 175 variables. [2019-09-10 08:31:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:47,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:31:47,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:31:47,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:31:47,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:47,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:31:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:48,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:31:48,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:31:48,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:48,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:31:48,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:31:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:31:48,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:31:48,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:31:48,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:31:48,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:31:48,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:31:48,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:31:48,861 INFO L87 Difference]: Start difference. First operand 356797 states and 497997 transitions. Second operand 17 states. [2019-09-10 08:32:00,237 WARN L188 SmtUtils]: Spent 3.51 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-10 08:32:13,276 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-09-10 08:32:19,452 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:32:19,889 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:32:21,054 WARN L188 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 08:32:21,222 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:33:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:38,283 INFO L93 Difference]: Finished difference Result 8162178 states and 11269970 transitions. [2019-09-10 08:33:38,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2019-09-10 08:33:38,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 138 [2019-09-10 08:33:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:52,339 INFO L225 Difference]: With dead ends: 8162178 [2019-09-10 08:33:52,340 INFO L226 Difference]: Without dead ends: 8162178 [2019-09-10 08:33:52,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37942 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=10336, Invalid=75806, Unknown=0, NotChecked=0, Total=86142 [2019-09-10 08:33:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8162178 states.