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.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:58:59,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:58:59,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:58:59,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:58:59,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:58:59,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:58:59,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:58:59,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:58:59,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:58:59,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:58:59,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:58:59,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:58:59,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:58:59,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:58:59,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:58:59,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:58:59,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:58:59,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:58:59,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:58:59,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:58:59,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:58:59,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:58:59,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:58:59,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:58:59,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:58:59,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:58:59,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:58:59,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:58:59,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:58:59,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:58:59,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:58:59,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:58:59,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:58:59,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:58:59,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:58:59,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:58:59,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:58:59,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:58:59,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:58:59,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:58:59,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:58:59,254 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 07:58:59,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:58:59,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:58:59,270 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:58:59,271 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:58:59,271 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:58:59,271 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:58:59,272 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:58:59,272 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:58:59,272 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:58:59,272 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:58:59,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:58:59,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:58:59,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:58:59,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:58:59,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:58:59,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:58:59,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:58:59,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:58:59,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:58:59,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:58:59,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:58:59,275 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:58:59,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:58:59,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:58:59,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:58:59,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:58:59,276 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:58:59,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:58:59,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:58:59,277 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:58:59,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:58:59,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:58:59,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:58:59,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:58:59,323 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:58:59,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 07:58:59,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7f8b873/a8bee63b3daa4a8d9d47236c2fa52a76/FLAG6b3fa0a14 [2019-09-10 07:58:59,938 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:58:59,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 07:58:59,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7f8b873/a8bee63b3daa4a8d9d47236c2fa52a76/FLAG6b3fa0a14 [2019-09-10 07:59:00,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7f8b873/a8bee63b3daa4a8d9d47236c2fa52a76 [2019-09-10 07:59:00,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:59:00,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:59:00,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:59:00,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:59:00,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:59:00,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:59:00" (1/1) ... [2019-09-10 07:59:00,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c490221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:00, skipping insertion in model container [2019-09-10 07:59:00,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:59:00" (1/1) ... [2019-09-10 07:59:00,257 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:59:00,334 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:59:00,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:59:00,857 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:59:01,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:59:01,025 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:59:01,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01 WrapperNode [2019-09-10 07:59:01,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:59:01,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:59:01,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:59:01,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:59:01,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (1/1) ... [2019-09-10 07:59:01,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (1/1) ... [2019-09-10 07:59:01,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (1/1) ... [2019-09-10 07:59:01,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (1/1) ... [2019-09-10 07:59:01,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (1/1) ... [2019-09-10 07:59:01,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (1/1) ... [2019-09-10 07:59:01,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (1/1) ... [2019-09-10 07:59:01,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:59:01,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:59:01,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:59:01,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:59:01,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (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 07:59:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:59:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:59:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:59:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:59:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:59:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:59:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:59:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:59:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:59:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:59:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:59:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:59:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:59:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:59:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:59:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:59:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:59:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:59:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:59:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:59:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:59:02,810 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:59:02,810 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:59:02,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:59:02 BoogieIcfgContainer [2019-09-10 07:59:02,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:59:02,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:59:02,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:59:02,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:59:02,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:59:00" (1/3) ... [2019-09-10 07:59:02,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20106d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:59:02, skipping insertion in model container [2019-09-10 07:59:02,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:59:01" (2/3) ... [2019-09-10 07:59:02,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20106d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:59:02, skipping insertion in model container [2019-09-10 07:59:02,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:59:02" (3/3) ... [2019-09-10 07:59:02,827 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 07:59:02,840 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:59:02,851 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:59:02,871 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:59:02,898 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:59:02,898 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:59:02,898 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:59:02,899 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:59:02,899 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:59:02,899 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:59:02,899 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:59:02,900 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:59:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states. [2019-09-10 07:59:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:59:02,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:02,978 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, 1, 1, 1, 1, 1, 1, 1, 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 07:59:02,981 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:02,988 INFO L82 PathProgramCache]: Analyzing trace with hash -764838600, now seen corresponding path program 1 times [2019-09-10 07:59:02,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:03,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:03,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:03,437 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 07:59:03,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:03,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:59:03,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:03,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:59:03,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:59:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:59:03,468 INFO L87 Difference]: Start difference. First operand 341 states. Second operand 4 states. [2019-09-10 07:59:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:03,618 INFO L93 Difference]: Finished difference Result 345 states and 560 transitions. [2019-09-10 07:59:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:03,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-10 07:59:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:03,650 INFO L225 Difference]: With dead ends: 345 [2019-09-10 07:59:03,651 INFO L226 Difference]: Without dead ends: 337 [2019-09-10 07:59:03,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-10 07:59:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-09-10 07:59:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-10 07:59:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 517 transitions. [2019-09-10 07:59:03,759 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 517 transitions. Word has length 131 [2019-09-10 07:59:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:03,760 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 517 transitions. [2019-09-10 07:59:03,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:59:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 517 transitions. [2019-09-10 07:59:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 07:59:03,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:03,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:03,769 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:03,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1652103946, now seen corresponding path program 1 times [2019-09-10 07:59:03,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:03,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:03,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:03,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:04,103 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 07:59:04,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:04,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:04,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:04,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:04,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:04,107 INFO L87 Difference]: Start difference. First operand 337 states and 517 transitions. Second operand 3 states. [2019-09-10 07:59:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:04,171 INFO L93 Difference]: Finished difference Result 527 states and 816 transitions. [2019-09-10 07:59:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:04,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 07:59:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:04,176 INFO L225 Difference]: With dead ends: 527 [2019-09-10 07:59:04,176 INFO L226 Difference]: Without dead ends: 527 [2019-09-10 07:59:04,177 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 07:59:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-10 07:59:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2019-09-10 07:59:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-10 07:59:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 815 transitions. [2019-09-10 07:59:04,201 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 815 transitions. Word has length 161 [2019-09-10 07:59:04,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:04,204 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 815 transitions. [2019-09-10 07:59:04,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 815 transitions. [2019-09-10 07:59:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 07:59:04,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:04,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:04,210 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash 661220252, now seen corresponding path program 1 times [2019-09-10 07:59:04,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:04,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:04,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:04,341 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 07:59:04,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:04,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:04,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:04,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:04,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:04,347 INFO L87 Difference]: Start difference. First operand 525 states and 815 transitions. Second operand 3 states. [2019-09-10 07:59:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:04,424 INFO L93 Difference]: Finished difference Result 863 states and 1346 transitions. [2019-09-10 07:59:04,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:04,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-10 07:59:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:04,435 INFO L225 Difference]: With dead ends: 863 [2019-09-10 07:59:04,436 INFO L226 Difference]: Without dead ends: 863 [2019-09-10 07:59:04,436 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 07:59:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-10 07:59:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2019-09-10 07:59:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-09-10 07:59:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1345 transitions. [2019-09-10 07:59:04,480 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1345 transitions. Word has length 164 [2019-09-10 07:59:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:04,481 INFO L475 AbstractCegarLoop]: Abstraction has 861 states and 1345 transitions. [2019-09-10 07:59:04,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1345 transitions. [2019-09-10 07:59:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 07:59:04,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:04,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:04,491 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -319418727, now seen corresponding path program 1 times [2019-09-10 07:59:04,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:04,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:04,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:04,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:04,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:04,655 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 07:59:04,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:04,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:04,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:04,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:04,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:04,658 INFO L87 Difference]: Start difference. First operand 861 states and 1345 transitions. Second operand 3 states. [2019-09-10 07:59:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:04,753 INFO L93 Difference]: Finished difference Result 1451 states and 2266 transitions. [2019-09-10 07:59:04,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:04,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 07:59:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:04,766 INFO L225 Difference]: With dead ends: 1451 [2019-09-10 07:59:04,766 INFO L226 Difference]: Without dead ends: 1451 [2019-09-10 07:59:04,767 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 07:59:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-09-10 07:59:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2019-09-10 07:59:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-09-10 07:59:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2265 transitions. [2019-09-10 07:59:04,804 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2265 transitions. Word has length 167 [2019-09-10 07:59:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:04,806 INFO L475 AbstractCegarLoop]: Abstraction has 1449 states and 2265 transitions. [2019-09-10 07:59:04,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2265 transitions. [2019-09-10 07:59:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 07:59:04,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:04,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:04,812 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash 853998267, now seen corresponding path program 1 times [2019-09-10 07:59:04,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:04,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:04,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:04,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:04,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:04,938 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 07:59:04,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:04,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:04,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:04,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:04,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:04,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:04,941 INFO L87 Difference]: Start difference. First operand 1449 states and 2265 transitions. Second operand 3 states. [2019-09-10 07:59:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:05,020 INFO L93 Difference]: Finished difference Result 2455 states and 3818 transitions. [2019-09-10 07:59:05,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:05,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 07:59:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:05,034 INFO L225 Difference]: With dead ends: 2455 [2019-09-10 07:59:05,035 INFO L226 Difference]: Without dead ends: 2455 [2019-09-10 07:59:05,035 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 07:59:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2019-09-10 07:59:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2453. [2019-09-10 07:59:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2453 states. [2019-09-10 07:59:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3817 transitions. [2019-09-10 07:59:05,113 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3817 transitions. Word has length 170 [2019-09-10 07:59:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:05,113 INFO L475 AbstractCegarLoop]: Abstraction has 2453 states and 3817 transitions. [2019-09-10 07:59:05,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3817 transitions. [2019-09-10 07:59:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 07:59:05,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:05,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:05,122 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:05,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:05,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1199310348, now seen corresponding path program 1 times [2019-09-10 07:59:05,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:05,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:05,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:05,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:05,268 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 07:59:05,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:05,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:05,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:05,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:05,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:05,272 INFO L87 Difference]: Start difference. First operand 2453 states and 3817 transitions. Second operand 3 states. [2019-09-10 07:59:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:05,904 INFO L93 Difference]: Finished difference Result 4809 states and 7432 transitions. [2019-09-10 07:59:05,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:05,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 07:59:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:05,932 INFO L225 Difference]: With dead ends: 4809 [2019-09-10 07:59:05,932 INFO L226 Difference]: Without dead ends: 4809 [2019-09-10 07:59:05,933 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 07:59:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2019-09-10 07:59:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4807. [2019-09-10 07:59:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4807 states. [2019-09-10 07:59:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 7431 transitions. [2019-09-10 07:59:06,073 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 7431 transitions. Word has length 173 [2019-09-10 07:59:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:06,074 INFO L475 AbstractCegarLoop]: Abstraction has 4807 states and 7431 transitions. [2019-09-10 07:59:06,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 7431 transitions. [2019-09-10 07:59:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 07:59:06,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:06,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:06,088 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:06,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash -104621536, now seen corresponding path program 1 times [2019-09-10 07:59:06,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:06,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:06,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:06,191 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 07:59:06,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:06,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:06,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:06,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:06,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:06,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:06,193 INFO L87 Difference]: Start difference. First operand 4807 states and 7431 transitions. Second operand 3 states. [2019-09-10 07:59:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:06,733 INFO L93 Difference]: Finished difference Result 9454 states and 14551 transitions. [2019-09-10 07:59:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:06,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 07:59:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:06,802 INFO L225 Difference]: With dead ends: 9454 [2019-09-10 07:59:06,803 INFO L226 Difference]: Without dead ends: 9454 [2019-09-10 07:59:06,803 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 07:59:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9454 states. [2019-09-10 07:59:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9454 to 9452. [2019-09-10 07:59:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-09-10 07:59:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 14550 transitions. [2019-09-10 07:59:07,089 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 14550 transitions. Word has length 173 [2019-09-10 07:59:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:07,089 INFO L475 AbstractCegarLoop]: Abstraction has 9452 states and 14550 transitions. [2019-09-10 07:59:07,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 14550 transitions. [2019-09-10 07:59:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 07:59:07,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:07,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:07,113 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash -721775360, now seen corresponding path program 1 times [2019-09-10 07:59:07,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:07,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:07,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:07,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:07,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:07,280 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 07:59:07,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:07,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:07,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:07,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:07,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:07,282 INFO L87 Difference]: Start difference. First operand 9452 states and 14550 transitions. Second operand 5 states. [2019-09-10 07:59:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:07,677 INFO L93 Difference]: Finished difference Result 9452 states and 14448 transitions. [2019-09-10 07:59:07,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:07,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-09-10 07:59:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:07,731 INFO L225 Difference]: With dead ends: 9452 [2019-09-10 07:59:07,731 INFO L226 Difference]: Without dead ends: 9452 [2019-09-10 07:59:07,732 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 07:59:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2019-09-10 07:59:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9452. [2019-09-10 07:59:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-09-10 07:59:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 14448 transitions. [2019-09-10 07:59:07,879 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 14448 transitions. Word has length 173 [2019-09-10 07:59:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:07,879 INFO L475 AbstractCegarLoop]: Abstraction has 9452 states and 14448 transitions. [2019-09-10 07:59:07,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 14448 transitions. [2019-09-10 07:59:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 07:59:07,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:07,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:07,905 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:07,905 INFO L82 PathProgramCache]: Analyzing trace with hash -10142673, now seen corresponding path program 1 times [2019-09-10 07:59:07,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:07,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:07,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:07,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:08,093 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 07:59:08,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:08,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:08,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:08,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:08,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:08,095 INFO L87 Difference]: Start difference. First operand 9452 states and 14448 transitions. Second operand 5 states. [2019-09-10 07:59:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:08,401 INFO L93 Difference]: Finished difference Result 9452 states and 14334 transitions. [2019-09-10 07:59:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:08,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-09-10 07:59:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:08,425 INFO L225 Difference]: With dead ends: 9452 [2019-09-10 07:59:08,426 INFO L226 Difference]: Without dead ends: 9452 [2019-09-10 07:59:08,426 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 07:59:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2019-09-10 07:59:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9452. [2019-09-10 07:59:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-09-10 07:59:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 14334 transitions. [2019-09-10 07:59:08,561 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 14334 transitions. Word has length 173 [2019-09-10 07:59:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:08,561 INFO L475 AbstractCegarLoop]: Abstraction has 9452 states and 14334 transitions. [2019-09-10 07:59:08,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 14334 transitions. [2019-09-10 07:59:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 07:59:08,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:08,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:08,587 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1755429004, now seen corresponding path program 1 times [2019-09-10 07:59:08,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:08,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:08,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:08,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 07:59:08,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:08,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:08,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:08,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:08,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:08,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:08,802 INFO L87 Difference]: Start difference. First operand 9452 states and 14334 transitions. Second operand 5 states. [2019-09-10 07:59:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:09,102 INFO L93 Difference]: Finished difference Result 4807 states and 7255 transitions. [2019-09-10 07:59:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:09,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-09-10 07:59:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:09,112 INFO L225 Difference]: With dead ends: 4807 [2019-09-10 07:59:09,112 INFO L226 Difference]: Without dead ends: 4807 [2019-09-10 07:59:09,113 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 07:59:09,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2019-09-10 07:59:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4807. [2019-09-10 07:59:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4807 states. [2019-09-10 07:59:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 7255 transitions. [2019-09-10 07:59:09,190 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 7255 transitions. Word has length 173 [2019-09-10 07:59:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:09,190 INFO L475 AbstractCegarLoop]: Abstraction has 4807 states and 7255 transitions. [2019-09-10 07:59:09,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 7255 transitions. [2019-09-10 07:59:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 07:59:09,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:09,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:09,202 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1314223281, now seen corresponding path program 1 times [2019-09-10 07:59:09,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:09,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:09,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:09,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:09,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:09,316 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 07:59:09,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:09,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:09,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:09,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:09,318 INFO L87 Difference]: Start difference. First operand 4807 states and 7255 transitions. Second operand 3 states. [2019-09-10 07:59:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:09,358 INFO L93 Difference]: Finished difference Result 3185 states and 4760 transitions. [2019-09-10 07:59:09,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:09,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 07:59:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:09,367 INFO L225 Difference]: With dead ends: 3185 [2019-09-10 07:59:09,367 INFO L226 Difference]: Without dead ends: 3185 [2019-09-10 07:59:09,367 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 07:59:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2019-09-10 07:59:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3183. [2019-09-10 07:59:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-09-10 07:59:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4759 transitions. [2019-09-10 07:59:09,413 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4759 transitions. Word has length 173 [2019-09-10 07:59:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:09,413 INFO L475 AbstractCegarLoop]: Abstraction has 3183 states and 4759 transitions. [2019-09-10 07:59:09,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4759 transitions. [2019-09-10 07:59:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 07:59:09,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:09,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:09,419 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash -598513902, now seen corresponding path program 1 times [2019-09-10 07:59:09,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:09,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:09,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:09,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:09,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:09,611 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 07:59:09,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:09,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:59:09,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:09,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:59:09,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:59:09,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:59:09,613 INFO L87 Difference]: Start difference. First operand 3183 states and 4759 transitions. Second operand 7 states. [2019-09-10 07:59:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:10,390 INFO L93 Difference]: Finished difference Result 28087 states and 41391 transitions. [2019-09-10 07:59:10,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:59:10,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2019-09-10 07:59:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:10,439 INFO L225 Difference]: With dead ends: 28087 [2019-09-10 07:59:10,440 INFO L226 Difference]: Without dead ends: 28087 [2019-09-10 07:59:10,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:59:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28087 states. [2019-09-10 07:59:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28087 to 6274. [2019-09-10 07:59:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6274 states. [2019-09-10 07:59:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6274 states to 6274 states and 9241 transitions. [2019-09-10 07:59:10,714 INFO L78 Accepts]: Start accepts. Automaton has 6274 states and 9241 transitions. Word has length 173 [2019-09-10 07:59:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:10,715 INFO L475 AbstractCegarLoop]: Abstraction has 6274 states and 9241 transitions. [2019-09-10 07:59:10,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:59:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 6274 states and 9241 transitions. [2019-09-10 07:59:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 07:59:10,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:10,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:10,724 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:10,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1330820116, now seen corresponding path program 1 times [2019-09-10 07:59:10,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:10,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:10,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:10,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:10,815 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 07:59:10,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:10,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:10,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:10,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:10,817 INFO L87 Difference]: Start difference. First operand 6274 states and 9241 transitions. Second operand 3 states. [2019-09-10 07:59:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:10,893 INFO L93 Difference]: Finished difference Result 11069 states and 16145 transitions. [2019-09-10 07:59:10,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:10,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 07:59:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:10,918 INFO L225 Difference]: With dead ends: 11069 [2019-09-10 07:59:10,918 INFO L226 Difference]: Without dead ends: 11069 [2019-09-10 07:59:10,919 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 07:59:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11069 states. [2019-09-10 07:59:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11069 to 11067. [2019-09-10 07:59:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11067 states. [2019-09-10 07:59:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11067 states to 11067 states and 16144 transitions. [2019-09-10 07:59:11,136 INFO L78 Accepts]: Start accepts. Automaton has 11067 states and 16144 transitions. Word has length 176 [2019-09-10 07:59:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:11,136 INFO L475 AbstractCegarLoop]: Abstraction has 11067 states and 16144 transitions. [2019-09-10 07:59:11,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 11067 states and 16144 transitions. [2019-09-10 07:59:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 07:59:11,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:11,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:11,152 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1768584770, now seen corresponding path program 1 times [2019-09-10 07:59:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:11,300 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 07:59:11,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:11,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:11,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:11,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:11,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:11,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:11,303 INFO L87 Difference]: Start difference. First operand 11067 states and 16144 transitions. Second operand 3 states. [2019-09-10 07:59:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:11,348 INFO L93 Difference]: Finished difference Result 5610 states and 8102 transitions. [2019-09-10 07:59:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:11,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-10 07:59:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:11,358 INFO L225 Difference]: With dead ends: 5610 [2019-09-10 07:59:11,359 INFO L226 Difference]: Without dead ends: 5610 [2019-09-10 07:59:11,360 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 07:59:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2019-09-10 07:59:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5608. [2019-09-10 07:59:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5608 states. [2019-09-10 07:59:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 8101 transitions. [2019-09-10 07:59:11,439 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 8101 transitions. Word has length 177 [2019-09-10 07:59:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:11,440 INFO L475 AbstractCegarLoop]: Abstraction has 5608 states and 8101 transitions. [2019-09-10 07:59:11,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 8101 transitions. [2019-09-10 07:59:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 07:59:11,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:11,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:11,452 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1886201092, now seen corresponding path program 1 times [2019-09-10 07:59:11,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:11,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:11,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:11,573 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 07:59:11,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:11,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:11,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:11,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:11,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:11,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:11,574 INFO L87 Difference]: Start difference. First operand 5608 states and 8101 transitions. Second operand 3 states. [2019-09-10 07:59:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:11,614 INFO L93 Difference]: Finished difference Result 2922 states and 4174 transitions. [2019-09-10 07:59:11,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:11,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 07:59:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:11,619 INFO L225 Difference]: With dead ends: 2922 [2019-09-10 07:59:11,620 INFO L226 Difference]: Without dead ends: 2922 [2019-09-10 07:59:11,622 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 07:59:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2019-09-10 07:59:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2920. [2019-09-10 07:59:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-09-10 07:59:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4173 transitions. [2019-09-10 07:59:11,659 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4173 transitions. Word has length 179 [2019-09-10 07:59:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:11,659 INFO L475 AbstractCegarLoop]: Abstraction has 2920 states and 4173 transitions. [2019-09-10 07:59:11,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4173 transitions. [2019-09-10 07:59:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 07:59:11,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:11,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:11,664 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash 171118654, now seen corresponding path program 1 times [2019-09-10 07:59:11,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:11,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:11,843 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 07:59:11,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:11,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:59:11,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:11,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:59:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:59:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:59:11,845 INFO L87 Difference]: Start difference. First operand 2920 states and 4173 transitions. Second operand 7 states. [2019-09-10 07:59:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:12,332 INFO L93 Difference]: Finished difference Result 14020 states and 20012 transitions. [2019-09-10 07:59:12,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:59:12,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-09-10 07:59:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:12,355 INFO L225 Difference]: With dead ends: 14020 [2019-09-10 07:59:12,355 INFO L226 Difference]: Without dead ends: 14020 [2019-09-10 07:59:12,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:59:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14020 states. [2019-09-10 07:59:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14020 to 5544. [2019-09-10 07:59:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5544 states. [2019-09-10 07:59:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7899 transitions. [2019-09-10 07:59:12,493 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7899 transitions. Word has length 179 [2019-09-10 07:59:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:12,494 INFO L475 AbstractCegarLoop]: Abstraction has 5544 states and 7899 transitions. [2019-09-10 07:59:12,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:59:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7899 transitions. [2019-09-10 07:59:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 07:59:12,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:12,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:12,504 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1285098454, now seen corresponding path program 1 times [2019-09-10 07:59:12,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:12,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:12,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:12,604 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 07:59:12,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:12,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:12,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:12,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:12,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:12,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:12,605 INFO L87 Difference]: Start difference. First operand 5544 states and 7899 transitions. Second operand 3 states. [2019-09-10 07:59:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:12,637 INFO L93 Difference]: Finished difference Result 2848 states and 4010 transitions. [2019-09-10 07:59:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:12,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 07:59:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:12,641 INFO L225 Difference]: With dead ends: 2848 [2019-09-10 07:59:12,642 INFO L226 Difference]: Without dead ends: 2848 [2019-09-10 07:59:12,642 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 07:59:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2019-09-10 07:59:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2846. [2019-09-10 07:59:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2019-09-10 07:59:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 4009 transitions. [2019-09-10 07:59:12,675 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 4009 transitions. Word has length 179 [2019-09-10 07:59:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:12,675 INFO L475 AbstractCegarLoop]: Abstraction has 2846 states and 4009 transitions. [2019-09-10 07:59:12,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4009 transitions. [2019-09-10 07:59:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 07:59:12,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:12,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:12,681 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1112207406, now seen corresponding path program 1 times [2019-09-10 07:59:12,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:12,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:12,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:13,015 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 07:59:13,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:13,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:59:13,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:13,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:59:13,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:59:13,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:59:13,017 INFO L87 Difference]: Start difference. First operand 2846 states and 4009 transitions. Second operand 7 states. [2019-09-10 07:59:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:13,418 INFO L93 Difference]: Finished difference Result 4156 states and 5847 transitions. [2019-09-10 07:59:13,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:59:13,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-09-10 07:59:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:13,426 INFO L225 Difference]: With dead ends: 4156 [2019-09-10 07:59:13,426 INFO L226 Difference]: Without dead ends: 4156 [2019-09-10 07:59:13,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:59:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2019-09-10 07:59:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 3474. [2019-09-10 07:59:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3474 states. [2019-09-10 07:59:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 4859 transitions. [2019-09-10 07:59:13,478 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 4859 transitions. Word has length 179 [2019-09-10 07:59:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:13,479 INFO L475 AbstractCegarLoop]: Abstraction has 3474 states and 4859 transitions. [2019-09-10 07:59:13,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:59:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 4859 transitions. [2019-09-10 07:59:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 07:59:13,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:13,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:13,483 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1738197105, now seen corresponding path program 1 times [2019-09-10 07:59:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:13,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:13,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:13,604 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 07:59:13,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:13,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:13,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:13,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:13,606 INFO L87 Difference]: Start difference. First operand 3474 states and 4859 transitions. Second operand 3 states. [2019-09-10 07:59:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:13,680 INFO L93 Difference]: Finished difference Result 3472 states and 4851 transitions. [2019-09-10 07:59:13,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:13,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 07:59:13,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:13,683 INFO L225 Difference]: With dead ends: 3472 [2019-09-10 07:59:13,684 INFO L226 Difference]: Without dead ends: 3472 [2019-09-10 07:59:13,684 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 07:59:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2019-09-10 07:59:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2019-09-10 07:59:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2019-09-10 07:59:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4851 transitions. [2019-09-10 07:59:13,718 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4851 transitions. Word has length 179 [2019-09-10 07:59:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:13,718 INFO L475 AbstractCegarLoop]: Abstraction has 3472 states and 4851 transitions. [2019-09-10 07:59:13,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4851 transitions. [2019-09-10 07:59:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 07:59:13,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:13,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:13,722 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1571063900, now seen corresponding path program 1 times [2019-09-10 07:59:13,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:13,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:13,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:13,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:13,851 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 07:59:13,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:13,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:13,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:13,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:13,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:13,853 INFO L87 Difference]: Start difference. First operand 3472 states and 4851 transitions. Second operand 5 states. [2019-09-10 07:59:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:14,132 INFO L93 Difference]: Finished difference Result 6102 states and 8568 transitions. [2019-09-10 07:59:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:14,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-10 07:59:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:14,140 INFO L225 Difference]: With dead ends: 6102 [2019-09-10 07:59:14,140 INFO L226 Difference]: Without dead ends: 6102 [2019-09-10 07:59:14,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:59:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-09-10 07:59:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 6096. [2019-09-10 07:59:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6096 states. [2019-09-10 07:59:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 8565 transitions. [2019-09-10 07:59:14,209 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 8565 transitions. Word has length 180 [2019-09-10 07:59:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:14,210 INFO L475 AbstractCegarLoop]: Abstraction has 6096 states and 8565 transitions. [2019-09-10 07:59:14,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 8565 transitions. [2019-09-10 07:59:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 07:59:14,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:14,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:14,215 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1164628298, now seen corresponding path program 1 times [2019-09-10 07:59:14,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:14,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:14,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:14,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:14,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:14,332 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 07:59:14,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:14,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:14,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:14,334 INFO L87 Difference]: Start difference. First operand 6096 states and 8565 transitions. Second operand 5 states. [2019-09-10 07:59:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:14,581 INFO L93 Difference]: Finished difference Result 8058 states and 11337 transitions. [2019-09-10 07:59:14,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:14,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-10 07:59:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:14,590 INFO L225 Difference]: With dead ends: 8058 [2019-09-10 07:59:14,590 INFO L226 Difference]: Without dead ends: 8058 [2019-09-10 07:59:14,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:59:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8058 states. [2019-09-10 07:59:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8058 to 7095. [2019-09-10 07:59:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7095 states. [2019-09-10 07:59:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7095 states to 7095 states and 9994 transitions. [2019-09-10 07:59:14,698 INFO L78 Accepts]: Start accepts. Automaton has 7095 states and 9994 transitions. Word has length 180 [2019-09-10 07:59:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:14,699 INFO L475 AbstractCegarLoop]: Abstraction has 7095 states and 9994 transitions. [2019-09-10 07:59:14,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7095 states and 9994 transitions. [2019-09-10 07:59:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 07:59:14,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:14,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:14,705 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -330356176, now seen corresponding path program 1 times [2019-09-10 07:59:14,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:14,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:14,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:14,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:14,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:14,878 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 07:59:14,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:14,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:59:14,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:14,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:59:14,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:59:14,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:59:14,880 INFO L87 Difference]: Start difference. First operand 7095 states and 9994 transitions. Second operand 7 states. [2019-09-10 07:59:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:15,399 INFO L93 Difference]: Finished difference Result 12761 states and 18051 transitions. [2019-09-10 07:59:15,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:59:15,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-09-10 07:59:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:15,413 INFO L225 Difference]: With dead ends: 12761 [2019-09-10 07:59:15,413 INFO L226 Difference]: Without dead ends: 12761 [2019-09-10 07:59:15,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:59:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12761 states. [2019-09-10 07:59:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12761 to 8389. [2019-09-10 07:59:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8389 states. [2019-09-10 07:59:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8389 states to 8389 states and 11814 transitions. [2019-09-10 07:59:15,530 INFO L78 Accepts]: Start accepts. Automaton has 8389 states and 11814 transitions. Word has length 180 [2019-09-10 07:59:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:15,531 INFO L475 AbstractCegarLoop]: Abstraction has 8389 states and 11814 transitions. [2019-09-10 07:59:15,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:59:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8389 states and 11814 transitions. [2019-09-10 07:59:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 07:59:15,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:15,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:15,538 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1319768790, now seen corresponding path program 1 times [2019-09-10 07:59:15,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:15,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:15,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:15,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:15,661 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 07:59:15,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:15,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:59:15,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:15,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:59:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:59:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:15,663 INFO L87 Difference]: Start difference. First operand 8389 states and 11814 transitions. Second operand 5 states. [2019-09-10 07:59:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:15,930 INFO L93 Difference]: Finished difference Result 10419 states and 14672 transitions. [2019-09-10 07:59:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:15,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-10 07:59:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:15,942 INFO L225 Difference]: With dead ends: 10419 [2019-09-10 07:59:15,942 INFO L226 Difference]: Without dead ends: 10419 [2019-09-10 07:59:15,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:59:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10419 states. [2019-09-10 07:59:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10419 to 9461. [2019-09-10 07:59:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9461 states. [2019-09-10 07:59:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 13344 transitions. [2019-09-10 07:59:16,071 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 13344 transitions. Word has length 180 [2019-09-10 07:59:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:16,071 INFO L475 AbstractCegarLoop]: Abstraction has 9461 states and 13344 transitions. [2019-09-10 07:59:16,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:59:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 13344 transitions. [2019-09-10 07:59:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 07:59:16,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:16,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:16,080 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:16,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1141039796, now seen corresponding path program 1 times [2019-09-10 07:59:16,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:16,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:16,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:16,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:16,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:16,436 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 07:59:16,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:16,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:59:16,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:16,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:59:16,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:59:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:59:16,439 INFO L87 Difference]: Start difference. First operand 9461 states and 13344 transitions. Second operand 10 states. [2019-09-10 07:59:18,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:18,989 INFO L93 Difference]: Finished difference Result 44234 states and 62454 transitions. [2019-09-10 07:59:18,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:59:18,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2019-09-10 07:59:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:19,022 INFO L225 Difference]: With dead ends: 44234 [2019-09-10 07:59:19,023 INFO L226 Difference]: Without dead ends: 44234 [2019-09-10 07:59:19,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:59:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44234 states. [2019-09-10 07:59:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44234 to 12408. [2019-09-10 07:59:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12408 states. [2019-09-10 07:59:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12408 states to 12408 states and 17387 transitions. [2019-09-10 07:59:19,343 INFO L78 Accepts]: Start accepts. Automaton has 12408 states and 17387 transitions. Word has length 182 [2019-09-10 07:59:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:19,343 INFO L475 AbstractCegarLoop]: Abstraction has 12408 states and 17387 transitions. [2019-09-10 07:59:19,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:59:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 12408 states and 17387 transitions. [2019-09-10 07:59:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 07:59:19,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:19,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:19,353 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1985534446, now seen corresponding path program 1 times [2019-09-10 07:59:19,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:19,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:19,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:19,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:19,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:19,633 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 07:59:19,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:19,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:59:19,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:19,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:59:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:59:19,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:59:19,635 INFO L87 Difference]: Start difference. First operand 12408 states and 17387 transitions. Second operand 10 states. [2019-09-10 07:59:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:21,995 INFO L93 Difference]: Finished difference Result 60120 states and 84264 transitions. [2019-09-10 07:59:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:59:21,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2019-09-10 07:59:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:22,043 INFO L225 Difference]: With dead ends: 60120 [2019-09-10 07:59:22,044 INFO L226 Difference]: Without dead ends: 60120 [2019-09-10 07:59:22,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:59:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60120 states. [2019-09-10 07:59:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60120 to 12544. [2019-09-10 07:59:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12544 states. [2019-09-10 07:59:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12544 states to 12544 states and 17549 transitions. [2019-09-10 07:59:22,433 INFO L78 Accepts]: Start accepts. Automaton has 12544 states and 17549 transitions. Word has length 183 [2019-09-10 07:59:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:22,434 INFO L475 AbstractCegarLoop]: Abstraction has 12544 states and 17549 transitions. [2019-09-10 07:59:22,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:59:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 12544 states and 17549 transitions. [2019-09-10 07:59:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 07:59:22,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:22,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:22,444 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1830393954, now seen corresponding path program 1 times [2019-09-10 07:59:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:22,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:22,717 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 07:59:22,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:22,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:59:22,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:22,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:59:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:59:22,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:59:22,719 INFO L87 Difference]: Start difference. First operand 12544 states and 17549 transitions. Second operand 10 states. [2019-09-10 07:59:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:24,998 INFO L93 Difference]: Finished difference Result 58096 states and 81792 transitions. [2019-09-10 07:59:24,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:59:24,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2019-09-10 07:59:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:25,052 INFO L225 Difference]: With dead ends: 58096 [2019-09-10 07:59:25,052 INFO L226 Difference]: Without dead ends: 58096 [2019-09-10 07:59:25,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:59:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58096 states. [2019-09-10 07:59:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58096 to 16848. [2019-09-10 07:59:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16848 states. [2019-09-10 07:59:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16848 states to 16848 states and 23379 transitions. [2019-09-10 07:59:25,449 INFO L78 Accepts]: Start accepts. Automaton has 16848 states and 23379 transitions. Word has length 183 [2019-09-10 07:59:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:25,449 INFO L475 AbstractCegarLoop]: Abstraction has 16848 states and 23379 transitions. [2019-09-10 07:59:25,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:59:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 16848 states and 23379 transitions. [2019-09-10 07:59:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 07:59:25,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:25,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:25,462 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1227634115, now seen corresponding path program 1 times [2019-09-10 07:59:25,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:25,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:25,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:25,559 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 07:59:25,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:25,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:25,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:25,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:25,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:25,561 INFO L87 Difference]: Start difference. First operand 16848 states and 23379 transitions. Second operand 3 states. [2019-09-10 07:59:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:25,611 INFO L93 Difference]: Finished difference Result 9695 states and 13323 transitions. [2019-09-10 07:59:25,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:25,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 07:59:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:25,625 INFO L225 Difference]: With dead ends: 9695 [2019-09-10 07:59:25,625 INFO L226 Difference]: Without dead ends: 9695 [2019-09-10 07:59:25,625 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 07:59:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9695 states. [2019-09-10 07:59:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9695 to 9693. [2019-09-10 07:59:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9693 states. [2019-09-10 07:59:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9693 states to 9693 states and 13322 transitions. [2019-09-10 07:59:25,755 INFO L78 Accepts]: Start accepts. Automaton has 9693 states and 13322 transitions. Word has length 183 [2019-09-10 07:59:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:25,755 INFO L475 AbstractCegarLoop]: Abstraction has 9693 states and 13322 transitions. [2019-09-10 07:59:25,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 9693 states and 13322 transitions. [2019-09-10 07:59:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 07:59:25,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:25,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:25,765 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1647242104, now seen corresponding path program 1 times [2019-09-10 07:59:25,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:25,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:25,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:25,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:25,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:25,953 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 07:59:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:25,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:25,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:25,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:25,955 INFO L87 Difference]: Start difference. First operand 9693 states and 13322 transitions. Second operand 3 states. [2019-09-10 07:59:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:26,118 INFO L93 Difference]: Finished difference Result 9319 states and 12700 transitions. [2019-09-10 07:59:26,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:26,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-10 07:59:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:26,128 INFO L225 Difference]: With dead ends: 9319 [2019-09-10 07:59:26,128 INFO L226 Difference]: Without dead ends: 9319 [2019-09-10 07:59:26,129 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 07:59:26,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9319 states. [2019-09-10 07:59:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9319 to 9319. [2019-09-10 07:59:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9319 states. [2019-09-10 07:59:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9319 states to 9319 states and 12700 transitions. [2019-09-10 07:59:26,208 INFO L78 Accepts]: Start accepts. Automaton has 9319 states and 12700 transitions. Word has length 184 [2019-09-10 07:59:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:26,209 INFO L475 AbstractCegarLoop]: Abstraction has 9319 states and 12700 transitions. [2019-09-10 07:59:26,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 9319 states and 12700 transitions. [2019-09-10 07:59:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 07:59:26,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:26,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:26,216 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash -579554163, now seen corresponding path program 1 times [2019-09-10 07:59:26,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:26,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:26,446 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 07:59:26,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:26,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:59:26,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:26,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:59:26,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:59:26,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:59:26,447 INFO L87 Difference]: Start difference. First operand 9319 states and 12700 transitions. Second operand 10 states. [2019-09-10 07:59:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:27,709 INFO L93 Difference]: Finished difference Result 12054 states and 16466 transitions. [2019-09-10 07:59:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:59:27,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-10 07:59:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:27,723 INFO L225 Difference]: With dead ends: 12054 [2019-09-10 07:59:27,723 INFO L226 Difference]: Without dead ends: 12054 [2019-09-10 07:59:27,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:59:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2019-09-10 07:59:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 9319. [2019-09-10 07:59:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9319 states. [2019-09-10 07:59:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9319 states to 9319 states and 12656 transitions. [2019-09-10 07:59:27,860 INFO L78 Accepts]: Start accepts. Automaton has 9319 states and 12656 transitions. Word has length 184 [2019-09-10 07:59:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:27,860 INFO L475 AbstractCegarLoop]: Abstraction has 9319 states and 12656 transitions. [2019-09-10 07:59:27,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:59:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 9319 states and 12656 transitions. [2019-09-10 07:59:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 07:59:27,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:27,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:27,867 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash -164695771, now seen corresponding path program 1 times [2019-09-10 07:59:27,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:27,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:27,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:27,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:27,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:28,123 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 07:59:28,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:28,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:59:28,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:28,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:59:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:59:28,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:59:28,125 INFO L87 Difference]: Start difference. First operand 9319 states and 12656 transitions. Second operand 10 states. [2019-09-10 07:59:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:30,388 INFO L93 Difference]: Finished difference Result 49306 states and 66936 transitions. [2019-09-10 07:59:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:59:30,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2019-09-10 07:59:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:30,425 INFO L225 Difference]: With dead ends: 49306 [2019-09-10 07:59:30,425 INFO L226 Difference]: Without dead ends: 49306 [2019-09-10 07:59:30,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:59:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49306 states. [2019-09-10 07:59:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49306 to 9367. [2019-09-10 07:59:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9367 states. [2019-09-10 07:59:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9367 states to 9367 states and 12704 transitions. [2019-09-10 07:59:30,692 INFO L78 Accepts]: Start accepts. Automaton has 9367 states and 12704 transitions. Word has length 184 [2019-09-10 07:59:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:30,692 INFO L475 AbstractCegarLoop]: Abstraction has 9367 states and 12704 transitions. [2019-09-10 07:59:30,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:59:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 9367 states and 12704 transitions. [2019-09-10 07:59:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 07:59:30,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:30,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:30,698 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:30,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1951322507, now seen corresponding path program 1 times [2019-09-10 07:59:30,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:30,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:30,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:30,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:30,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:30,760 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 07:59:30,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:30,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:59:30,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:30,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:59:30,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:59:30,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:59:30,762 INFO L87 Difference]: Start difference. First operand 9367 states and 12704 transitions. Second operand 3 states. [2019-09-10 07:59:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:30,907 INFO L93 Difference]: Finished difference Result 8489 states and 11450 transitions. [2019-09-10 07:59:30,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:59:30,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-10 07:59:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:30,916 INFO L225 Difference]: With dead ends: 8489 [2019-09-10 07:59:30,916 INFO L226 Difference]: Without dead ends: 8489 [2019-09-10 07:59:30,917 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 07:59:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8489 states. [2019-09-10 07:59:30,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8489 to 8489. [2019-09-10 07:59:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8489 states. [2019-09-10 07:59:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8489 states to 8489 states and 11450 transitions. [2019-09-10 07:59:30,982 INFO L78 Accepts]: Start accepts. Automaton has 8489 states and 11450 transitions. Word has length 185 [2019-09-10 07:59:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:30,982 INFO L475 AbstractCegarLoop]: Abstraction has 8489 states and 11450 transitions. [2019-09-10 07:59:30,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:59:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8489 states and 11450 transitions. [2019-09-10 07:59:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 07:59:30,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:30,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:30,991 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 669495538, now seen corresponding path program 1 times [2019-09-10 07:59:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:30,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:30,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:31,061 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 07:59:31,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:31,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:59:31,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:31,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:59:31,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:59:31,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:59:31,063 INFO L87 Difference]: Start difference. First operand 8489 states and 11450 transitions. Second operand 4 states. [2019-09-10 07:59:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:31,488 INFO L93 Difference]: Finished difference Result 14826 states and 20095 transitions. [2019-09-10 07:59:31,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:59:31,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-09-10 07:59:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:31,502 INFO L225 Difference]: With dead ends: 14826 [2019-09-10 07:59:31,503 INFO L226 Difference]: Without dead ends: 14826 [2019-09-10 07:59:31,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:59:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14826 states. [2019-09-10 07:59:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14826 to 8489. [2019-09-10 07:59:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8489 states. [2019-09-10 07:59:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8489 states to 8489 states and 11450 transitions. [2019-09-10 07:59:31,619 INFO L78 Accepts]: Start accepts. Automaton has 8489 states and 11450 transitions. Word has length 185 [2019-09-10 07:59:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:31,620 INFO L475 AbstractCegarLoop]: Abstraction has 8489 states and 11450 transitions. [2019-09-10 07:59:31,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:59:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8489 states and 11450 transitions. [2019-09-10 07:59:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 07:59:31,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:31,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:31,626 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash 747316050, now seen corresponding path program 1 times [2019-09-10 07:59:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:31,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:31,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:31,991 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 07:59:31,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:31,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:59:31,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:31,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:59:31,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:59:31,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:59:31,993 INFO L87 Difference]: Start difference. First operand 8489 states and 11450 transitions. Second operand 12 states. [2019-09-10 07:59:32,127 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-09-10 07:59:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:34,345 INFO L93 Difference]: Finished difference Result 14487 states and 19792 transitions. [2019-09-10 07:59:34,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:59:34,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2019-09-10 07:59:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:34,357 INFO L225 Difference]: With dead ends: 14487 [2019-09-10 07:59:34,357 INFO L226 Difference]: Without dead ends: 14487 [2019-09-10 07:59:34,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:59:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14487 states. [2019-09-10 07:59:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14487 to 6423. [2019-09-10 07:59:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6423 states. [2019-09-10 07:59:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6423 states to 6423 states and 8716 transitions. [2019-09-10 07:59:34,457 INFO L78 Accepts]: Start accepts. Automaton has 6423 states and 8716 transitions. Word has length 185 [2019-09-10 07:59:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:34,458 INFO L475 AbstractCegarLoop]: Abstraction has 6423 states and 8716 transitions. [2019-09-10 07:59:34,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:59:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6423 states and 8716 transitions. [2019-09-10 07:59:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 07:59:34,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:34,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:34,462 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:34,462 INFO L82 PathProgramCache]: Analyzing trace with hash -616507731, now seen corresponding path program 1 times [2019-09-10 07:59:34,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:34,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:34,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:34,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:34,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:34,981 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 07:59:34,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:34,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:59:34,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:34,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:59:34,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:59:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:59:34,983 INFO L87 Difference]: Start difference. First operand 6423 states and 8716 transitions. Second operand 16 states. [2019-09-10 07:59:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:40,630 INFO L93 Difference]: Finished difference Result 27257 states and 37239 transitions. [2019-09-10 07:59:40,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 07:59:40,631 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 185 [2019-09-10 07:59:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:40,649 INFO L225 Difference]: With dead ends: 27257 [2019-09-10 07:59:40,649 INFO L226 Difference]: Without dead ends: 27257 [2019-09-10 07:59:40,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=765, Invalid=2427, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:59:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27257 states. [2019-09-10 07:59:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27257 to 7158. [2019-09-10 07:59:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7158 states. [2019-09-10 07:59:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 9648 transitions. [2019-09-10 07:59:40,807 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 9648 transitions. Word has length 185 [2019-09-10 07:59:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:40,808 INFO L475 AbstractCegarLoop]: Abstraction has 7158 states and 9648 transitions. [2019-09-10 07:59:40,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:59:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 9648 transitions. [2019-09-10 07:59:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 07:59:40,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:40,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:40,813 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:40,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash 590784259, now seen corresponding path program 1 times [2019-09-10 07:59:40,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:40,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:40,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:40,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:40,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:41,321 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 07:59:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:41,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:59:41,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:41,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:59:41,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:59:41,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:59:41,323 INFO L87 Difference]: Start difference. First operand 7158 states and 9648 transitions. Second operand 16 states. [2019-09-10 07:59:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:48,032 INFO L93 Difference]: Finished difference Result 33503 states and 45387 transitions. [2019-09-10 07:59:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 07:59:48,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 185 [2019-09-10 07:59:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:48,061 INFO L225 Difference]: With dead ends: 33503 [2019-09-10 07:59:48,061 INFO L226 Difference]: Without dead ends: 33503 [2019-09-10 07:59:48,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1056, Invalid=3636, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 07:59:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33503 states. [2019-09-10 07:59:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33503 to 14193. [2019-09-10 07:59:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14193 states. [2019-09-10 07:59:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14193 states to 14193 states and 18966 transitions. [2019-09-10 07:59:48,386 INFO L78 Accepts]: Start accepts. Automaton has 14193 states and 18966 transitions. Word has length 185 [2019-09-10 07:59:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:48,387 INFO L475 AbstractCegarLoop]: Abstraction has 14193 states and 18966 transitions. [2019-09-10 07:59:48,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:59:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 14193 states and 18966 transitions. [2019-09-10 07:59:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 07:59:48,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:48,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:48,396 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:48,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1671788559, now seen corresponding path program 1 times [2019-09-10 07:59:48,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:48,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:48,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:48,735 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 07:59:48,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:59:48,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:48,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:59:48,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:59:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:59:48,737 INFO L87 Difference]: Start difference. First operand 14193 states and 18966 transitions. Second operand 14 states. [2019-09-10 07:59:51,923 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-10 07:59:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:52,972 INFO L93 Difference]: Finished difference Result 42355 states and 57004 transitions. [2019-09-10 07:59:52,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:59:52,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2019-09-10 07:59:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:53,002 INFO L225 Difference]: With dead ends: 42355 [2019-09-10 07:59:53,002 INFO L226 Difference]: Without dead ends: 42355 [2019-09-10 07:59:53,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:59:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42355 states. [2019-09-10 07:59:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42355 to 15882. [2019-09-10 07:59:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15882 states. [2019-09-10 07:59:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15882 states to 15882 states and 21141 transitions. [2019-09-10 07:59:53,307 INFO L78 Accepts]: Start accepts. Automaton has 15882 states and 21141 transitions. Word has length 185 [2019-09-10 07:59:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:53,307 INFO L475 AbstractCegarLoop]: Abstraction has 15882 states and 21141 transitions. [2019-09-10 07:59:53,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:59:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15882 states and 21141 transitions. [2019-09-10 07:59:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 07:59:53,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:53,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:53,317 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2115179440, now seen corresponding path program 1 times [2019-09-10 07:59:53,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:53,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:53,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:53,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:53,769 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 07:59:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:59:53,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:53,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:59:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:59:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:59:53,771 INFO L87 Difference]: Start difference. First operand 15882 states and 21141 transitions. Second operand 16 states. [2019-09-10 07:59:55,691 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:59:57,205 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:59:57,410 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 07:59:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:59:58,919 INFO L93 Difference]: Finished difference Result 41442 states and 56105 transitions. [2019-09-10 07:59:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 07:59:58,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 185 [2019-09-10 07:59:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:59:58,950 INFO L225 Difference]: With dead ends: 41442 [2019-09-10 07:59:58,950 INFO L226 Difference]: Without dead ends: 41442 [2019-09-10 07:59:58,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=700, Invalid=2270, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 07:59:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41442 states. [2019-09-10 07:59:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41442 to 14563. [2019-09-10 07:59:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14563 states. [2019-09-10 07:59:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14563 states to 14563 states and 19494 transitions. [2019-09-10 07:59:59,263 INFO L78 Accepts]: Start accepts. Automaton has 14563 states and 19494 transitions. Word has length 185 [2019-09-10 07:59:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:59:59,263 INFO L475 AbstractCegarLoop]: Abstraction has 14563 states and 19494 transitions. [2019-09-10 07:59:59,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:59:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 14563 states and 19494 transitions. [2019-09-10 07:59:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 07:59:59,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:59:59,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:59:59,272 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:59:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:59:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1473143763, now seen corresponding path program 1 times [2019-09-10 07:59:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:59:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:59,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:59:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:59:59,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:59:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:59:59,603 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 07:59:59,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:59:59,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:59:59,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:59:59,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:59:59,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:59:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:59:59,605 INFO L87 Difference]: Start difference. First operand 14563 states and 19494 transitions. Second operand 12 states. [2019-09-10 08:00:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:02,949 INFO L93 Difference]: Finished difference Result 42097 states and 56988 transitions. [2019-09-10 08:00:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:00:02,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 186 [2019-09-10 08:00:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:02,986 INFO L225 Difference]: With dead ends: 42097 [2019-09-10 08:00:02,986 INFO L226 Difference]: Without dead ends: 42097 [2019-09-10 08:00:02,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:00:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42097 states. [2019-09-10 08:00:03,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42097 to 16349. [2019-09-10 08:00:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16349 states. [2019-09-10 08:00:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16349 states to 16349 states and 21745 transitions. [2019-09-10 08:00:03,481 INFO L78 Accepts]: Start accepts. Automaton has 16349 states and 21745 transitions. Word has length 186 [2019-09-10 08:00:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:03,482 INFO L475 AbstractCegarLoop]: Abstraction has 16349 states and 21745 transitions. [2019-09-10 08:00:03,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:00:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 16349 states and 21745 transitions. [2019-09-10 08:00:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:00:03,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:03,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:03,492 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:03,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1201932429, now seen corresponding path program 1 times [2019-09-10 08:00:03,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:03,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:03,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:03,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:03,921 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:00:03,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:03,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:00:03,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:03,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:00:03,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:00:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:00:03,923 INFO L87 Difference]: Start difference. First operand 16349 states and 21745 transitions. Second operand 13 states. [2019-09-10 08:00:05,232 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:00:06,003 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:00:06,155 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:00:07,502 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:00:08,153 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:00:13,019 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:00:13,342 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:00:13,731 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:00:18,754 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:00:20,266 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:00:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:22,749 INFO L93 Difference]: Finished difference Result 77484 states and 104071 transitions. [2019-09-10 08:00:22,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 08:00:22,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-09-10 08:00:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:22,808 INFO L225 Difference]: With dead ends: 77484 [2019-09-10 08:00:22,808 INFO L226 Difference]: Without dead ends: 77484 [2019-09-10 08:00:22,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=950, Invalid=3606, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 08:00:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77484 states. [2019-09-10 08:00:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77484 to 16985. [2019-09-10 08:00:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16985 states. [2019-09-10 08:00:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 22545 transitions. [2019-09-10 08:00:23,384 INFO L78 Accepts]: Start accepts. Automaton has 16985 states and 22545 transitions. Word has length 186 [2019-09-10 08:00:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:23,385 INFO L475 AbstractCegarLoop]: Abstraction has 16985 states and 22545 transitions. [2019-09-10 08:00:23,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:00:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 16985 states and 22545 transitions. [2019-09-10 08:00:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:00:23,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:23,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:23,396 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:23,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash 733863012, now seen corresponding path program 1 times [2019-09-10 08:00:23,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:23,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:23,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:23,612 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:00:23,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:23,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:00:23,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:23,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:00:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:00:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:00:23,614 INFO L87 Difference]: Start difference. First operand 16985 states and 22545 transitions. Second operand 10 states. [2019-09-10 08:00:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:26,439 INFO L93 Difference]: Finished difference Result 70466 states and 94444 transitions. [2019-09-10 08:00:26,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:00:26,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2019-09-10 08:00:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:26,504 INFO L225 Difference]: With dead ends: 70466 [2019-09-10 08:00:26,504 INFO L226 Difference]: Without dead ends: 70466 [2019-09-10 08:00:26,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:00:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70466 states. [2019-09-10 08:00:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70466 to 17179. [2019-09-10 08:00:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17179 states. [2019-09-10 08:00:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17179 states to 17179 states and 22773 transitions. [2019-09-10 08:00:27,256 INFO L78 Accepts]: Start accepts. Automaton has 17179 states and 22773 transitions. Word has length 186 [2019-09-10 08:00:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:27,256 INFO L475 AbstractCegarLoop]: Abstraction has 17179 states and 22773 transitions. [2019-09-10 08:00:27,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:00:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17179 states and 22773 transitions. [2019-09-10 08:00:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:00:27,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:27,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:27,269 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash 225863715, now seen corresponding path program 1 times [2019-09-10 08:00:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:27,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:27,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:27,591 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:00:27,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:27,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:00:27,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:27,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:00:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:00:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:00:27,592 INFO L87 Difference]: Start difference. First operand 17179 states and 22773 transitions. Second operand 12 states. [2019-09-10 08:00:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:30,893 INFO L93 Difference]: Finished difference Result 46502 states and 62723 transitions. [2019-09-10 08:00:30,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:00:30,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 186 [2019-09-10 08:00:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:30,932 INFO L225 Difference]: With dead ends: 46502 [2019-09-10 08:00:30,932 INFO L226 Difference]: Without dead ends: 46502 [2019-09-10 08:00:30,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:00:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46502 states. [2019-09-10 08:00:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46502 to 15910. [2019-09-10 08:00:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15910 states. [2019-09-10 08:00:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15910 states to 15910 states and 21007 transitions. [2019-09-10 08:00:31,303 INFO L78 Accepts]: Start accepts. Automaton has 15910 states and 21007 transitions. Word has length 186 [2019-09-10 08:00:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:31,303 INFO L475 AbstractCegarLoop]: Abstraction has 15910 states and 21007 transitions. [2019-09-10 08:00:31,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:00:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15910 states and 21007 transitions. [2019-09-10 08:00:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:00:31,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:31,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:31,314 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash -341138689, now seen corresponding path program 1 times [2019-09-10 08:00:31,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:31,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:31,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:31,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:31,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:31,680 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:00:31,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:31,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:00:31,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:31,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:00:31,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:00:31,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:00:31,681 INFO L87 Difference]: Start difference. First operand 15910 states and 21007 transitions. Second operand 10 states. [2019-09-10 08:00:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:33,770 INFO L93 Difference]: Finished difference Result 60240 states and 81178 transitions. [2019-09-10 08:00:33,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:00:33,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2019-09-10 08:00:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:33,817 INFO L225 Difference]: With dead ends: 60240 [2019-09-10 08:00:33,817 INFO L226 Difference]: Without dead ends: 60240 [2019-09-10 08:00:33,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:00:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60240 states. [2019-09-10 08:00:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60240 to 13310. [2019-09-10 08:00:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13310 states. [2019-09-10 08:00:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13310 states to 13310 states and 17651 transitions. [2019-09-10 08:00:34,219 INFO L78 Accepts]: Start accepts. Automaton has 13310 states and 17651 transitions. Word has length 186 [2019-09-10 08:00:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:34,220 INFO L475 AbstractCegarLoop]: Abstraction has 13310 states and 17651 transitions. [2019-09-10 08:00:34,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:00:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13310 states and 17651 transitions. [2019-09-10 08:00:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:00:34,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:34,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:34,228 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:34,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1896087989, now seen corresponding path program 1 times [2019-09-10 08:00:34,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:34,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:34,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:34,296 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:00:34,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:34,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:00:34,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:34,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:00:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:00:34,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:00:34,298 INFO L87 Difference]: Start difference. First operand 13310 states and 17651 transitions. Second operand 3 states. [2019-09-10 08:00:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:34,447 INFO L93 Difference]: Finished difference Result 13096 states and 17275 transitions. [2019-09-10 08:00:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:00:34,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-10 08:00:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:34,458 INFO L225 Difference]: With dead ends: 13096 [2019-09-10 08:00:34,459 INFO L226 Difference]: Without dead ends: 13096 [2019-09-10 08:00:34,459 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:00:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13096 states. [2019-09-10 08:00:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13096 to 13096. [2019-09-10 08:00:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13096 states. [2019-09-10 08:00:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13096 states to 13096 states and 17275 transitions. [2019-09-10 08:00:34,580 INFO L78 Accepts]: Start accepts. Automaton has 13096 states and 17275 transitions. Word has length 186 [2019-09-10 08:00:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:34,580 INFO L475 AbstractCegarLoop]: Abstraction has 13096 states and 17275 transitions. [2019-09-10 08:00:34,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:00:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 13096 states and 17275 transitions. [2019-09-10 08:00:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:00:34,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:34,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:34,588 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash 644602566, now seen corresponding path program 1 times [2019-09-10 08:00:34,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:34,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:34,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:34,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:34,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:34,883 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:00:34,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:34,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:00:34,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:34,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:00:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:00:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:00:34,885 INFO L87 Difference]: Start difference. First operand 13096 states and 17275 transitions. Second operand 12 states. [2019-09-10 08:00:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:36,859 INFO L93 Difference]: Finished difference Result 25496 states and 34075 transitions. [2019-09-10 08:00:36,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:00:36,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2019-09-10 08:00:36,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:36,881 INFO L225 Difference]: With dead ends: 25496 [2019-09-10 08:00:36,881 INFO L226 Difference]: Without dead ends: 25496 [2019-09-10 08:00:36,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:00:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25496 states. [2019-09-10 08:00:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25496 to 9604. [2019-09-10 08:00:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2019-09-10 08:00:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 12793 transitions. [2019-09-10 08:00:37,165 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 12793 transitions. Word has length 187 [2019-09-10 08:00:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:37,165 INFO L475 AbstractCegarLoop]: Abstraction has 9604 states and 12793 transitions. [2019-09-10 08:00:37,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:00:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 12793 transitions. [2019-09-10 08:00:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:00:37,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:37,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:37,171 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:37,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash 363345828, now seen corresponding path program 1 times [2019-09-10 08:00:37,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:37,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:37,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:37,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:37,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:37,221 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:00:37,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:37,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:00:37,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:37,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:00:37,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:00:37,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:00:37,223 INFO L87 Difference]: Start difference. First operand 9604 states and 12793 transitions. Second operand 3 states. [2019-09-10 08:00:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:37,352 INFO L93 Difference]: Finished difference Result 9463 states and 12558 transitions. [2019-09-10 08:00:37,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:00:37,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:00:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:37,361 INFO L225 Difference]: With dead ends: 9463 [2019-09-10 08:00:37,361 INFO L226 Difference]: Without dead ends: 9463 [2019-09-10 08:00:37,361 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:00:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9463 states. [2019-09-10 08:00:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9463 to 9463. [2019-09-10 08:00:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9463 states. [2019-09-10 08:00:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9463 states to 9463 states and 12558 transitions. [2019-09-10 08:00:37,438 INFO L78 Accepts]: Start accepts. Automaton has 9463 states and 12558 transitions. Word has length 187 [2019-09-10 08:00:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:37,438 INFO L475 AbstractCegarLoop]: Abstraction has 9463 states and 12558 transitions. [2019-09-10 08:00:37,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:00:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9463 states and 12558 transitions. [2019-09-10 08:00:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:00:37,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:37,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:37,444 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1231450796, now seen corresponding path program 1 times [2019-09-10 08:00:37,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:37,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:37,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:37,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:37,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:37,692 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:00:37,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:37,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:00:37,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:37,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:00:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:00:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:00:37,693 INFO L87 Difference]: Start difference. First operand 9463 states and 12558 transitions. Second operand 10 states. [2019-09-10 08:00:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:39,992 INFO L93 Difference]: Finished difference Result 35013 states and 47289 transitions. [2019-09-10 08:00:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:00:39,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2019-09-10 08:00:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:40,027 INFO L225 Difference]: With dead ends: 35013 [2019-09-10 08:00:40,027 INFO L226 Difference]: Without dead ends: 35013 [2019-09-10 08:00:40,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:00:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35013 states. [2019-09-10 08:00:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35013 to 8933. [2019-09-10 08:00:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8933 states. [2019-09-10 08:00:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8933 states to 8933 states and 11919 transitions. [2019-09-10 08:00:40,270 INFO L78 Accepts]: Start accepts. Automaton has 8933 states and 11919 transitions. Word has length 188 [2019-09-10 08:00:40,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:40,270 INFO L475 AbstractCegarLoop]: Abstraction has 8933 states and 11919 transitions. [2019-09-10 08:00:40,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:00:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8933 states and 11919 transitions. [2019-09-10 08:00:40,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:00:40,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:40,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:40,275 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:40,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:40,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1334872664, now seen corresponding path program 1 times [2019-09-10 08:00:40,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:40,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:40,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:40,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:40,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:40,567 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:00:40,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:40,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:00:40,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:40,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:00:40,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:00:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:00:40,572 INFO L87 Difference]: Start difference. First operand 8933 states and 11919 transitions. Second operand 10 states. [2019-09-10 08:00:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:42,241 INFO L93 Difference]: Finished difference Result 30950 states and 42301 transitions. [2019-09-10 08:00:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:00:42,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2019-09-10 08:00:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:42,269 INFO L225 Difference]: With dead ends: 30950 [2019-09-10 08:00:42,269 INFO L226 Difference]: Without dead ends: 30950 [2019-09-10 08:00:42,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:00:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30950 states. [2019-09-10 08:00:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30950 to 8730. [2019-09-10 08:00:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8730 states. [2019-09-10 08:00:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8730 states to 8730 states and 11661 transitions. [2019-09-10 08:00:42,459 INFO L78 Accepts]: Start accepts. Automaton has 8730 states and 11661 transitions. Word has length 188 [2019-09-10 08:00:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:42,460 INFO L475 AbstractCegarLoop]: Abstraction has 8730 states and 11661 transitions. [2019-09-10 08:00:42,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:00:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 8730 states and 11661 transitions. [2019-09-10 08:00:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:00:42,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:42,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:42,464 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash -97960162, now seen corresponding path program 1 times [2019-09-10 08:00:42,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:42,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:42,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:42,725 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:00:42,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:42,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:00:42,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:42,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:00:42,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:00:42,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:00:42,728 INFO L87 Difference]: Start difference. First operand 8730 states and 11661 transitions. Second operand 10 states. [2019-09-10 08:00:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:44,472 INFO L93 Difference]: Finished difference Result 25435 states and 34297 transitions. [2019-09-10 08:00:44,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:00:44,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-09-10 08:00:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:44,495 INFO L225 Difference]: With dead ends: 25435 [2019-09-10 08:00:44,496 INFO L226 Difference]: Without dead ends: 25435 [2019-09-10 08:00:44,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:00:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25435 states. [2019-09-10 08:00:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25435 to 10139. [2019-09-10 08:00:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10139 states. [2019-09-10 08:00:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10139 states to 10139 states and 13331 transitions. [2019-09-10 08:00:44,666 INFO L78 Accepts]: Start accepts. Automaton has 10139 states and 13331 transitions. Word has length 189 [2019-09-10 08:00:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:44,666 INFO L475 AbstractCegarLoop]: Abstraction has 10139 states and 13331 transitions. [2019-09-10 08:00:44,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:00:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10139 states and 13331 transitions. [2019-09-10 08:00:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:00:44,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:44,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:44,672 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1701751960, now seen corresponding path program 1 times [2019-09-10 08:00:44,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:44,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:44,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:44,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:44,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:44,780 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:00:44,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:44,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:00:44,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:44,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:00:44,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:00:44,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:00:44,782 INFO L87 Difference]: Start difference. First operand 10139 states and 13331 transitions. Second operand 4 states. [2019-09-10 08:00:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:44,819 INFO L93 Difference]: Finished difference Result 10231 states and 13377 transitions. [2019-09-10 08:00:44,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:00:44,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-10 08:00:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:44,832 INFO L225 Difference]: With dead ends: 10231 [2019-09-10 08:00:44,832 INFO L226 Difference]: Without dead ends: 10117 [2019-09-10 08:00:44,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:00:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2019-09-10 08:00:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 10111. [2019-09-10 08:00:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10111 states. [2019-09-10 08:00:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10111 states to 10111 states and 13225 transitions. [2019-09-10 08:00:44,932 INFO L78 Accepts]: Start accepts. Automaton has 10111 states and 13225 transitions. Word has length 189 [2019-09-10 08:00:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:44,932 INFO L475 AbstractCegarLoop]: Abstraction has 10111 states and 13225 transitions. [2019-09-10 08:00:44,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:00:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10111 states and 13225 transitions. [2019-09-10 08:00:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 08:00:44,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:44,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:44,941 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1704543652, now seen corresponding path program 1 times [2019-09-10 08:00:44,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:44,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:44,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:44,992 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:00:44,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:44,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:00:44,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:44,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:00:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:00:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:00:44,993 INFO L87 Difference]: Start difference. First operand 10111 states and 13225 transitions. Second operand 3 states. [2019-09-10 08:00:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:45,075 INFO L93 Difference]: Finished difference Result 12789 states and 15976 transitions. [2019-09-10 08:00:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:00:45,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-09-10 08:00:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:45,088 INFO L225 Difference]: With dead ends: 12789 [2019-09-10 08:00:45,088 INFO L226 Difference]: Without dead ends: 12785 [2019-09-10 08:00:45,088 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:00:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12785 states. [2019-09-10 08:00:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12785 to 12155. [2019-09-10 08:00:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12155 states. [2019-09-10 08:00:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12155 states to 12155 states and 15179 transitions. [2019-09-10 08:00:45,200 INFO L78 Accepts]: Start accepts. Automaton has 12155 states and 15179 transitions. Word has length 191 [2019-09-10 08:00:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:45,201 INFO L475 AbstractCegarLoop]: Abstraction has 12155 states and 15179 transitions. [2019-09-10 08:00:45,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:00:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12155 states and 15179 transitions. [2019-09-10 08:00:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:00:45,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:45,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:45,208 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1155381955, now seen corresponding path program 1 times [2019-09-10 08:00:45,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:45,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:45,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:45,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:45,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:45,280 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:00:45,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:45,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:00:45,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:45,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:00:45,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:00:45,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:00:45,281 INFO L87 Difference]: Start difference. First operand 12155 states and 15179 transitions. Second operand 3 states. [2019-09-10 08:00:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:45,361 INFO L93 Difference]: Finished difference Result 13533 states and 16961 transitions. [2019-09-10 08:00:45,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:00:45,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 08:00:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:45,375 INFO L225 Difference]: With dead ends: 13533 [2019-09-10 08:00:45,376 INFO L226 Difference]: Without dead ends: 13533 [2019-09-10 08:00:45,376 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:00:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13533 states. [2019-09-10 08:00:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13533 to 12917. [2019-09-10 08:00:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12917 states. [2019-09-10 08:00:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12917 states to 12917 states and 16138 transitions. [2019-09-10 08:00:45,495 INFO L78 Accepts]: Start accepts. Automaton has 12917 states and 16138 transitions. Word has length 192 [2019-09-10 08:00:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:45,496 INFO L475 AbstractCegarLoop]: Abstraction has 12917 states and 16138 transitions. [2019-09-10 08:00:45,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:00:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 12917 states and 16138 transitions. [2019-09-10 08:00:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 08:00:45,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:45,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:45,506 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash -823603493, now seen corresponding path program 1 times [2019-09-10 08:00:45,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:45,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:45,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:45,586 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:00:45,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:45,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:00:45,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:45,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:00:45,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:00:45,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:00:45,588 INFO L87 Difference]: Start difference. First operand 12917 states and 16138 transitions. Second operand 3 states. [2019-09-10 08:00:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:45,695 INFO L93 Difference]: Finished difference Result 12919 states and 16043 transitions. [2019-09-10 08:00:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:00:45,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-10 08:00:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:45,716 INFO L225 Difference]: With dead ends: 12919 [2019-09-10 08:00:45,716 INFO L226 Difference]: Without dead ends: 12919 [2019-09-10 08:00:45,717 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:00:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12919 states. [2019-09-10 08:00:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12919 to 12917. [2019-09-10 08:00:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12917 states. [2019-09-10 08:00:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12917 states to 12917 states and 16042 transitions. [2019-09-10 08:00:45,951 INFO L78 Accepts]: Start accepts. Automaton has 12917 states and 16042 transitions. Word has length 194 [2019-09-10 08:00:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:45,952 INFO L475 AbstractCegarLoop]: Abstraction has 12917 states and 16042 transitions. [2019-09-10 08:00:45,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:00:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 12917 states and 16042 transitions. [2019-09-10 08:00:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:00:45,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:45,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:45,967 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash 816848708, now seen corresponding path program 1 times [2019-09-10 08:00:45,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:45,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:45,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:45,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:46,537 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:00:46,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:00:46,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:46,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:00:46,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:00:46,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:00:46,540 INFO L87 Difference]: Start difference. First operand 12917 states and 16042 transitions. Second operand 18 states. [2019-09-10 08:00:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:49,387 INFO L93 Difference]: Finished difference Result 51634 states and 65066 transitions. [2019-09-10 08:00:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:00:49,388 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 195 [2019-09-10 08:00:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:49,556 INFO L225 Difference]: With dead ends: 51634 [2019-09-10 08:00:49,556 INFO L226 Difference]: Without dead ends: 51634 [2019-09-10 08:00:49,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:00:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51634 states. [2019-09-10 08:00:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51634 to 14047. [2019-09-10 08:00:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14047 states. [2019-09-10 08:00:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14047 states to 14047 states and 17344 transitions. [2019-09-10 08:00:49,873 INFO L78 Accepts]: Start accepts. Automaton has 14047 states and 17344 transitions. Word has length 195 [2019-09-10 08:00:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:49,874 INFO L475 AbstractCegarLoop]: Abstraction has 14047 states and 17344 transitions. [2019-09-10 08:00:49,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:00:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 14047 states and 17344 transitions. [2019-09-10 08:00:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:00:49,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:49,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:49,882 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash 602998145, now seen corresponding path program 1 times [2019-09-10 08:00:49,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:49,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:49,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:50,393 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:00:50,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:50,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:00:50,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:50,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:00:50,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:00:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:00:50,396 INFO L87 Difference]: Start difference. First operand 14047 states and 17344 transitions. Second operand 18 states. [2019-09-10 08:00:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:52,543 INFO L93 Difference]: Finished difference Result 66643 states and 83928 transitions. [2019-09-10 08:00:52,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:00:52,543 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 195 [2019-09-10 08:00:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:52,612 INFO L225 Difference]: With dead ends: 66643 [2019-09-10 08:00:52,613 INFO L226 Difference]: Without dead ends: 66643 [2019-09-10 08:00:52,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:00:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66643 states. [2019-09-10 08:00:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66643 to 16525. [2019-09-10 08:00:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16525 states. [2019-09-10 08:00:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 20249 transitions. [2019-09-10 08:00:53,131 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 20249 transitions. Word has length 195 [2019-09-10 08:00:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:53,131 INFO L475 AbstractCegarLoop]: Abstraction has 16525 states and 20249 transitions. [2019-09-10 08:00:53,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:00:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 20249 transitions. [2019-09-10 08:00:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 08:00:53,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:53,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:53,142 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash -929628895, now seen corresponding path program 1 times [2019-09-10 08:00:53,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:53,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:53,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:53,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:53,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:53,240 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:00:53,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:53,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:00:53,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:53,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:00:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:00:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:00:53,242 INFO L87 Difference]: Start difference. First operand 16525 states and 20249 transitions. Second operand 4 states. [2019-09-10 08:00:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:53,294 INFO L93 Difference]: Finished difference Result 16593 states and 20217 transitions. [2019-09-10 08:00:53,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:00:53,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-10 08:00:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:53,309 INFO L225 Difference]: With dead ends: 16593 [2019-09-10 08:00:53,309 INFO L226 Difference]: Without dead ends: 16345 [2019-09-10 08:00:53,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:00:53,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16345 states. [2019-09-10 08:00:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16345 to 16057. [2019-09-10 08:00:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16057 states. [2019-09-10 08:00:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16057 states to 16057 states and 19588 transitions. [2019-09-10 08:00:53,480 INFO L78 Accepts]: Start accepts. Automaton has 16057 states and 19588 transitions. Word has length 195 [2019-09-10 08:00:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:53,480 INFO L475 AbstractCegarLoop]: Abstraction has 16057 states and 19588 transitions. [2019-09-10 08:00:53,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:00:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 16057 states and 19588 transitions. [2019-09-10 08:00:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:00:53,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:53,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:53,489 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash -943801001, now seen corresponding path program 1 times [2019-09-10 08:00:53,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:53,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:53,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:53,579 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:00:53,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:53,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:00:53,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:53,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:00:53,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:00:53,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:00:53,581 INFO L87 Difference]: Start difference. First operand 16057 states and 19588 transitions. Second operand 3 states. [2019-09-10 08:00:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:53,655 INFO L93 Difference]: Finished difference Result 16353 states and 19591 transitions. [2019-09-10 08:00:53,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:00:53,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-10 08:00:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:53,671 INFO L225 Difference]: With dead ends: 16353 [2019-09-10 08:00:53,671 INFO L226 Difference]: Without dead ends: 16353 [2019-09-10 08:00:53,672 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:00:53,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2019-09-10 08:00:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 16197. [2019-09-10 08:00:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16197 states. [2019-09-10 08:00:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16197 states to 16197 states and 19436 transitions. [2019-09-10 08:00:53,827 INFO L78 Accepts]: Start accepts. Automaton has 16197 states and 19436 transitions. Word has length 199 [2019-09-10 08:00:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:53,827 INFO L475 AbstractCegarLoop]: Abstraction has 16197 states and 19436 transitions. [2019-09-10 08:00:53,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:00:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 16197 states and 19436 transitions. [2019-09-10 08:00:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 08:00:53,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:53,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:53,835 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash -154370721, now seen corresponding path program 1 times [2019-09-10 08:00:53,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:53,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:53,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:53,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:53,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:54,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:54,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:00:54,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:54,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:00:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:00:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:00:54,082 INFO L87 Difference]: Start difference. First operand 16197 states and 19436 transitions. Second operand 6 states. [2019-09-10 08:00:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:54,176 INFO L93 Difference]: Finished difference Result 20909 states and 25428 transitions. [2019-09-10 08:00:54,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:00:54,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 199 [2019-09-10 08:00:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:54,193 INFO L225 Difference]: With dead ends: 20909 [2019-09-10 08:00:54,193 INFO L226 Difference]: Without dead ends: 20909 [2019-09-10 08:00:54,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:00:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20909 states. [2019-09-10 08:00:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20909 to 16341. [2019-09-10 08:00:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2019-09-10 08:00:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 19532 transitions. [2019-09-10 08:00:54,354 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 19532 transitions. Word has length 199 [2019-09-10 08:00:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:54,354 INFO L475 AbstractCegarLoop]: Abstraction has 16341 states and 19532 transitions. [2019-09-10 08:00:54,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:00:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 19532 transitions. [2019-09-10 08:00:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 08:00:54,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:54,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:54,363 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:54,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:54,363 INFO L82 PathProgramCache]: Analyzing trace with hash 361823537, now seen corresponding path program 1 times [2019-09-10 08:00:54,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:54,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:54,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:54,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:54,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:54,475 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:00:54,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:54,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:00:54,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:54,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:00:54,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:00:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:00:54,477 INFO L87 Difference]: Start difference. First operand 16341 states and 19532 transitions. Second operand 3 states. [2019-09-10 08:00:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:54,605 INFO L93 Difference]: Finished difference Result 20765 states and 24838 transitions. [2019-09-10 08:00:54,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:00:54,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 08:00:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:54,628 INFO L225 Difference]: With dead ends: 20765 [2019-09-10 08:00:54,628 INFO L226 Difference]: Without dead ends: 20745 [2019-09-10 08:00:54,629 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:00:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20745 states. [2019-09-10 08:00:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20745 to 20699. [2019-09-10 08:00:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20699 states. [2019-09-10 08:00:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20699 states to 20699 states and 24767 transitions. [2019-09-10 08:00:54,893 INFO L78 Accepts]: Start accepts. Automaton has 20699 states and 24767 transitions. Word has length 200 [2019-09-10 08:00:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:54,893 INFO L475 AbstractCegarLoop]: Abstraction has 20699 states and 24767 transitions. [2019-09-10 08:00:54,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:00:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 20699 states and 24767 transitions. [2019-09-10 08:00:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:00:54,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:54,904 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:54,904 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:54,905 INFO L82 PathProgramCache]: Analyzing trace with hash 917576246, now seen corresponding path program 1 times [2019-09-10 08:00:54,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:54,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:54,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:54,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:54,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:55,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:00:55,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:00:55,269 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2019-09-10 08:00:55,271 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [198], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [239], [241], [244], [247], [250], [252], [254], [257], [260], [266], [270], [288], [301], [314], [327], [340], [343], [346], [352], [356], [359], [364], [372], [374], [377], [380], [383], [385], [387], [390], [393], [396], [398], [400], [403], [406], [409], [411], [413], [416], [419], [422], [424], [426], [429], [432], [438], [442], [444], [447], [450], [452], [460], [462], [465], [468], [473], [475], [478], [486], [488], [491], [499], [501], [504], [512], [514], [517], [520], [526], [529], [530], [532], [534], [537], [548], [557], [559], [562], [565], [567], [582], [584], [587], [590], [592], [607], [609], [612], [615], [617], [625], [628], [634], [637], [640], [642], [657], [661], [664], [667], [669], [677], [680], [800], [802], [820], [823], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [963], [966], [1004], [1007], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:00:55,318 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:00:55,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:00:55,464 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:00:56,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:00:56,312 INFO L272 AbstractInterpreter]: Visited 221 different actions 874 times. Merged at 54 different actions 568 times. Widened at 20 different actions 88 times. Performed 3031 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3031 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 73 fixpoints after 18 different actions. Largest state had 181 variables. [2019-09-10 08:00:56,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:56,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:00:56,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:00:56,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:00:56,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:56,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:00:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:56,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 08:00:56,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:00:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:00:56,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:00:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:00:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:00:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [12] total 17 [2019-09-10 08:00:56,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:56,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:00:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:00:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:00:56,986 INFO L87 Difference]: Start difference. First operand 20699 states and 24767 transitions. Second operand 4 states. [2019-09-10 08:00:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:57,139 INFO L93 Difference]: Finished difference Result 16667 states and 20094 transitions. [2019-09-10 08:00:57,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:00:57,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-09-10 08:00:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:57,199 INFO L225 Difference]: With dead ends: 16667 [2019-09-10 08:00:57,199 INFO L226 Difference]: Without dead ends: 16667 [2019-09-10 08:00:57,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:00:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16667 states. [2019-09-10 08:00:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16667 to 16595. [2019-09-10 08:00:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16595 states. [2019-09-10 08:00:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16595 states to 16595 states and 20013 transitions. [2019-09-10 08:00:57,631 INFO L78 Accepts]: Start accepts. Automaton has 16595 states and 20013 transitions. Word has length 228 [2019-09-10 08:00:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:57,633 INFO L475 AbstractCegarLoop]: Abstraction has 16595 states and 20013 transitions. [2019-09-10 08:00:57,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:00:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 16595 states and 20013 transitions. [2019-09-10 08:00:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:00:57,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:57,652 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:57,652 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2121868219, now seen corresponding path program 1 times [2019-09-10 08:00:57,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:57,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:57,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:57,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:57,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:00:57,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:00:57,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:00:57,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:00:57,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:00:57,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:00:57,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:00:57,925 INFO L87 Difference]: Start difference. First operand 16595 states and 20013 transitions. Second operand 6 states. [2019-09-10 08:00:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:00:58,135 INFO L93 Difference]: Finished difference Result 28809 states and 35098 transitions. [2019-09-10 08:00:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:00:58,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-09-10 08:00:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:00:58,190 INFO L225 Difference]: With dead ends: 28809 [2019-09-10 08:00:58,190 INFO L226 Difference]: Without dead ends: 28809 [2019-09-10 08:00:58,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:00:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28809 states. [2019-09-10 08:00:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28809 to 25693. [2019-09-10 08:00:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25693 states. [2019-09-10 08:00:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25693 states to 25693 states and 31349 transitions. [2019-09-10 08:00:58,699 INFO L78 Accepts]: Start accepts. Automaton has 25693 states and 31349 transitions. Word has length 228 [2019-09-10 08:00:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:00:58,700 INFO L475 AbstractCegarLoop]: Abstraction has 25693 states and 31349 transitions. [2019-09-10 08:00:58,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:00:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 25693 states and 31349 transitions. [2019-09-10 08:00:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:00:58,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:00:58,726 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:58,727 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:00:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:00:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash -263481205, now seen corresponding path program 1 times [2019-09-10 08:00:58,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:00:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:58,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:00:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:00:58,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:00:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:00:59,164 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-10 08:00:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:00:59,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:00:59,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:00:59,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2019-09-10 08:00:59,656 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [198], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [237], [239], [241], [244], [247], [250], [252], [254], [257], [264], [266], [270], [288], [301], [314], [327], [340], [343], [350], [352], [356], [359], [364], [372], [374], [377], [380], [383], [385], [387], [390], [393], [396], [398], [400], [403], [406], [409], [411], [413], [416], [419], [424], [426], [429], [432], [438], [442], [444], [447], [450], [452], [460], [462], [465], [468], [473], [475], [478], [486], [488], [491], [499], [501], [504], [512], [514], [517], [520], [526], [529], [530], [532], [534], [537], [548], [557], [559], [562], [565], [567], [582], [584], [587], [590], [592], [607], [609], [612], [615], [617], [625], [628], [634], [637], [640], [642], [657], [661], [664], [667], [669], [677], [680], [693], [696], [800], [802], [827], [830], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [970], [973], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:00:59,665 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:00:59,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:00:59,693 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:01:00,226 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:01:00,228 INFO L272 AbstractInterpreter]: Visited 221 different actions 770 times. Merged at 54 different actions 478 times. Widened at 17 different actions 60 times. Performed 2687 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2687 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 61 fixpoints after 17 different actions. Largest state had 181 variables. [2019-09-10 08:01:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:01:00,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:01:00,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:01:00,229 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:01:00,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:01:00,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:01:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:01:00,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 08:01:00,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:01:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:01,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:01:01,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:02,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:02,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:02,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:02,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:36,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:01:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:01:36,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:01:36,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 33 [2019-09-10 08:01:36,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:01:36,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:01:36,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:01:36,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:01:36,965 INFO L87 Difference]: Start difference. First operand 25693 states and 31349 transitions. Second operand 27 states. [2019-09-10 08:01:37,765 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 08:01:39,071 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:01:39,356 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:01:39,737 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:01:39,934 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 08:01:40,852 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:01:41,088 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:01:41,402 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:01:41,595 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:01:42,490 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:01:42,822 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 08:01:43,158 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:01:43,372 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:01:43,826 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:01:44,166 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:01:44,490 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 08:01:44,790 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:01:45,119 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 08:01:47,336 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 08:01:47,662 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 08:01:47,887 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:01:48,177 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:01:48,395 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:01:48,607 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:01:48,802 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 08:01:49,212 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 08:01:49,496 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 08:01:49,839 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 08:01:50,137 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:01:50,360 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:01:50,766 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:01:51,067 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 08:01:51,309 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:01:51,593 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:01:52,163 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 08:01:52,434 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:01:52,645 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:01:53,128 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:01:54,988 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:01:55,764 WARN L188 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 08:01:55,993 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:01:56,234 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 08:01:56,558 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:01:56,806 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:01:57,096 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 08:01:57,261 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:01:57,489 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:02:00,687 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 08:02:01,255 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-09-10 08:02:01,765 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 08:02:02,498 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:02:03,020 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 08:02:03,586 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 08:02:04,183 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 08:02:04,739 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-09-10 08:02:05,337 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:02:05,736 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 08:02:06,092 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 08:02:06,418 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:02:06,872 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 08:02:07,173 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 08:02:07,481 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 08:02:07,929 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:02:08,261 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:02:08,493 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 08:02:08,757 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 08:02:16,092 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:02:16,412 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:02:16,818 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 08:02:17,044 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 08:02:17,351 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:02:17,628 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 08:02:17,802 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:02:18,052 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:02:18,343 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 08:02:20,721 WARN L188 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:02:20,961 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:02:21,278 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:02:21,609 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:02:21,934 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:02:22,277 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:02:22,649 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 08:02:23,047 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 08:02:23,359 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 08:02:23,662 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:02:24,130 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 08:02:24,498 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 08:02:24,973 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:02:25,307 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 08:02:25,624 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 08:02:26,104 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 08:02:26,428 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 08:02:26,731 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:02:26,930 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:02:27,163 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 08:02:27,437 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 08:02:27,875 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 08:02:28,179 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 08:02:28,435 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 08:02:28,749 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 08:02:29,150 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 08:02:29,652 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 08:02:30,016 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 08:02:32,522 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 08:02:34,002 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 08:02:34,388 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 08:02:34,916 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-10 08:02:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:02:35,232 INFO L93 Difference]: Finished difference Result 222563 states and 269634 transitions. [2019-09-10 08:02:35,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-10 08:02:35,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 228 [2019-09-10 08:02:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:02:35,696 INFO L225 Difference]: With dead ends: 222563 [2019-09-10 08:02:35,696 INFO L226 Difference]: Without dead ends: 222563 [2019-09-10 08:02:35,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 328 SyntacticMatches, 114 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8231 ImplicationChecksByTransitivity, 71.7s TimeCoverageRelationStatistics Valid=4422, Invalid=17039, Unknown=1, NotChecked=0, Total=21462 [2019-09-10 08:02:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222563 states. [2019-09-10 08:02:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222563 to 41677. [2019-09-10 08:02:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41677 states. [2019-09-10 08:02:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41677 states to 41677 states and 50761 transitions. [2019-09-10 08:02:38,724 INFO L78 Accepts]: Start accepts. Automaton has 41677 states and 50761 transitions. Word has length 228 [2019-09-10 08:02:38,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:02:38,725 INFO L475 AbstractCegarLoop]: Abstraction has 41677 states and 50761 transitions. [2019-09-10 08:02:38,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:02:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 41677 states and 50761 transitions. [2019-09-10 08:02:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:02:38,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:02:38,744 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:38,744 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:02:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:38,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2021402519, now seen corresponding path program 1 times [2019-09-10 08:02:38,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:02:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:38,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:02:38,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:02:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:39,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:39,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:02:39,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2019-09-10 08:02:39,174 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [198], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [237], [239], [241], [244], [247], [250], [252], [254], [257], [264], [266], [270], [288], [301], [314], [327], [340], [343], [350], [352], [356], [359], [364], [372], [374], [377], [380], [383], [385], [387], [390], [393], [396], [398], [400], [403], [406], [409], [411], [413], [416], [419], [424], [426], [429], [432], [438], [442], [444], [447], [450], [452], [460], [462], [465], [473], [475], [478], [486], [488], [491], [494], [499], [501], [504], [512], [514], [517], [520], [526], [529], [530], [532], [534], [537], [548], [557], [559], [562], [565], [567], [575], [578], [584], [587], [590], [592], [607], [609], [612], [615], [617], [632], [634], [637], [640], [642], [657], [661], [664], [667], [669], [677], [680], [693], [696], [800], [802], [827], [830], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [970], [973], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:02:39,179 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:02:39,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:02:39,201 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:02:39,627 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:02:39,628 INFO L272 AbstractInterpreter]: Visited 221 different actions 768 times. Merged at 54 different actions 475 times. Widened at 21 different actions 81 times. Performed 2703 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2703 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 58 fixpoints after 16 different actions. Largest state had 181 variables. [2019-09-10 08:02:39,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:02:39,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:02:39,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:02:39,629 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:02:39,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:02:39,655 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:02:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:02:39,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 08:02:39,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:02:40,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:40,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:02:40,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:41,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:41,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:41,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:41,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:52,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:02:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:02:53,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:02:53,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2019-09-10 08:02:53,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:02:53,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:02:53,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:02:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:02:53,438 INFO L87 Difference]: Start difference. First operand 41677 states and 50761 transitions. Second operand 23 states. [2019-09-10 08:02:53,627 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 08:02:54,496 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-10 08:02:55,084 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-09-10 08:02:55,391 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-10 08:02:56,908 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:02:57,163 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:02:57,504 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:02:57,782 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:03:00,694 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:03:00,971 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-10 08:03:01,298 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 08:03:01,591 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:03:02,064 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-10 08:03:02,502 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-10 08:03:02,733 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 08:03:03,109 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 08:03:04,274 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-10 08:03:04,524 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:03:04,911 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 08:03:05,676 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 08:03:06,008 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:03:06,980 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-10 08:03:07,253 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 08:03:07,671 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 08:03:07,891 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:03:08,175 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-10 08:03:08,649 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 08:03:08,982 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 08:03:09,702 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 08:03:10,009 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:03:10,599 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 08:03:10,972 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 08:03:11,448 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-10 08:03:11,922 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 08:03:12,252 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:03:13,042 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 08:03:13,387 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 08:03:18,578 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:03:19,623 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 08:03:20,025 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 08:03:23,708 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:03:24,323 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-09-10 08:03:24,681 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 08:03:25,846 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-10 08:03:26,235 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 08:03:26,541 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:03:26,785 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 08:03:27,437 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 08:03:27,797 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 08:03:28,069 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:03:31,752 WARN L188 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 08:03:32,451 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-09-10 08:03:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:33,585 INFO L93 Difference]: Finished difference Result 184881 states and 228535 transitions. [2019-09-10 08:03:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 08:03:33,585 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 228 [2019-09-10 08:03:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:33,788 INFO L225 Difference]: With dead ends: 184881 [2019-09-10 08:03:33,788 INFO L226 Difference]: Without dead ends: 184881 [2019-09-10 08:03:33,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 331 SyntacticMatches, 107 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3393 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=1803, Invalid=6029, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 08:03:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184881 states. [2019-09-10 08:03:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184881 to 120739. [2019-09-10 08:03:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120739 states. [2019-09-10 08:03:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120739 states to 120739 states and 145674 transitions. [2019-09-10 08:03:35,277 INFO L78 Accepts]: Start accepts. Automaton has 120739 states and 145674 transitions. Word has length 228 [2019-09-10 08:03:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:35,278 INFO L475 AbstractCegarLoop]: Abstraction has 120739 states and 145674 transitions. [2019-09-10 08:03:35,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:03:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 120739 states and 145674 transitions. [2019-09-10 08:03:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 08:03:35,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:35,317 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:35,317 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:35,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1466102844, now seen corresponding path program 1 times [2019-09-10 08:03:35,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:35,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:03:35,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:35,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:03:35,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:35,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:03:35,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:03:35,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:03:35,824 INFO L87 Difference]: Start difference. First operand 120739 states and 145674 transitions. Second operand 12 states. [2019-09-10 08:03:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:37,776 INFO L93 Difference]: Finished difference Result 292329 states and 353709 transitions. [2019-09-10 08:03:37,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:03:37,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2019-09-10 08:03:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:38,236 INFO L225 Difference]: With dead ends: 292329 [2019-09-10 08:03:38,236 INFO L226 Difference]: Without dead ends: 292329 [2019-09-10 08:03:38,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:03:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292329 states. [2019-09-10 08:03:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292329 to 99065. [2019-09-10 08:03:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99065 states. [2019-09-10 08:03:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99065 states to 99065 states and 119881 transitions. [2019-09-10 08:03:43,162 INFO L78 Accepts]: Start accepts. Automaton has 99065 states and 119881 transitions. Word has length 228 [2019-09-10 08:03:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:43,163 INFO L475 AbstractCegarLoop]: Abstraction has 99065 states and 119881 transitions. [2019-09-10 08:03:43,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:03:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 99065 states and 119881 transitions. [2019-09-10 08:03:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 08:03:43,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:43,193 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:43,193 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash -939026981, now seen corresponding path program 1 times [2019-09-10 08:03:43,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:43,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:43,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:43,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:43,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:03:43,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:03:43,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:03:43,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:43,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:03:43,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:03:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:03:43,264 INFO L87 Difference]: Start difference. First operand 99065 states and 119881 transitions. Second operand 4 states. [2019-09-10 08:03:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:03:43,658 INFO L93 Difference]: Finished difference Result 99301 states and 120116 transitions. [2019-09-10 08:03:43,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:03:43,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-10 08:03:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:03:43,774 INFO L225 Difference]: With dead ends: 99301 [2019-09-10 08:03:43,774 INFO L226 Difference]: Without dead ends: 99301 [2019-09-10 08:03:43,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:03:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99301 states. [2019-09-10 08:03:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99301 to 98873. [2019-09-10 08:03:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98873 states. [2019-09-10 08:03:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98873 states to 98873 states and 119655 transitions. [2019-09-10 08:03:47,286 INFO L78 Accepts]: Start accepts. Automaton has 98873 states and 119655 transitions. Word has length 229 [2019-09-10 08:03:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:03:47,287 INFO L475 AbstractCegarLoop]: Abstraction has 98873 states and 119655 transitions. [2019-09-10 08:03:47,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:03:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 98873 states and 119655 transitions. [2019-09-10 08:03:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 08:03:47,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:03:47,314 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:47,314 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:03:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1029095722, now seen corresponding path program 1 times [2019-09-10 08:03:47,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:03:47,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:47,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:03:47,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:03:47,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:03:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:03:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:03:47,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:03:47,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:03:47,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2019-09-10 08:03:47,709 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [237], [239], [241], [244], [247], [252], [254], [257], [264], [266], [270], [288], [301], [314], [327], [340], [343], [350], [352], [356], [359], [364], [367], [370], [372], [374], [377], [385], [387], [390], [393], [396], [398], [400], [403], [406], [409], [411], [413], [416], [419], [422], [424], [426], [429], [436], [438], [442], [444], [447], [452], [460], [462], [465], [473], [475], [478], [486], [488], [491], [494], [499], [501], [504], [512], [514], [517], [524], [526], [529], [530], [532], [541], [544], [548], [557], [559], [562], [565], [567], [575], [578], [584], [587], [590], [592], [607], [609], [612], [615], [617], [632], [634], [637], [640], [642], [657], [659], [661], [664], [667], [669], [684], [687], [775], [802], [827], [830], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [970], [973], [979], [982], [1079], [1084], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:03:47,715 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:03:47,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:03:47,736 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:03:47,789 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:03:47,789 INFO L272 AbstractInterpreter]: Visited 102 different actions 102 times. Never merged. Never widened. Performed 523 root evaluator evaluations with a maximum evaluation depth of 5. Performed 523 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 181 variables. [2019-09-10 08:03:47,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:03:47,789 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:03:48,227 INFO L227 lantSequenceWeakener]: Weakened 74 states. On average, predicates are now at 76.94% of their original sizes. [2019-09-10 08:03:48,228 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:03:53,879 INFO L420 sIntCurrentIteration]: We unified 228 AI predicates to 228 [2019-09-10 08:03:53,879 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:03:53,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:03:53,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [12] total 65 [2019-09-10 08:03:53,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:03:53,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 08:03:53,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 08:03:53,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2724, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 08:03:53,882 INFO L87 Difference]: Start difference. First operand 98873 states and 119655 transitions. Second operand 55 states. [2019-09-10 08:05:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:09,095 INFO L93 Difference]: Finished difference Result 98818 states and 119573 transitions. [2019-09-10 08:05:09,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 08:05:09,095 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 229 [2019-09-10 08:05:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:09,207 INFO L225 Difference]: With dead ends: 98818 [2019-09-10 08:05:09,208 INFO L226 Difference]: Without dead ends: 98813 [2019-09-10 08:05:09,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=697, Invalid=8615, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 08:05:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98813 states. [2019-09-10 08:05:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98813 to 98753. [2019-09-10 08:05:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98753 states. [2019-09-10 08:05:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98753 states to 98753 states and 119499 transitions. [2019-09-10 08:05:10,364 INFO L78 Accepts]: Start accepts. Automaton has 98753 states and 119499 transitions. Word has length 229 [2019-09-10 08:05:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:10,365 INFO L475 AbstractCegarLoop]: Abstraction has 98753 states and 119499 transitions. [2019-09-10 08:05:10,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 08:05:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 98753 states and 119499 transitions. [2019-09-10 08:05:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 08:05:10,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:10,395 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:10,395 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash -742863903, now seen corresponding path program 1 times [2019-09-10 08:05:10,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:10,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:10,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:10,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:10,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:05:10,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2019-09-10 08:05:10,791 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [237], [239], [241], [244], [247], [250], [252], [254], [257], [264], [266], [270], [288], [301], [314], [327], [340], [343], [350], [352], [356], [359], [364], [367], [370], [372], [374], [377], [385], [387], [390], [393], [396], [398], [400], [403], [406], [409], [411], [413], [416], [419], [424], [426], [429], [432], [438], [442], [444], [447], [450], [452], [460], [462], [465], [473], [475], [478], [486], [488], [491], [494], [499], [501], [504], [512], [514], [517], [520], [526], [529], [530], [532], [534], [537], [548], [557], [559], [562], [565], [567], [575], [578], [584], [587], [590], [592], [607], [609], [612], [615], [617], [632], [634], [637], [640], [642], [657], [661], [664], [667], [669], [677], [680], [693], [696], [775], [802], [827], [830], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [970], [973], [1079], [1084], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:05:10,796 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:05:10,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:05:10,813 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:05:11,169 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:05:11,170 INFO L272 AbstractInterpreter]: Visited 222 different actions 820 times. Merged at 54 different actions 520 times. Widened at 22 different actions 94 times. Performed 2888 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2888 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 64 fixpoints after 15 different actions. Largest state had 181 variables. [2019-09-10 08:05:11,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:11,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:05:11,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:11,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:05:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:11,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:05:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:11,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:05:11,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:05:11,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:12,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:05:12,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:12,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:22,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:23,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:05:23,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:05:23,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:05:23,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:05:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:05:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:05:23,342 INFO L87 Difference]: Start difference. First operand 98753 states and 119499 transitions. Second operand 20 states. [2019-09-10 08:05:23,844 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:05:24,370 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 08:05:25,390 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:05:25,620 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:05:26,153 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:05:26,415 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:05:26,879 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:05:27,174 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:05:27,638 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:05:27,886 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:05:28,308 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:05:28,988 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:05:29,436 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:05:29,772 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:05:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:30,004 INFO L93 Difference]: Finished difference Result 180745 states and 221607 transitions. [2019-09-10 08:05:30,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:05:30,004 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 229 [2019-09-10 08:05:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:30,168 INFO L225 Difference]: With dead ends: 180745 [2019-09-10 08:05:30,168 INFO L226 Difference]: Without dead ends: 180745 [2019-09-10 08:05:30,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 323 SyntacticMatches, 122 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:05:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180745 states. [2019-09-10 08:05:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180745 to 118413. [2019-09-10 08:05:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118413 states. [2019-09-10 08:05:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118413 states to 118413 states and 143013 transitions. [2019-09-10 08:05:32,107 INFO L78 Accepts]: Start accepts. Automaton has 118413 states and 143013 transitions. Word has length 229 [2019-09-10 08:05:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:32,108 INFO L475 AbstractCegarLoop]: Abstraction has 118413 states and 143013 transitions. [2019-09-10 08:05:32,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:05:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 118413 states and 143013 transitions. [2019-09-10 08:05:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 08:05:32,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:32,140 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:32,140 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 162500439, now seen corresponding path program 1 times [2019-09-10 08:05:32,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:32,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:32,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:32,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:32,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:05:32,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2019-09-10 08:05:32,500 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [237], [239], [241], [244], [247], [250], [252], [254], [257], [264], [266], [270], [288], [301], [314], [327], [340], [343], [350], [352], [356], [359], [364], [367], [372], [374], [377], [385], [387], [390], [393], [396], [398], [400], [403], [406], [409], [411], [413], [416], [419], [422], [424], [426], [429], [432], [438], [442], [444], [447], [450], [452], [460], [462], [465], [473], [475], [478], [486], [488], [491], [494], [499], [501], [504], [512], [514], [517], [520], [526], [529], [530], [532], [534], [537], [548], [557], [559], [562], [565], [567], [575], [578], [584], [587], [590], [592], [607], [609], [612], [615], [617], [632], [634], [637], [640], [642], [657], [661], [664], [667], [669], [677], [680], [775], [793], [796], [802], [827], [830], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [970], [973], [1079], [1084], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:05:32,503 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:05:32,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:05:32,519 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:05:32,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:05:32,829 INFO L272 AbstractInterpreter]: Visited 222 different actions 769 times. Merged at 54 different actions 475 times. Widened at 21 different actions 78 times. Performed 2635 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2635 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 58 fixpoints after 16 different actions. Largest state had 181 variables. [2019-09-10 08:05:32,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:32,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:05:32,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:32,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:05:32,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:32,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:05:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:33,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:05:33,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:05:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:33,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:33,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:05:34,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:34,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:36,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:36,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:05:36,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 08:05:36,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:05:36,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:05:36,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:05:36,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:05:36,929 INFO L87 Difference]: Start difference. First operand 118413 states and 143013 transitions. Second operand 20 states. [2019-09-10 08:05:37,084 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 08:05:37,582 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 08:05:37,974 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:05:38,193 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:05:39,458 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:05:39,715 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:05:40,178 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:05:40,561 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:05:40,852 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:05:41,293 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:05:41,474 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:05:42,320 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:05:42,503 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:05:42,845 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:05:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:45,259 INFO L93 Difference]: Finished difference Result 219021 states and 264755 transitions. [2019-09-10 08:05:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:05:45,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 229 [2019-09-10 08:05:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:45,508 INFO L225 Difference]: With dead ends: 219021 [2019-09-10 08:05:45,508 INFO L226 Difference]: Without dead ends: 219021 [2019-09-10 08:05:45,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 413 SyntacticMatches, 32 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:05:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219021 states. [2019-09-10 08:05:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219021 to 119041. [2019-09-10 08:05:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119041 states. [2019-09-10 08:05:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119041 states to 119041 states and 143788 transitions. [2019-09-10 08:05:47,332 INFO L78 Accepts]: Start accepts. Automaton has 119041 states and 143788 transitions. Word has length 229 [2019-09-10 08:05:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:47,332 INFO L475 AbstractCegarLoop]: Abstraction has 119041 states and 143788 transitions. [2019-09-10 08:05:47,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:05:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 119041 states and 143788 transitions. [2019-09-10 08:05:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 08:05:47,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:47,364 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:47,364 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1728692062, now seen corresponding path program 1 times [2019-09-10 08:05:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:47,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:47,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:47,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:48,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:48,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:05:48,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2019-09-10 08:05:48,301 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [237], [239], [241], [244], [247], [250], [252], [254], [257], [264], [266], [270], [288], [301], [314], [327], [340], [343], [350], [352], [356], [359], [364], [367], [372], [374], [377], [385], [387], [390], [393], [398], [400], [403], [406], [409], [411], [413], [416], [419], [422], [424], [426], [429], [432], [438], [442], [444], [447], [450], [452], [460], [462], [465], [473], [475], [478], [481], [486], [488], [491], [499], [501], [504], [512], [514], [517], [520], [526], [529], [530], [532], [534], [537], [548], [557], [559], [562], [565], [567], [582], [584], [587], [590], [592], [600], [603], [609], [612], [615], [617], [632], [634], [637], [640], [642], [657], [661], [664], [667], [669], [677], [680], [743], [748], [775], [793], [796], [802], [827], [830], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [970], [973], [1079], [1084], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:05:48,305 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:05:48,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:05:48,324 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:05:48,596 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:05:48,596 INFO L272 AbstractInterpreter]: Visited 223 different actions 733 times. Merged at 54 different actions 442 times. Widened at 21 different actions 71 times. Performed 2515 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2515 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 53 fixpoints after 16 different actions. Largest state had 181 variables. [2019-09-10 08:05:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:48,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:05:48,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:05:48,597 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:05:48,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:48,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:05:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:48,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 08:05:48,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:05:48,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:49,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:05:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:49,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:05:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:50,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:05:50,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 13] total 40 [2019-09-10 08:05:50,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:05:50,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 08:05:50,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 08:05:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:05:50,736 INFO L87 Difference]: Start difference. First operand 119041 states and 143788 transitions. Second operand 29 states. [2019-09-10 08:05:51,050 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 08:05:52,085 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:05:52,895 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:05:53,369 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:05:53,845 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:05:54,278 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:05:55,631 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:05:55,998 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:05:56,321 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 08:05:56,850 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 08:05:57,887 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:05:58,332 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 08:05:59,711 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:06:00,286 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 08:06:00,724 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 08:06:01,311 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:06:01,863 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:06:02,852 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 08:06:03,702 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 08:06:04,198 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 08:06:04,966 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 08:06:05,418 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 08:06:05,906 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:06:06,462 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:06:06,800 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 08:06:07,391 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-10 08:06:08,069 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-10 08:06:08,620 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:06:09,618 WARN L188 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-09-10 08:06:10,710 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-09-10 08:06:12,364 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2019-09-10 08:06:13,029 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 08:06:13,649 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-10 08:06:14,378 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2019-09-10 08:06:15,010 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 08:06:15,627 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 08:06:16,309 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2019-09-10 08:06:17,221 WARN L188 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-09-10 08:06:19,570 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:06:20,355 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 08:06:20,715 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:06:21,697 WARN L188 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2019-09-10 08:06:22,280 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:06:22,723 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:06:23,312 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 08:06:24,320 WARN L188 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 109 [2019-09-10 08:06:24,782 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:06:25,899 WARN L188 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:06:26,706 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2019-09-10 08:06:27,258 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 08:06:28,384 WARN L188 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 109 [2019-09-10 08:06:28,987 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:06:29,888 WARN L188 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2019-09-10 08:06:30,465 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 08:06:31,188 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 08:06:31,819 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:06:32,601 WARN L188 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2019-09-10 08:06:33,348 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-09-10 08:06:34,191 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-09-10 08:06:34,925 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-10 08:06:35,854 WARN L188 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 109 [2019-09-10 08:06:36,391 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 08:06:36,862 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 08:06:37,333 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 08:06:37,955 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-10 08:06:38,829 WARN L188 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2019-09-10 08:06:39,569 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 08:06:40,170 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 08:06:40,896 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:06:41,671 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2019-09-10 08:06:44,319 WARN L188 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:06:45,594 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:06:46,624 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:06:47,461 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:06:48,029 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-09-10 08:06:49,172 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-09-10 08:06:49,710 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-10 08:06:50,206 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:06:50,865 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 08:06:51,562 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 109 [2019-09-10 08:06:52,575 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-10 08:06:53,707 WARN L188 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 08:06:54,140 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 08:06:54,673 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:06:55,132 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 08:06:55,764 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-09-10 08:06:56,516 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-09-10 08:06:57,650 WARN L188 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2019-09-10 08:06:58,542 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:06:59,162 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-09-10 08:07:00,101 WARN L188 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2019-09-10 08:07:01,092 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 08:07:01,774 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:07:02,633 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:07:06,795 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 08:07:07,912 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 08:07:09,052 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-09-10 08:07:09,597 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-10 08:07:10,547 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2019-09-10 08:07:11,493 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 08:07:12,291 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 08:07:14,224 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2019-09-10 08:07:15,061 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-09-10 08:07:16,087 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 108 [2019-09-10 08:07:17,305 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 08:07:18,138 WARN L188 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-09-10 08:07:18,790 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-10 08:07:19,674 WARN L188 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-09-10 08:07:20,292 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-10 08:07:21,219 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2019-09-10 08:07:21,677 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-09-10 08:07:22,272 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-09-10 08:07:22,847 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 08:07:23,489 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 08:07:24,235 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-10 08:07:24,794 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-09-10 08:07:25,856 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-09-10 08:07:26,682 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2019-09-10 08:07:27,806 WARN L188 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-09-10 08:07:28,667 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2019-09-10 08:07:30,034 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-09-10 08:07:30,606 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 08:07:31,182 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2019-09-10 08:07:31,665 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-09-10 08:07:32,303 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 08:07:33,693 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 94 [2019-09-10 08:07:34,394 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 08:07:34,943 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 08:07:35,463 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2019-09-10 08:07:36,383 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 99 [2019-09-10 08:07:37,093 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-09-10 08:07:37,582 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-09-10 08:07:38,165 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-09-10 08:07:39,135 WARN L188 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 110 [2019-09-10 08:07:39,969 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-09-10 08:07:40,844 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2019-09-10 08:07:41,921 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 112 [2019-09-10 08:07:42,592 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 103 [2019-09-10 08:07:44,015 WARN L188 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2019-09-10 08:07:46,405 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2019-09-10 08:07:48,000 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 08:07:48,686 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 08:07:49,238 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:07:49,689 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 08:07:50,333 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:07:50,912 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-09-10 08:07:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:51,728 INFO L93 Difference]: Finished difference Result 713143 states and 850938 transitions. [2019-09-10 08:07:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-10 08:07:51,729 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 230 [2019-09-10 08:07:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:52,523 INFO L225 Difference]: With dead ends: 713143 [2019-09-10 08:07:52,523 INFO L226 Difference]: Without dead ends: 713143 [2019-09-10 08:07:52,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 431 SyntacticMatches, 2 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10629 ImplicationChecksByTransitivity, 86.2s TimeCoverageRelationStatistics Valid=6058, Invalid=29852, Unknown=0, NotChecked=0, Total=35910 [2019-09-10 08:07:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713143 states. [2019-09-10 08:08:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713143 to 213514. [2019-09-10 08:08:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213514 states. [2019-09-10 08:08:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213514 states to 213514 states and 254531 transitions. [2019-09-10 08:08:03,586 INFO L78 Accepts]: Start accepts. Automaton has 213514 states and 254531 transitions. Word has length 230 [2019-09-10 08:08:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:03,586 INFO L475 AbstractCegarLoop]: Abstraction has 213514 states and 254531 transitions. [2019-09-10 08:08:03,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 08:08:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 213514 states and 254531 transitions. [2019-09-10 08:08:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:08:03,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:03,646 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:03,646 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -146932667, now seen corresponding path program 1 times [2019-09-10 08:08:03,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:03,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:03,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:04,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:04,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:04,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2019-09-10 08:08:04,165 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [198], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [237], [239], [241], [244], [247], [250], [252], [254], [257], [264], [266], [270], [288], [301], [314], [327], [340], [343], [350], [352], [356], [359], [364], [367], [370], [372], [374], [377], [380], [383], [385], [387], [390], [393], [398], [400], [403], [406], [409], [411], [413], [416], [419], [424], [426], [429], [432], [438], [442], [444], [447], [450], [452], [460], [462], [465], [468], [473], [475], [478], [481], [484], [486], [488], [491], [499], [501], [504], [512], [514], [517], [520], [526], [529], [530], [532], [534], [537], [548], [557], [559], [562], [565], [567], [582], [584], [587], [590], [592], [609], [612], [615], [617], [625], [628], [634], [637], [640], [642], [657], [661], [664], [667], [669], [677], [680], [693], [696], [743], [748], [802], [827], [830], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [970], [973], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:08:04,167 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:04,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:04,184 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:04,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:04,478 INFO L272 AbstractInterpreter]: Visited 224 different actions 813 times. Merged at 55 different actions 514 times. Widened at 20 different actions 80 times. Performed 2833 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2833 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 64 fixpoints after 19 different actions. Largest state had 181 variables. [2019-09-10 08:08:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:04,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:04,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:04,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:04,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:04,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:08:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:04,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 08:08:04,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:04,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:05,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:06,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:07,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:07,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:09,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:08:09,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 43 [2019-09-10 08:08:09,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:08:09,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:08:09,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:08:09,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:08:09,902 INFO L87 Difference]: Start difference. First operand 213514 states and 254531 transitions. Second operand 27 states. [2019-09-10 08:08:10,159 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 08:08:11,188 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:08:11,990 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 08:08:12,327 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 08:08:12,924 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 08:08:13,727 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:08:14,239 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:08:15,069 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:08:15,762 WARN L188 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:08:16,337 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:08:17,145 WARN L188 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:08:18,652 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:08:19,204 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:08:19,770 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:08:20,201 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 08:08:20,603 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:08:21,097 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:08:21,936 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 08:08:22,341 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 08:08:23,370 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 08:08:23,738 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:08:24,371 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 08:08:24,861 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 08:08:25,338 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 08:08:25,765 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:08:26,177 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 08:08:26,578 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:08:27,207 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:08:27,627 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:08:28,133 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:08:28,716 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 08:08:31,514 WARN L188 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-09-10 08:08:32,619 WARN L188 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 08:08:33,200 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-09-10 08:08:33,789 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-09-10 08:08:34,454 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 08:08:35,069 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 08:08:35,536 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 08:08:36,050 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-09-10 08:08:38,500 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 08:08:39,245 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-09-10 08:08:39,825 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:08:40,298 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 08:08:40,798 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 08:08:41,240 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:08:41,828 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:08:42,323 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-09-10 08:08:43,560 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 08:08:44,292 WARN L188 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 08:08:44,813 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:08:45,386 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 08:08:46,321 WARN L188 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2019-09-10 08:08:47,164 WARN L188 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:08:48,533 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-09-10 08:08:49,369 WARN L188 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:08:50,111 WARN L188 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-09-10 08:08:50,556 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:08:51,016 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 08:08:51,535 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 08:08:52,146 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2019-09-10 08:08:52,605 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:08:53,702 WARN L188 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 08:08:54,364 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-09-10 08:08:54,804 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:08:55,352 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-09-10 08:08:55,994 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:08:56,578 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 08:08:57,032 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:08:57,617 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:08:58,322 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-09-10 08:08:59,018 WARN L188 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:09:00,319 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:09:00,885 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:09:01,163 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:09:02,030 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2019-09-10 08:09:02,698 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-09-10 08:09:03,295 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-09-10 08:09:03,938 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-09-10 08:09:05,871 WARN L188 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:09:06,445 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:09:07,141 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:09:07,545 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:09:08,073 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-09-10 08:09:08,568 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-09-10 08:09:09,606 WARN L188 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:09:10,248 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:09:12,786 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 08:09:13,667 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:09:14,312 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:09:15,795 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 08:09:16,626 WARN L188 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-10 08:09:17,178 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-09-10 08:09:17,548 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 08:09:17,974 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:09:18,587 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-09-10 08:09:19,240 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-09-10 08:09:20,036 WARN L188 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2019-09-10 08:09:20,496 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 08:09:21,361 WARN L188 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2019-09-10 08:09:22,000 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:09:22,488 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-09-10 08:09:23,242 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-10 08:09:23,770 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 08:09:24,378 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:09:25,218 WARN L188 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-09-10 08:09:25,635 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:09:26,785 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:09:30,856 WARN L188 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 08:09:31,707 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:09:32,838 WARN L188 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 08:09:33,966 WARN L188 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:09:34,732 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 08:09:35,249 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:09:36,491 WARN L188 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 08:09:37,386 WARN L188 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:09:38,698 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:09:39,311 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 08:09:39,889 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:09:40,312 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 08:09:40,903 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 08:09:41,697 WARN L188 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:09:42,278 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:09:42,881 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-09-10 08:09:43,948 WARN L188 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-10 08:09:44,641 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 08:09:45,406 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 08:09:46,144 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-09-10 08:09:46,817 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:09:47,817 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 08:09:48,322 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:09:49,912 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 08:09:50,334 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 08:09:50,767 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 08:09:51,251 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 08:09:52,118 WARN L188 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 08:09:52,942 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 08:09:53,573 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:09:53,949 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 08:09:55,305 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 08:09:55,919 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:09:56,672 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:09:57,648 WARN L188 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 08:09:58,225 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 08:09:59,078 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:09:59,651 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-09-10 08:10:00,228 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-09-10 08:10:01,227 WARN L188 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-09-10 08:10:01,836 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 08:10:02,433 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-09-10 08:10:03,291 WARN L188 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:10:04,025 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 08:10:04,784 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-09-10 08:10:05,336 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 08:10:05,828 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-09-10 08:10:06,867 WARN L188 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-09-10 08:10:07,411 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-10 08:10:08,062 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 08:10:08,683 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-09-10 08:10:09,215 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2019-09-10 08:10:09,753 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-09-10 08:10:10,464 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-09-10 08:10:11,165 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:10:11,745 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:10:12,278 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-10 08:10:12,745 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-09-10 08:10:13,326 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:10:15,207 WARN L188 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-10 08:10:15,874 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-10 08:10:16,682 WARN L188 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-09-10 08:10:17,251 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 08:10:17,964 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-10 08:10:18,499 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 08:10:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:19,499 INFO L93 Difference]: Finished difference Result 1186730 states and 1395120 transitions. [2019-09-10 08:10:19,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-10 08:10:19,499 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 231 [2019-09-10 08:10:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:22,383 INFO L225 Difference]: With dead ends: 1186730 [2019-09-10 08:10:22,383 INFO L226 Difference]: Without dead ends: 1186730 [2019-09-10 08:10:22,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 404 SyntacticMatches, 28 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15788 ImplicationChecksByTransitivity, 110.5s TimeCoverageRelationStatistics Valid=8940, Invalid=38802, Unknown=0, NotChecked=0, Total=47742 [2019-09-10 08:10:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186730 states. [2019-09-10 08:10:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186730 to 260964. [2019-09-10 08:10:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260964 states. [2019-09-10 08:10:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260964 states to 260964 states and 310025 transitions. [2019-09-10 08:10:36,393 INFO L78 Accepts]: Start accepts. Automaton has 260964 states and 310025 transitions. Word has length 231 [2019-09-10 08:10:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:36,393 INFO L475 AbstractCegarLoop]: Abstraction has 260964 states and 310025 transitions. [2019-09-10 08:10:36,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:10:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 260964 states and 310025 transitions. [2019-09-10 08:10:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 08:10:36,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:36,463 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:10:36,463 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash 472604813, now seen corresponding path program 1 times [2019-09-10 08:10:36,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:36,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:36,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:36,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:10:36,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:36,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:10:36,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:36,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:10:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:10:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:10:36,810 INFO L87 Difference]: Start difference. First operand 260964 states and 310025 transitions. Second operand 15 states. [2019-09-10 08:10:38,957 WARN L188 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-10 08:10:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:43,628 INFO L93 Difference]: Finished difference Result 704927 states and 840343 transitions. [2019-09-10 08:10:43,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:10:43,629 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 231 [2019-09-10 08:10:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:44,361 INFO L225 Difference]: With dead ends: 704927 [2019-09-10 08:10:44,361 INFO L226 Difference]: Without dead ends: 704927 [2019-09-10 08:10:44,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=348, Invalid=1292, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:10:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704927 states. [2019-09-10 08:10:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704927 to 260724. [2019-09-10 08:10:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260724 states. [2019-09-10 08:11:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260724 states to 260724 states and 309673 transitions. [2019-09-10 08:11:01,199 INFO L78 Accepts]: Start accepts. Automaton has 260724 states and 309673 transitions. Word has length 231 [2019-09-10 08:11:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:01,200 INFO L475 AbstractCegarLoop]: Abstraction has 260724 states and 309673 transitions. [2019-09-10 08:11:01,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:11:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 260724 states and 309673 transitions. [2019-09-10 08:11:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 08:11:01,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:01,270 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:01,270 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash -438735756, now seen corresponding path program 1 times [2019-09-10 08:11:01,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:01,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:01,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:01,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:01,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:11:01,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:01,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:11:01,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:01,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:11:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:11:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:11:01,369 INFO L87 Difference]: Start difference. First operand 260724 states and 309673 transitions. Second operand 5 states. [2019-09-10 08:11:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:02,458 INFO L93 Difference]: Finished difference Result 567062 states and 675223 transitions. [2019-09-10 08:11:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:11:02,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-09-10 08:11:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:03,718 INFO L225 Difference]: With dead ends: 567062 [2019-09-10 08:11:03,718 INFO L226 Difference]: Without dead ends: 566942 [2019-09-10 08:11:03,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:11:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566942 states. [2019-09-10 08:11:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566942 to 566714. [2019-09-10 08:11:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566714 states. [2019-09-10 08:11:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566714 states to 566714 states and 674876 transitions. [2019-09-10 08:11:14,754 INFO L78 Accepts]: Start accepts. Automaton has 566714 states and 674876 transitions. Word has length 232 [2019-09-10 08:11:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:14,755 INFO L475 AbstractCegarLoop]: Abstraction has 566714 states and 674876 transitions. [2019-09-10 08:11:14,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:11:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 566714 states and 674876 transitions. [2019-09-10 08:11:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 08:11:20,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:20,770 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:20,771 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:20,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -369087882, now seen corresponding path program 1 times [2019-09-10 08:11:20,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:20,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:20,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:21,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:11:21,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:11:21,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-09-10 08:11:21,044 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], [95], [98], [116], [129], [142], [155], [168], [171], [178], [180], [184], [187], [192], [195], [198], [200], [202], [205], [208], [211], [213], [215], [218], [221], [224], [226], [228], [231], [234], [237], [239], [241], [244], [247], [252], [254], [257], [264], [266], [270], [288], [301], [314], [327], [340], [343], [350], [352], [356], [359], [364], [367], [370], [372], [374], [377], [380], [383], [385], [387], [390], [393], [396], [398], [400], [403], [406], [409], [411], [413], [416], [419], [424], [426], [429], [432], [438], [442], [444], [447], [450], [452], [460], [462], [465], [468], [473], [475], [478], [481], [484], [486], [488], [491], [494], [497], [499], [501], [504], [512], [514], [517], [520], [526], [529], [530], [532], [534], [537], [548], [557], [559], [562], [565], [567], [584], [587], [590], [592], [609], [612], [615], [617], [625], [628], [634], [637], [640], [642], [657], [661], [664], [667], [669], [677], [680], [693], [696], [802], [827], [830], [845], [848], [851], [853], [870], [873], [876], [878], [895], [898], [901], [903], [920], [923], [926], [928], [947], [950], [953], [955], [970], [973], [979], [984], [1088], [1113], [1116], [1131], [1134], [1137], [1139], [1156], [1159], [1162], [1164], [1181], [1184], [1187], [1189], [1206], [1209], [1212], [1214], [1233], [1236], [1239], [1241], [1313], [1314], [1318], [1319], [1320] [2019-09-10 08:11:21,046 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:11:21,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:11:21,058 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:11:21,451 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:11:21,452 INFO L272 AbstractInterpreter]: Visited 225 different actions 881 times. Merged at 56 different actions 577 times. Widened at 18 different actions 76 times. Performed 3016 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3016 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 69 fixpoints after 17 different actions. Largest state had 181 variables. [2019-09-10 08:11:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:21,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:11:21,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:11:21,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:11:21,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:21,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:11:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:21,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:11:21,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:11:21,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:21,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:22,148 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:11:22,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:22,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:22,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:22,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:22,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:24,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:24,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:11:24,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2019-09-10 08:11:24,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:11:24,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:11:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:11:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:11:24,324 INFO L87 Difference]: Start difference. First operand 566714 states and 674876 transitions. Second operand 20 states.