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-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:21:26,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:21:26,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:21:26,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:21:26,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:21:26,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:21:26,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:21:26,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:21:26,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:21:26,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:21:26,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:21:26,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:21:26,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:21:26,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:21:26,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:21:26,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:21:26,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:21:26,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:21:26,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:21:26,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:21:26,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:21:26,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:21:26,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:21:26,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:21:26,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:21:26,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:21:26,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:21:26,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:21:26,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:21:26,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:21:26,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:21:26,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:21:26,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:21:26,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:21:26,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:21:26,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:21:26,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:21:26,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:21:26,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:21:26,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:21:26,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:21:26,216 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:21:26,232 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:21:26,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:21:26,232 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:21:26,233 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:21:26,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:21:26,233 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:21:26,234 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:21:26,234 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:21:26,234 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:21:26,234 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:21:26,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:21:26,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:21:26,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:21:26,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:21:26,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:21:26,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:21:26,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:21:26,236 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:21:26,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:21:26,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:21:26,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:21:26,237 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:21:26,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:21:26,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:21:26,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:21:26,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:21:26,238 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:21:26,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:21:26,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:21:26,239 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:21:26,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:21:26,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:21:26,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:21:26,285 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:21:26,286 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:21:26,286 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:21:26,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17101ea13/a186ce12408343b1ade0dc310d74ab65/FLAGf20c2e40f [2019-09-10 07:21:26,919 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:21:26,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:21:26,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17101ea13/a186ce12408343b1ade0dc310d74ab65/FLAGf20c2e40f [2019-09-10 07:21:27,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17101ea13/a186ce12408343b1ade0dc310d74ab65 [2019-09-10 07:21:27,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:21:27,212 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:21:27,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:21:27,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:21:27,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:21:27,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:21:27" (1/1) ... [2019-09-10 07:21:27,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5735c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:27, skipping insertion in model container [2019-09-10 07:21:27,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:21:27" (1/1) ... [2019-09-10 07:21:27,230 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:21:27,289 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:21:27,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:21:27,838 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:21:28,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:21:28,046 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:21:28,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28 WrapperNode [2019-09-10 07:21:28,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:21:28,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:21:28,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:21:28,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:21:28,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28" (1/1) ... [2019-09-10 07:21:28,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28" (1/1) ... [2019-09-10 07:21:28,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28" (1/1) ... [2019-09-10 07:21:28,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:21:28" (1/1) ... [2019-09-10 07:21:28,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28" (1/1) ... [2019-09-10 07:21:28,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28" (1/1) ... [2019-09-10 07:21:28,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28" (1/1) ... [2019-09-10 07:21:28,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:21:28,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:21:28,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:21:28,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:21:28,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:21:28,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:21:28,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:21:28,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:21:28,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:21:28,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:21:28,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:21:28,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:21:28,227 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:21:28,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:21:28,227 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:21:28,227 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:21:28,228 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:21:28,228 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:21:28,229 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:21:28,229 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:21:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:21:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:21:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:21:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:21:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:21:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:21:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:21:29,688 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:21:29,688 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:21:29,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:21:29 BoogieIcfgContainer [2019-09-10 07:21:29,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:21:29,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:21:29,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:21:29,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:21:29,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:21:27" (1/3) ... [2019-09-10 07:21:29,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf559b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:21:29, skipping insertion in model container [2019-09-10 07:21:29,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:28" (2/3) ... [2019-09-10 07:21:29,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf559b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:21:29, skipping insertion in model container [2019-09-10 07:21:29,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:21:29" (3/3) ... [2019-09-10 07:21:29,698 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:21:29,710 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:21:29,732 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:21:29,753 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:21:29,786 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:21:29,787 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:21:29,787 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:21:29,787 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:21:29,787 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:21:29,788 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:21:29,788 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:21:29,788 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:21:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states. [2019-09-10 07:21:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:21:29,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:29,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:21:29,834 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash -681392809, now seen corresponding path program 1 times [2019-09-10 07:21:29,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:29,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:29,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:29,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:29,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:30,389 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:21:30,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:30,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:30,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:30,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:30,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:30,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:30,423 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 3 states. [2019-09-10 07:21:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:30,573 INFO L93 Difference]: Finished difference Result 407 states and 675 transitions. [2019-09-10 07:21:30,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:30,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:21:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:30,593 INFO L225 Difference]: With dead ends: 407 [2019-09-10 07:21:30,593 INFO L226 Difference]: Without dead ends: 399 [2019-09-10 07:21:30,596 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:21:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-10 07:21:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-09-10 07:21:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 07:21:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 595 transitions. [2019-09-10 07:21:30,673 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 595 transitions. Word has length 100 [2019-09-10 07:21:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:30,674 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 595 transitions. [2019-09-10 07:21:30,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:21:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 595 transitions. [2019-09-10 07:21:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:21:30,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:30,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:30,680 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:30,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:30,680 INFO L82 PathProgramCache]: Analyzing trace with hash 8970956, now seen corresponding path program 1 times [2019-09-10 07:21:30,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:30,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:30,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:31,229 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:21:31,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:31,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:21:31,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:31,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:21:31,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:21:31,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:21:31,234 INFO L87 Difference]: Start difference. First operand 397 states and 595 transitions. Second operand 8 states. [2019-09-10 07:21:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:31,763 INFO L93 Difference]: Finished difference Result 1668 states and 2578 transitions. [2019-09-10 07:21:31,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:21:31,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-10 07:21:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:31,775 INFO L225 Difference]: With dead ends: 1668 [2019-09-10 07:21:31,776 INFO L226 Difference]: Without dead ends: 1668 [2019-09-10 07:21:31,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:21:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2019-09-10 07:21:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1658. [2019-09-10 07:21:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-09-10 07:21:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2573 transitions. [2019-09-10 07:21:31,859 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2573 transitions. Word has length 101 [2019-09-10 07:21:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:31,863 INFO L475 AbstractCegarLoop]: Abstraction has 1658 states and 2573 transitions. [2019-09-10 07:21:31,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:21:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2573 transitions. [2019-09-10 07:21:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:21:31,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:31,878 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] [2019-09-10 07:21:31,879 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1048744752, now seen corresponding path program 1 times [2019-09-10 07:21:31,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:31,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:31,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:31,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:32,067 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:21:32,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:32,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:21:32,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:32,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:21:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:21:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:21:32,070 INFO L87 Difference]: Start difference. First operand 1658 states and 2573 transitions. Second operand 6 states. [2019-09-10 07:21:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:32,606 INFO L93 Difference]: Finished difference Result 4180 states and 6560 transitions. [2019-09-10 07:21:32,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:21:32,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-10 07:21:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:32,632 INFO L225 Difference]: With dead ends: 4180 [2019-09-10 07:21:32,633 INFO L226 Difference]: Without dead ends: 4180 [2019-09-10 07:21:32,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:21:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2019-09-10 07:21:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 4176. [2019-09-10 07:21:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-09-10 07:21:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6558 transitions. [2019-09-10 07:21:32,744 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6558 transitions. Word has length 102 [2019-09-10 07:21:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:32,745 INFO L475 AbstractCegarLoop]: Abstraction has 4176 states and 6558 transitions. [2019-09-10 07:21:32,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:21:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6558 transitions. [2019-09-10 07:21:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:21:32,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:32,752 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] [2019-09-10 07:21:32,752 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1678520225, now seen corresponding path program 1 times [2019-09-10 07:21:32,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:32,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:32,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:32,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:32,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:32,927 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:21:32,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:32,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:21:32,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:32,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:21:32,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:21:32,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:21:32,930 INFO L87 Difference]: Start difference. First operand 4176 states and 6558 transitions. Second operand 5 states. [2019-09-10 07:21:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:33,370 INFO L93 Difference]: Finished difference Result 7786 states and 12225 transitions. [2019-09-10 07:21:33,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:21:33,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:21:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:33,422 INFO L225 Difference]: With dead ends: 7786 [2019-09-10 07:21:33,423 INFO L226 Difference]: Without dead ends: 7786 [2019-09-10 07:21:33,424 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:21:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2019-09-10 07:21:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 7784. [2019-09-10 07:21:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7784 states. [2019-09-10 07:21:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7784 states to 7784 states and 12224 transitions. [2019-09-10 07:21:33,689 INFO L78 Accepts]: Start accepts. Automaton has 7784 states and 12224 transitions. Word has length 102 [2019-09-10 07:21:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:33,691 INFO L475 AbstractCegarLoop]: Abstraction has 7784 states and 12224 transitions. [2019-09-10 07:21:33,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:21:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7784 states and 12224 transitions. [2019-09-10 07:21:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:21:33,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:33,701 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] [2019-09-10 07:21:33,702 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1939688579, now seen corresponding path program 1 times [2019-09-10 07:21:33,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:33,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:33,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:33,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:33,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:33,909 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:21:33,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:33,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:21:33,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:33,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:21:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:21:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:21:33,912 INFO L87 Difference]: Start difference. First operand 7784 states and 12224 transitions. Second operand 5 states. [2019-09-10 07:21:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:34,373 INFO L93 Difference]: Finished difference Result 14460 states and 22659 transitions. [2019-09-10 07:21:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:21:34,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:21:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:34,468 INFO L225 Difference]: With dead ends: 14460 [2019-09-10 07:21:34,468 INFO L226 Difference]: Without dead ends: 14460 [2019-09-10 07:21:34,469 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:21:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14460 states. [2019-09-10 07:21:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14460 to 14458. [2019-09-10 07:21:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14458 states. [2019-09-10 07:21:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14458 states to 14458 states and 22658 transitions. [2019-09-10 07:21:34,869 INFO L78 Accepts]: Start accepts. Automaton has 14458 states and 22658 transitions. Word has length 102 [2019-09-10 07:21:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:34,869 INFO L475 AbstractCegarLoop]: Abstraction has 14458 states and 22658 transitions. [2019-09-10 07:21:34,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:21:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 14458 states and 22658 transitions. [2019-09-10 07:21:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:21:34,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:34,880 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] [2019-09-10 07:21:34,881 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:34,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash 806073100, now seen corresponding path program 1 times [2019-09-10 07:21:34,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:34,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:34,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:34,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:35,002 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:21:35,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:35,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:21:35,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:35,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:21:35,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:21:35,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:21:35,004 INFO L87 Difference]: Start difference. First operand 14458 states and 22658 transitions. Second operand 5 states. [2019-09-10 07:21:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:35,423 INFO L93 Difference]: Finished difference Result 27716 states and 43381 transitions. [2019-09-10 07:21:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:21:35,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:21:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:36,013 INFO L225 Difference]: With dead ends: 27716 [2019-09-10 07:21:36,013 INFO L226 Difference]: Without dead ends: 27716 [2019-09-10 07:21:36,013 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:21:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27716 states. [2019-09-10 07:21:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27716 to 27714. [2019-09-10 07:21:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27714 states. [2019-09-10 07:21:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27714 states to 27714 states and 43380 transitions. [2019-09-10 07:21:36,443 INFO L78 Accepts]: Start accepts. Automaton has 27714 states and 43380 transitions. Word has length 102 [2019-09-10 07:21:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:36,444 INFO L475 AbstractCegarLoop]: Abstraction has 27714 states and 43380 transitions. [2019-09-10 07:21:36,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:21:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 27714 states and 43380 transitions. [2019-09-10 07:21:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:21:36,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:36,453 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] [2019-09-10 07:21:36,453 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1339566062, now seen corresponding path program 1 times [2019-09-10 07:21:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:36,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:36,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:36,552 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:21:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:36,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:21:36,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:36,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:21:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:21:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:21:36,554 INFO L87 Difference]: Start difference. First operand 27714 states and 43380 transitions. Second operand 5 states. [2019-09-10 07:21:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:37,124 INFO L93 Difference]: Finished difference Result 54540 states and 85044 transitions. [2019-09-10 07:21:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:21:37,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:21:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:37,249 INFO L225 Difference]: With dead ends: 54540 [2019-09-10 07:21:37,250 INFO L226 Difference]: Without dead ends: 54540 [2019-09-10 07:21:37,250 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:21:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54540 states. [2019-09-10 07:21:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54540 to 54538. [2019-09-10 07:21:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54538 states. [2019-09-10 07:21:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54538 states to 54538 states and 85043 transitions. [2019-09-10 07:21:38,169 INFO L78 Accepts]: Start accepts. Automaton has 54538 states and 85043 transitions. Word has length 102 [2019-09-10 07:21:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:38,169 INFO L475 AbstractCegarLoop]: Abstraction has 54538 states and 85043 transitions. [2019-09-10 07:21:38,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:21:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 54538 states and 85043 transitions. [2019-09-10 07:21:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:21:38,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:38,181 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] [2019-09-10 07:21:38,182 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:38,182 INFO L82 PathProgramCache]: Analyzing trace with hash 276610369, now seen corresponding path program 1 times [2019-09-10 07:21:38,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:38,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:38,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:38,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:38,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:38,271 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:21:38,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:38,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:21:38,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:38,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:21:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:21:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:21:38,273 INFO L87 Difference]: Start difference. First operand 54538 states and 85043 transitions. Second operand 5 states. [2019-09-10 07:21:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:39,766 INFO L93 Difference]: Finished difference Result 108556 states and 168306 transitions. [2019-09-10 07:21:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:21:39,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:21:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:40,046 INFO L225 Difference]: With dead ends: 108556 [2019-09-10 07:21:40,047 INFO L226 Difference]: Without dead ends: 108556 [2019-09-10 07:21:40,047 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:21:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108556 states. [2019-09-10 07:21:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108556 to 108554. [2019-09-10 07:21:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108554 states. [2019-09-10 07:21:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108554 states to 108554 states and 168305 transitions. [2019-09-10 07:21:43,147 INFO L78 Accepts]: Start accepts. Automaton has 108554 states and 168305 transitions. Word has length 102 [2019-09-10 07:21:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:43,148 INFO L475 AbstractCegarLoop]: Abstraction has 108554 states and 168305 transitions. [2019-09-10 07:21:43,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:21:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108554 states and 168305 transitions. [2019-09-10 07:21:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:21:43,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:43,169 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] [2019-09-10 07:21:43,169 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1183562943, now seen corresponding path program 1 times [2019-09-10 07:21:43,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:43,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:43,287 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:21:43,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:43,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:21:43,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:43,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:21:43,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:21:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:21:43,289 INFO L87 Difference]: Start difference. First operand 108554 states and 168305 transitions. Second operand 5 states. [2019-09-10 07:21:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:44,197 INFO L93 Difference]: Finished difference Result 205290 states and 316321 transitions. [2019-09-10 07:21:44,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:21:44,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:21:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:44,654 INFO L225 Difference]: With dead ends: 205290 [2019-09-10 07:21:44,654 INFO L226 Difference]: Without dead ends: 205290 [2019-09-10 07:21:44,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:21:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205290 states. [2019-09-10 07:21:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205290 to 109706. [2019-09-10 07:21:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109706 states. [2019-09-10 07:21:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109706 states to 109706 states and 169457 transitions. [2019-09-10 07:21:50,044 INFO L78 Accepts]: Start accepts. Automaton has 109706 states and 169457 transitions. Word has length 103 [2019-09-10 07:21:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:50,044 INFO L475 AbstractCegarLoop]: Abstraction has 109706 states and 169457 transitions. [2019-09-10 07:21:50,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:21:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 109706 states and 169457 transitions. [2019-09-10 07:21:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:21:50,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:50,068 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] [2019-09-10 07:21:50,068 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1986480432, now seen corresponding path program 1 times [2019-09-10 07:21:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:50,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:50,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:50,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:50,331 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:21:50,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:50,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:21:50,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:50,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:21:50,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:21:50,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:21:50,339 INFO L87 Difference]: Start difference. First operand 109706 states and 169457 transitions. Second operand 10 states. [2019-09-10 07:21:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:59,527 INFO L93 Difference]: Finished difference Result 883592 states and 1364813 transitions. [2019-09-10 07:21:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:21:59,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 07:21:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:00,808 INFO L225 Difference]: With dead ends: 883592 [2019-09-10 07:22:00,809 INFO L226 Difference]: Without dead ends: 883592 [2019-09-10 07:22:00,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:22:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883592 states. [2019-09-10 07:22:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883592 to 110023. [2019-09-10 07:22:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110023 states. [2019-09-10 07:22:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110023 states to 110023 states and 169858 transitions. [2019-09-10 07:22:11,234 INFO L78 Accepts]: Start accepts. Automaton has 110023 states and 169858 transitions. Word has length 104 [2019-09-10 07:22:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:11,234 INFO L475 AbstractCegarLoop]: Abstraction has 110023 states and 169858 transitions. [2019-09-10 07:22:11,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:22:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 110023 states and 169858 transitions. [2019-09-10 07:22:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:22:11,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:11,252 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] [2019-09-10 07:22:11,252 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1395487120, now seen corresponding path program 1 times [2019-09-10 07:22:11,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:11,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:11,487 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:22:11,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:11,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:22:11,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:11,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:22:11,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:22:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:22:11,489 INFO L87 Difference]: Start difference. First operand 110023 states and 169858 transitions. Second operand 10 states. [2019-09-10 07:22:14,037 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-10 07:22:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:17,323 INFO L93 Difference]: Finished difference Result 720470 states and 1104443 transitions. [2019-09-10 07:22:17,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:22:17,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 07:22:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:23,888 INFO L225 Difference]: With dead ends: 720470 [2019-09-10 07:22:23,889 INFO L226 Difference]: Without dead ends: 720470 [2019-09-10 07:22:23,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:22:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720470 states. [2019-09-10 07:22:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720470 to 110790. [2019-09-10 07:22:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110790 states. [2019-09-10 07:22:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110790 states to 110790 states and 170877 transitions. [2019-09-10 07:22:29,405 INFO L78 Accepts]: Start accepts. Automaton has 110790 states and 170877 transitions. Word has length 104 [2019-09-10 07:22:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:29,405 INFO L475 AbstractCegarLoop]: Abstraction has 110790 states and 170877 transitions. [2019-09-10 07:22:29,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:22:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 110790 states and 170877 transitions. [2019-09-10 07:22:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:22:29,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:29,418 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] [2019-09-10 07:22:29,418 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:29,419 INFO L82 PathProgramCache]: Analyzing trace with hash 842726832, now seen corresponding path program 1 times [2019-09-10 07:22:29,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:29,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:29,730 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:22:29,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:29,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:22:29,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:29,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:22:29,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:22:29,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:22:29,732 INFO L87 Difference]: Start difference. First operand 110790 states and 170877 transitions. Second operand 10 states. [2019-09-10 07:22:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:34,848 INFO L93 Difference]: Finished difference Result 553506 states and 846526 transitions. [2019-09-10 07:22:34,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:22:34,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 07:22:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:35,807 INFO L225 Difference]: With dead ends: 553506 [2019-09-10 07:22:35,808 INFO L226 Difference]: Without dead ends: 553506 [2019-09-10 07:22:35,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:22:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553506 states. [2019-09-10 07:22:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553506 to 112316. [2019-09-10 07:22:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112316 states. [2019-09-10 07:22:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112316 states to 112316 states and 173097 transitions. [2019-09-10 07:22:41,885 INFO L78 Accepts]: Start accepts. Automaton has 112316 states and 173097 transitions. Word has length 104 [2019-09-10 07:22:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:41,886 INFO L475 AbstractCegarLoop]: Abstraction has 112316 states and 173097 transitions. [2019-09-10 07:22:41,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:22:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 112316 states and 173097 transitions. [2019-09-10 07:22:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:22:41,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:41,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] [2019-09-10 07:22:41,904 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1327076688, now seen corresponding path program 1 times [2019-09-10 07:22:41,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:41,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:41,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:42,147 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:22:42,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:42,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:22:42,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:42,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:22:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:22:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:22:42,149 INFO L87 Difference]: Start difference. First operand 112316 states and 173097 transitions. Second operand 10 states. [2019-09-10 07:22:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:45,499 INFO L93 Difference]: Finished difference Result 266169 states and 408008 transitions. [2019-09-10 07:22:45,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:22:45,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 07:22:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:45,902 INFO L225 Difference]: With dead ends: 266169 [2019-09-10 07:22:45,902 INFO L226 Difference]: Without dead ends: 266169 [2019-09-10 07:22:45,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:22:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266169 states. [2019-09-10 07:22:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266169 to 112316. [2019-09-10 07:22:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112316 states. [2019-09-10 07:22:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112316 states to 112316 states and 173089 transitions. [2019-09-10 07:22:47,883 INFO L78 Accepts]: Start accepts. Automaton has 112316 states and 173089 transitions. Word has length 104 [2019-09-10 07:22:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:47,883 INFO L475 AbstractCegarLoop]: Abstraction has 112316 states and 173089 transitions. [2019-09-10 07:22:47,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:22:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 112316 states and 173089 transitions. [2019-09-10 07:22:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:22:47,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:47,899 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] [2019-09-10 07:22:47,899 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:47,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1732290064, now seen corresponding path program 1 times [2019-09-10 07:22:47,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:47,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:47,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:48,796 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:22:48,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:48,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:22:48,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:48,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:22:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:22:48,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:22:48,799 INFO L87 Difference]: Start difference. First operand 112316 states and 173089 transitions. Second operand 10 states. [2019-09-10 07:22:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:51,970 INFO L93 Difference]: Finished difference Result 369899 states and 565606 transitions. [2019-09-10 07:22:51,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:22:51,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 07:22:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:52,540 INFO L225 Difference]: With dead ends: 369899 [2019-09-10 07:22:52,540 INFO L226 Difference]: Without dead ends: 369899 [2019-09-10 07:22:52,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:22:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369899 states. [2019-09-10 07:22:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369899 to 114459. [2019-09-10 07:22:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114459 states. [2019-09-10 07:22:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114459 states to 114459 states and 175973 transitions. [2019-09-10 07:22:56,719 INFO L78 Accepts]: Start accepts. Automaton has 114459 states and 175973 transitions. Word has length 104 [2019-09-10 07:22:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:56,720 INFO L475 AbstractCegarLoop]: Abstraction has 114459 states and 175973 transitions. [2019-09-10 07:22:56,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:22:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 114459 states and 175973 transitions. [2019-09-10 07:22:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:22:56,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:56,736 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] [2019-09-10 07:22:56,736 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:56,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1278943024, now seen corresponding path program 1 times [2019-09-10 07:22:56,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:56,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:56,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:56,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:56,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:56,969 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:22:56,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:56,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:22:56,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:56,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:22:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:22:56,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:22:56,971 INFO L87 Difference]: Start difference. First operand 114459 states and 175973 transitions. Second operand 10 states. [2019-09-10 07:23:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:02,531 INFO L93 Difference]: Finished difference Result 731244 states and 1117075 transitions. [2019-09-10 07:23:02,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:23:02,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 07:23:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:03,692 INFO L225 Difference]: With dead ends: 731244 [2019-09-10 07:23:03,693 INFO L226 Difference]: Without dead ends: 731244 [2019-09-10 07:23:03,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:23:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731244 states. [2019-09-10 07:23:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731244 to 115215. [2019-09-10 07:23:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115215 states. [2019-09-10 07:23:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115215 states to 115215 states and 176843 transitions. [2019-09-10 07:23:12,863 INFO L78 Accepts]: Start accepts. Automaton has 115215 states and 176843 transitions. Word has length 104 [2019-09-10 07:23:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:12,864 INFO L475 AbstractCegarLoop]: Abstraction has 115215 states and 176843 transitions. [2019-09-10 07:23:12,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:23:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 115215 states and 176843 transitions. [2019-09-10 07:23:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:23:12,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:12,878 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] [2019-09-10 07:23:12,879 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash -837692424, now seen corresponding path program 1 times [2019-09-10 07:23:12,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:12,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:12,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:12,994 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:23:12,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:12,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:23:12,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:12,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:23:12,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:23:12,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:23:12,998 INFO L87 Difference]: Start difference. First operand 115215 states and 176843 transitions. Second operand 4 states. [2019-09-10 07:23:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:13,627 INFO L93 Difference]: Finished difference Result 211505 states and 322364 transitions. [2019-09-10 07:23:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:23:13,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-10 07:23:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:13,916 INFO L225 Difference]: With dead ends: 211505 [2019-09-10 07:23:13,916 INFO L226 Difference]: Without dead ends: 211505 [2019-09-10 07:23:13,916 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:23:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211505 states. [2019-09-10 07:23:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211505 to 210399. [2019-09-10 07:23:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210399 states. [2019-09-10 07:23:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210399 states to 210399 states and 321259 transitions. [2019-09-10 07:23:17,781 INFO L78 Accepts]: Start accepts. Automaton has 210399 states and 321259 transitions. Word has length 105 [2019-09-10 07:23:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:17,782 INFO L475 AbstractCegarLoop]: Abstraction has 210399 states and 321259 transitions. [2019-09-10 07:23:17,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:23:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 210399 states and 321259 transitions. [2019-09-10 07:23:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:23:17,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:17,802 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] [2019-09-10 07:23:17,802 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 737938638, now seen corresponding path program 1 times [2019-09-10 07:23:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:17,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:17,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:17,866 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:23:17,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:17,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:17,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:17,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:17,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:17,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:17,868 INFO L87 Difference]: Start difference. First operand 210399 states and 321259 transitions. Second operand 3 states. [2019-09-10 07:23:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:18,730 INFO L93 Difference]: Finished difference Result 271889 states and 410303 transitions. [2019-09-10 07:23:18,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:18,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:23:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:19,128 INFO L225 Difference]: With dead ends: 271889 [2019-09-10 07:23:19,129 INFO L226 Difference]: Without dead ends: 271889 [2019-09-10 07:23:19,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:23:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271889 states. [2019-09-10 07:23:23,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271889 to 270183. [2019-09-10 07:23:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270183 states. [2019-09-10 07:23:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270183 states to 270183 states and 408598 transitions. [2019-09-10 07:23:23,919 INFO L78 Accepts]: Start accepts. Automaton has 270183 states and 408598 transitions. Word has length 105 [2019-09-10 07:23:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:23,920 INFO L475 AbstractCegarLoop]: Abstraction has 270183 states and 408598 transitions. [2019-09-10 07:23:23,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 270183 states and 408598 transitions. [2019-09-10 07:23:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:23:23,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:23,946 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] [2019-09-10 07:23:23,946 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:23,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1199316624, now seen corresponding path program 1 times [2019-09-10 07:23:23,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:23,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:23,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:23,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:23,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:24,020 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:23:24,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:24,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:24,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:24,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:24,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:24,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:24,022 INFO L87 Difference]: Start difference. First operand 270183 states and 408598 transitions. Second operand 3 states. [2019-09-10 07:23:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:25,801 INFO L93 Difference]: Finished difference Result 320467 states and 477984 transitions. [2019-09-10 07:23:25,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:25,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:23:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:26,307 INFO L225 Difference]: With dead ends: 320467 [2019-09-10 07:23:26,308 INFO L226 Difference]: Without dead ends: 320467 [2019-09-10 07:23:26,308 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:23:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320467 states. [2019-09-10 07:23:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320467 to 318473. [2019-09-10 07:23:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318473 states. [2019-09-10 07:23:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318473 states to 318473 states and 475991 transitions. [2019-09-10 07:23:31,928 INFO L78 Accepts]: Start accepts. Automaton has 318473 states and 475991 transitions. Word has length 105 [2019-09-10 07:23:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:31,928 INFO L475 AbstractCegarLoop]: Abstraction has 318473 states and 475991 transitions. [2019-09-10 07:23:31,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 318473 states and 475991 transitions. [2019-09-10 07:23:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:23:31,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:31,947 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] [2019-09-10 07:23:31,948 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -35790183, now seen corresponding path program 1 times [2019-09-10 07:23:31,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:31,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:31,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:32,013 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:23:32,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:32,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:32,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:32,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:32,015 INFO L87 Difference]: Start difference. First operand 318473 states and 475991 transitions. Second operand 3 states. [2019-09-10 07:23:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:33,906 INFO L93 Difference]: Finished difference Result 352519 states and 518968 transitions. [2019-09-10 07:23:33,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:33,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:23:33,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:34,778 INFO L225 Difference]: With dead ends: 352519 [2019-09-10 07:23:34,778 INFO L226 Difference]: Without dead ends: 350439 [2019-09-10 07:23:34,780 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:23:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350439 states. [2019-09-10 07:23:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350439 to 313201. [2019-09-10 07:23:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313201 states. [2019-09-10 07:23:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313201 states to 313201 states and 462375 transitions. [2019-09-10 07:23:45,910 INFO L78 Accepts]: Start accepts. Automaton has 313201 states and 462375 transitions. Word has length 105 [2019-09-10 07:23:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:45,910 INFO L475 AbstractCegarLoop]: Abstraction has 313201 states and 462375 transitions. [2019-09-10 07:23:45,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 313201 states and 462375 transitions. [2019-09-10 07:23:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:23:45,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:45,926 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] [2019-09-10 07:23:45,926 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:45,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1483622926, now seen corresponding path program 1 times [2019-09-10 07:23:45,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:45,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:45,985 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:23:45,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:45,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:45,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:45,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:45,987 INFO L87 Difference]: Start difference. First operand 313201 states and 462375 transitions. Second operand 3 states. [2019-09-10 07:23:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:48,028 INFO L93 Difference]: Finished difference Result 563374 states and 826925 transitions. [2019-09-10 07:23:48,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:48,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:23:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:48,878 INFO L225 Difference]: With dead ends: 563374 [2019-09-10 07:23:48,878 INFO L226 Difference]: Without dead ends: 563374 [2019-09-10 07:23:48,878 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:23:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563374 states. [2019-09-10 07:24:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563374 to 562532. [2019-09-10 07:24:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562532 states. [2019-09-10 07:24:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562532 states to 562532 states and 826084 transitions. [2019-09-10 07:24:09,182 INFO L78 Accepts]: Start accepts. Automaton has 562532 states and 826084 transitions. Word has length 105 [2019-09-10 07:24:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:09,182 INFO L475 AbstractCegarLoop]: Abstraction has 562532 states and 826084 transitions. [2019-09-10 07:24:09,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 562532 states and 826084 transitions. [2019-09-10 07:24:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:24:09,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:09,203 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] [2019-09-10 07:24:09,203 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:09,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:09,203 INFO L82 PathProgramCache]: Analyzing trace with hash 467708366, now seen corresponding path program 1 times [2019-09-10 07:24:09,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:09,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:09,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:09,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:09,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:09,260 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:24:09,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:09,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:09,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:09,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:09,262 INFO L87 Difference]: Start difference. First operand 562532 states and 826084 transitions. Second operand 3 states. [2019-09-10 07:24:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:18,508 INFO L93 Difference]: Finished difference Result 601162 states and 866948 transitions. [2019-09-10 07:24:18,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:18,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:24:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:19,435 INFO L225 Difference]: With dead ends: 601162 [2019-09-10 07:24:19,435 INFO L226 Difference]: Without dead ends: 601162 [2019-09-10 07:24:19,435 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:24:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601162 states. [2019-09-10 07:24:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601162 to 596192. [2019-09-10 07:24:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596192 states. [2019-09-10 07:24:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596192 states to 596192 states and 861979 transitions. [2019-09-10 07:24:28,212 INFO L78 Accepts]: Start accepts. Automaton has 596192 states and 861979 transitions. Word has length 105 [2019-09-10 07:24:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:28,212 INFO L475 AbstractCegarLoop]: Abstraction has 596192 states and 861979 transitions. [2019-09-10 07:24:28,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 596192 states and 861979 transitions. [2019-09-10 07:24:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:24:28,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:28,235 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] [2019-09-10 07:24:28,235 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash 373855472, now seen corresponding path program 1 times [2019-09-10 07:24:28,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:28,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:28,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:28,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:28,299 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:24:28,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:28,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:28,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:28,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:28,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:28,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:28,301 INFO L87 Difference]: Start difference. First operand 596192 states and 861979 transitions. Second operand 3 states. [2019-09-10 07:24:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:38,525 INFO L93 Difference]: Finished difference Result 849065 states and 1209452 transitions. [2019-09-10 07:24:38,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:38,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:24:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:39,894 INFO L225 Difference]: With dead ends: 849065 [2019-09-10 07:24:39,894 INFO L226 Difference]: Without dead ends: 849065 [2019-09-10 07:24:39,894 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:24:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849065 states. [2019-09-10 07:24:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849065 to 843719. [2019-09-10 07:24:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843719 states. [2019-09-10 07:25:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843719 states to 843719 states and 1204107 transitions. [2019-09-10 07:25:08,511 INFO L78 Accepts]: Start accepts. Automaton has 843719 states and 1204107 transitions. Word has length 105 [2019-09-10 07:25:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:08,511 INFO L475 AbstractCegarLoop]: Abstraction has 843719 states and 1204107 transitions. [2019-09-10 07:25:08,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 843719 states and 1204107 transitions. [2019-09-10 07:25:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:25:08,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:08,526 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] [2019-09-10 07:25:08,526 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:08,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash -97764324, now seen corresponding path program 1 times [2019-09-10 07:25:08,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:08,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:08,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:08,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:08,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:08,620 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:25:08,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:08,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:25:08,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:08,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:25:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:25:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:08,624 INFO L87 Difference]: Start difference. First operand 843719 states and 1204107 transitions. Second operand 7 states. [2019-09-10 07:25:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:44,717 INFO L93 Difference]: Finished difference Result 3558963 states and 5044260 transitions. [2019-09-10 07:25:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:25:44,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:25:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:51,522 INFO L225 Difference]: With dead ends: 3558963 [2019-09-10 07:25:51,522 INFO L226 Difference]: Without dead ends: 3558963 [2019-09-10 07:25:51,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:25:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558963 states. [2019-09-10 07:26:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558963 to 844147. [2019-09-10 07:26:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844147 states. [2019-09-10 07:26:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844147 states to 844147 states and 1204622 transitions. [2019-09-10 07:26:40,647 INFO L78 Accepts]: Start accepts. Automaton has 844147 states and 1204622 transitions. Word has length 106 [2019-09-10 07:26:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:40,647 INFO L475 AbstractCegarLoop]: Abstraction has 844147 states and 1204622 transitions. [2019-09-10 07:26:40,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:26:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 844147 states and 1204622 transitions. [2019-09-10 07:26:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:26:40,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:40,662 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] [2019-09-10 07:26:40,662 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:40,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash 797654434, now seen corresponding path program 1 times [2019-09-10 07:26:40,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:40,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:40,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:40,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:26:40,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:40,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:40,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:40,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:40,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:40,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:40,774 INFO L87 Difference]: Start difference. First operand 844147 states and 1204622 transitions. Second operand 7 states. [2019-09-10 07:27:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:08,950 INFO L93 Difference]: Finished difference Result 3579872 states and 5061211 transitions. [2019-09-10 07:27:08,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:27:08,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:27:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:16,049 INFO L225 Difference]: With dead ends: 3579872 [2019-09-10 07:27:16,049 INFO L226 Difference]: Without dead ends: 3579872 [2019-09-10 07:27:16,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:27:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579872 states. [2019-09-10 07:28:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579872 to 844899. [2019-09-10 07:28:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844899 states. [2019-09-10 07:28:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844899 states to 844899 states and 1205544 transitions. [2019-09-10 07:28:19,818 INFO L78 Accepts]: Start accepts. Automaton has 844899 states and 1205544 transitions. Word has length 106 [2019-09-10 07:28:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:19,819 INFO L475 AbstractCegarLoop]: Abstraction has 844899 states and 1205544 transitions. [2019-09-10 07:28:19,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:28:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 844899 states and 1205544 transitions. [2019-09-10 07:28:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:28:19,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:19,833 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] [2019-09-10 07:28:19,833 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:19,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2073252272, now seen corresponding path program 1 times [2019-09-10 07:28:19,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:19,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:19,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:19,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:19,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:19,926 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:28:19,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:19,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:28:19,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:19,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:28:19,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:28:19,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:19,928 INFO L87 Difference]: Start difference. First operand 844899 states and 1205544 transitions. Second operand 7 states.