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.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:32:35,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:32:35,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:32:35,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:32:35,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:32:35,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:32:35,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:32:35,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:32:35,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:32:35,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:32:35,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:32:35,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:32:35,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:32:35,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:32:35,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:32:35,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:32:35,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:32:35,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:32:35,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:32:35,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:32:35,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:32:35,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:32:35,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:32:35,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:32:35,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:32:35,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:32:35,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:32:35,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:32:35,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:32:35,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:32:35,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:32:35,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:32:35,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:32:35,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:32:35,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:32:35,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:32:35,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:32:35,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:32:35,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:32:35,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:32:35,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:32:35,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:32:35,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:32:35,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:32:35,256 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:32:35,256 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:32:35,257 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:32:35,257 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:32:35,257 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:32:35,257 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:32:35,258 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:32:35,258 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:32:35,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:32:35,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:32:35,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:32:35,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:32:35,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:32:35,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:32:35,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:32:35,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:32:35,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:32:35,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:32:35,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:32:35,261 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:32:35,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:32:35,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:32:35,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:32:35,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:32:35,262 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:32:35,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:32:35,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:32:35,262 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:32:35,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:32:35,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:32:35,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:32:35,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:32:35,307 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:32:35,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2019-09-10 08:32:35,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19161d3a/6a4b1b0fbec04eb09735660eba5af124/FLAG98e50c57a [2019-09-10 08:32:35,998 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:32:35,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2019-09-10 08:32:36,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19161d3a/6a4b1b0fbec04eb09735660eba5af124/FLAG98e50c57a [2019-09-10 08:32:36,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19161d3a/6a4b1b0fbec04eb09735660eba5af124 [2019-09-10 08:32:36,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:32:36,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:32:36,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:36,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:32:36,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:32:36,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:36" (1/1) ... [2019-09-10 08:32:36,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cceac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:36, skipping insertion in model container [2019-09-10 08:32:36,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:36" (1/1) ... [2019-09-10 08:32:36,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:32:36,397 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:32:36,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:36,891 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:32:37,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:37,082 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:32:37,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37 WrapperNode [2019-09-10 08:32:37,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:37,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:32:37,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:32:37,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:32:37,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (1/1) ... [2019-09-10 08:32:37,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (1/1) ... [2019-09-10 08:32:37,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (1/1) ... [2019-09-10 08:32:37,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (1/1) ... [2019-09-10 08:32:37,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (1/1) ... [2019-09-10 08:32:37,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (1/1) ... [2019-09-10 08:32:37,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (1/1) ... [2019-09-10 08:32:37,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:32:37,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:32:37,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:32:37,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:32:37,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:32:37,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:32:37,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:32:37,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:32:37,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:32:37,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:32:37,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:32:37,242 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:32:37,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:32:37,243 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:32:37,243 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:32:37,243 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:32:37,243 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:32:37,243 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:32:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:32:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:32:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:32:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:32:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-10 08:32:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:32:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:32:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:32:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:32:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:32:38,561 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:32:38,562 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:32:38,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:32:38 BoogieIcfgContainer [2019-09-10 08:32:38,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:32:38,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:32:38,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:32:38,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:32:38,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:32:36" (1/3) ... [2019-09-10 08:32:38,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d296bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:32:38, skipping insertion in model container [2019-09-10 08:32:38,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:37" (2/3) ... [2019-09-10 08:32:38,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d296bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:32:38, skipping insertion in model container [2019-09-10 08:32:38,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:32:38" (3/3) ... [2019-09-10 08:32:38,578 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2019-09-10 08:32:38,588 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:32:38,608 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:32:38,624 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:32:38,651 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:32:38,652 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:32:38,652 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:32:38,652 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:32:38,652 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:32:38,652 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:32:38,653 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:32:38,653 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:32:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-09-10 08:32:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:32:38,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:38,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:38,700 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash 946544579, now seen corresponding path program 1 times [2019-09-10 08:32:38,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:38,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:38,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:38,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:38,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:39,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:39,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:39,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:39,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:39,337 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2019-09-10 08:32:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:39,516 INFO L93 Difference]: Finished difference Result 359 states and 605 transitions. [2019-09-10 08:32:39,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:39,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 08:32:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:39,552 INFO L225 Difference]: With dead ends: 359 [2019-09-10 08:32:39,552 INFO L226 Difference]: Without dead ends: 351 [2019-09-10 08:32:39,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-10 08:32:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-09-10 08:32:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-10 08:32:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 498 transitions. [2019-09-10 08:32:39,623 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 498 transitions. Word has length 129 [2019-09-10 08:32:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:39,624 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 498 transitions. [2019-09-10 08:32:39,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 498 transitions. [2019-09-10 08:32:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:32:39,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:39,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:39,632 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:39,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1962264158, now seen corresponding path program 1 times [2019-09-10 08:32:39,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:39,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:39,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:39,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:39,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:39,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:39,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:39,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:39,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:39,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:39,964 INFO L87 Difference]: Start difference. First operand 349 states and 498 transitions. Second operand 5 states. [2019-09-10 08:32:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:40,438 INFO L93 Difference]: Finished difference Result 582 states and 863 transitions. [2019-09-10 08:32:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:40,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-09-10 08:32:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:40,447 INFO L225 Difference]: With dead ends: 582 [2019-09-10 08:32:40,448 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 08:32:40,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 08:32:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2019-09-10 08:32:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 08:32:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 862 transitions. [2019-09-10 08:32:40,520 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 862 transitions. Word has length 131 [2019-09-10 08:32:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:40,521 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 862 transitions. [2019-09-10 08:32:40,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 862 transitions. [2019-09-10 08:32:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:32:40,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:40,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:40,529 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:40,530 INFO L82 PathProgramCache]: Analyzing trace with hash 465547919, now seen corresponding path program 1 times [2019-09-10 08:32:40,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:40,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:40,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:40,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:40,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:40,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:40,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:40,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:40,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:40,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:40,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:40,743 INFO L87 Difference]: Start difference. First operand 580 states and 862 transitions. Second operand 5 states. [2019-09-10 08:32:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:41,015 INFO L93 Difference]: Finished difference Result 580 states and 857 transitions. [2019-09-10 08:32:41,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:41,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-10 08:32:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:41,023 INFO L225 Difference]: With dead ends: 580 [2019-09-10 08:32:41,023 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 08:32:41,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 08:32:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 08:32:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 08:32:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 857 transitions. [2019-09-10 08:32:41,048 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 857 transitions. Word has length 132 [2019-09-10 08:32:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:41,049 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 857 transitions. [2019-09-10 08:32:41,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 857 transitions. [2019-09-10 08:32:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:32:41,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:41,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:41,053 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash 813385873, now seen corresponding path program 1 times [2019-09-10 08:32:41,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:41,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:41,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:41,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:41,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:41,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:41,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:41,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:41,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:41,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:41,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:41,239 INFO L87 Difference]: Start difference. First operand 580 states and 857 transitions. Second operand 5 states. [2019-09-10 08:32:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:41,477 INFO L93 Difference]: Finished difference Result 580 states and 852 transitions. [2019-09-10 08:32:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:41,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 08:32:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:41,481 INFO L225 Difference]: With dead ends: 580 [2019-09-10 08:32:41,481 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 08:32:41,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 08:32:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 08:32:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 08:32:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 852 transitions. [2019-09-10 08:32:41,499 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 852 transitions. Word has length 133 [2019-09-10 08:32:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:41,499 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 852 transitions. [2019-09-10 08:32:41,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 852 transitions. [2019-09-10 08:32:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:32:41,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:41,502 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:41,502 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:41,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:41,502 INFO L82 PathProgramCache]: Analyzing trace with hash 955484463, now seen corresponding path program 1 times [2019-09-10 08:32:41,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:41,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:41,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:41,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:41,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:41,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:41,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:41,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:41,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:41,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:41,686 INFO L87 Difference]: Start difference. First operand 580 states and 852 transitions. Second operand 5 states. [2019-09-10 08:32:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:41,961 INFO L93 Difference]: Finished difference Result 580 states and 847 transitions. [2019-09-10 08:32:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:41,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-10 08:32:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:41,968 INFO L225 Difference]: With dead ends: 580 [2019-09-10 08:32:41,968 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 08:32:41,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 08:32:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 08:32:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 08:32:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 847 transitions. [2019-09-10 08:32:41,994 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 847 transitions. Word has length 134 [2019-09-10 08:32:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:41,994 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 847 transitions. [2019-09-10 08:32:41,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 847 transitions. [2019-09-10 08:32:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:32:41,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:41,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:41,997 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 942845888, now seen corresponding path program 1 times [2019-09-10 08:32:41,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:42,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:42,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:42,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:42,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:42,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:42,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:42,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:42,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:42,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:42,243 INFO L87 Difference]: Start difference. First operand 580 states and 847 transitions. Second operand 5 states. [2019-09-10 08:32:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:42,490 INFO L93 Difference]: Finished difference Result 580 states and 842 transitions. [2019-09-10 08:32:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:42,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-10 08:32:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:42,494 INFO L225 Difference]: With dead ends: 580 [2019-09-10 08:32:42,495 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 08:32:42,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 08:32:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 08:32:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 08:32:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 842 transitions. [2019-09-10 08:32:42,511 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 842 transitions. Word has length 135 [2019-09-10 08:32:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:42,517 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 842 transitions. [2019-09-10 08:32:42,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 842 transitions. [2019-09-10 08:32:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:32:42,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:42,527 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:42,527 INFO L82 PathProgramCache]: Analyzing trace with hash -178047234, now seen corresponding path program 1 times [2019-09-10 08:32:42,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:42,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:42,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:42,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:42,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:42,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:42,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:42,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:42,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:42,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:42,708 INFO L87 Difference]: Start difference. First operand 580 states and 842 transitions. Second operand 5 states. [2019-09-10 08:32:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:42,922 INFO L93 Difference]: Finished difference Result 580 states and 837 transitions. [2019-09-10 08:32:42,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:42,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-10 08:32:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:42,926 INFO L225 Difference]: With dead ends: 580 [2019-09-10 08:32:42,926 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 08:32:42,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 08:32:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 08:32:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 08:32:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 837 transitions. [2019-09-10 08:32:42,941 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 837 transitions. Word has length 136 [2019-09-10 08:32:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:42,941 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 837 transitions. [2019-09-10 08:32:42,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 837 transitions. [2019-09-10 08:32:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:32:42,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:42,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:42,944 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash -571169295, now seen corresponding path program 1 times [2019-09-10 08:32:42,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:42,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:42,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:42,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:43,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:43,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:43,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:43,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:43,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:43,077 INFO L87 Difference]: Start difference. First operand 580 states and 837 transitions. Second operand 5 states. [2019-09-10 08:32:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:43,368 INFO L93 Difference]: Finished difference Result 580 states and 832 transitions. [2019-09-10 08:32:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:43,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-10 08:32:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:43,372 INFO L225 Difference]: With dead ends: 580 [2019-09-10 08:32:43,373 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 08:32:43,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 08:32:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 08:32:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 08:32:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 832 transitions. [2019-09-10 08:32:43,390 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 832 transitions. Word has length 137 [2019-09-10 08:32:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:43,391 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 832 transitions. [2019-09-10 08:32:43,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 832 transitions. [2019-09-10 08:32:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:32:43,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:43,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:43,393 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash -42273280, now seen corresponding path program 1 times [2019-09-10 08:32:43,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:43,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:43,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:43,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:43,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:43,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:43,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:43,553 INFO L87 Difference]: Start difference. First operand 580 states and 832 transitions. Second operand 5 states. [2019-09-10 08:32:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:43,760 INFO L93 Difference]: Finished difference Result 580 states and 827 transitions. [2019-09-10 08:32:43,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:43,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-10 08:32:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:43,763 INFO L225 Difference]: With dead ends: 580 [2019-09-10 08:32:43,763 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 08:32:43,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 08:32:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 08:32:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 08:32:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 827 transitions. [2019-09-10 08:32:43,776 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 827 transitions. Word has length 138 [2019-09-10 08:32:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:43,777 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 827 transitions. [2019-09-10 08:32:43,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 827 transitions. [2019-09-10 08:32:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:43,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:43,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:43,779 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:43,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:43,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1267915042, now seen corresponding path program 1 times [2019-09-10 08:32:43,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:43,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:43,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:44,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:44,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:44,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:44,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:44,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:44,045 INFO L87 Difference]: Start difference. First operand 580 states and 827 transitions. Second operand 10 states. [2019-09-10 08:32:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:44,535 INFO L93 Difference]: Finished difference Result 3324 states and 4946 transitions. [2019-09-10 08:32:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:32:44,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2019-09-10 08:32:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:44,560 INFO L225 Difference]: With dead ends: 3324 [2019-09-10 08:32:44,561 INFO L226 Difference]: Without dead ends: 3324 [2019-09-10 08:32:44,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:32:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2019-09-10 08:32:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 753. [2019-09-10 08:32:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-09-10 08:32:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1088 transitions. [2019-09-10 08:32:44,614 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1088 transitions. Word has length 139 [2019-09-10 08:32:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:44,615 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1088 transitions. [2019-09-10 08:32:44,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1088 transitions. [2019-09-10 08:32:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:44,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:44,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:44,617 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash -44652639, now seen corresponding path program 1 times [2019-09-10 08:32:44,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:44,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:44,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:44,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:44,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:44,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:44,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:44,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:44,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:44,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:44,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:44,816 INFO L87 Difference]: Start difference. First operand 753 states and 1088 transitions. Second operand 5 states. [2019-09-10 08:32:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:44,943 INFO L93 Difference]: Finished difference Result 1442 states and 2124 transitions. [2019-09-10 08:32:44,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:44,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 08:32:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:44,951 INFO L225 Difference]: With dead ends: 1442 [2019-09-10 08:32:44,951 INFO L226 Difference]: Without dead ends: 1442 [2019-09-10 08:32:44,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-09-10 08:32:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1172. [2019-09-10 08:32:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-09-10 08:32:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1725 transitions. [2019-09-10 08:32:44,981 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1725 transitions. Word has length 139 [2019-09-10 08:32:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:44,982 INFO L475 AbstractCegarLoop]: Abstraction has 1172 states and 1725 transitions. [2019-09-10 08:32:44,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1725 transitions. [2019-09-10 08:32:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:44,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:44,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:44,985 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1504481102, now seen corresponding path program 1 times [2019-09-10 08:32:44,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:44,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:44,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:45,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:45,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:45,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:45,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:45,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:45,129 INFO L87 Difference]: Start difference. First operand 1172 states and 1725 transitions. Second operand 5 states. [2019-09-10 08:32:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:45,249 INFO L93 Difference]: Finished difference Result 1800 states and 2666 transitions. [2019-09-10 08:32:45,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:45,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 08:32:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:45,260 INFO L225 Difference]: With dead ends: 1800 [2019-09-10 08:32:45,261 INFO L226 Difference]: Without dead ends: 1800 [2019-09-10 08:32:45,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2019-09-10 08:32:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1550. [2019-09-10 08:32:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-10 08:32:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2297 transitions. [2019-09-10 08:32:45,301 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2297 transitions. Word has length 139 [2019-09-10 08:32:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:45,301 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2297 transitions. [2019-09-10 08:32:45,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2297 transitions. [2019-09-10 08:32:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:45,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:45,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:45,304 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1878119452, now seen corresponding path program 1 times [2019-09-10 08:32:45,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:45,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:45,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:45,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:45,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:45,456 INFO L87 Difference]: Start difference. First operand 1550 states and 2297 transitions. Second operand 5 states. [2019-09-10 08:32:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:45,570 INFO L93 Difference]: Finished difference Result 1940 states and 2877 transitions. [2019-09-10 08:32:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:45,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 08:32:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:45,580 INFO L225 Difference]: With dead ends: 1940 [2019-09-10 08:32:45,581 INFO L226 Difference]: Without dead ends: 1940 [2019-09-10 08:32:45,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2019-09-10 08:32:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1730. [2019-09-10 08:32:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2019-09-10 08:32:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2568 transitions. [2019-09-10 08:32:45,649 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2568 transitions. Word has length 139 [2019-09-10 08:32:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:45,649 INFO L475 AbstractCegarLoop]: Abstraction has 1730 states and 2568 transitions. [2019-09-10 08:32:45,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2568 transitions. [2019-09-10 08:32:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:45,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:45,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:45,652 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1752786018, now seen corresponding path program 1 times [2019-09-10 08:32:45,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:45,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:45,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:45,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:45,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:45,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:45,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:45,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:45,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:45,795 INFO L87 Difference]: Start difference. First operand 1730 states and 2568 transitions. Second operand 5 states. [2019-09-10 08:32:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:45,899 INFO L93 Difference]: Finished difference Result 2096 states and 3114 transitions. [2019-09-10 08:32:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:45,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 08:32:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:45,910 INFO L225 Difference]: With dead ends: 2096 [2019-09-10 08:32:45,910 INFO L226 Difference]: Without dead ends: 2096 [2019-09-10 08:32:45,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-09-10 08:32:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1908. [2019-09-10 08:32:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1908 states. [2019-09-10 08:32:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2837 transitions. [2019-09-10 08:32:45,959 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2837 transitions. Word has length 139 [2019-09-10 08:32:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:45,959 INFO L475 AbstractCegarLoop]: Abstraction has 1908 states and 2837 transitions. [2019-09-10 08:32:45,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2837 transitions. [2019-09-10 08:32:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:45,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:45,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:45,962 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:45,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:45,963 INFO L82 PathProgramCache]: Analyzing trace with hash -242497816, now seen corresponding path program 1 times [2019-09-10 08:32:45,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:45,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:45,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:46,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:46,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:46,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:46,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:46,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:46,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:46,044 INFO L87 Difference]: Start difference. First operand 1908 states and 2837 transitions. Second operand 3 states. [2019-09-10 08:32:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:46,096 INFO L93 Difference]: Finished difference Result 3388 states and 4999 transitions. [2019-09-10 08:32:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:46,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 08:32:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:46,113 INFO L225 Difference]: With dead ends: 3388 [2019-09-10 08:32:46,113 INFO L226 Difference]: Without dead ends: 3388 [2019-09-10 08:32:46,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-09-10 08:32:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3386. [2019-09-10 08:32:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-09-10 08:32:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4998 transitions. [2019-09-10 08:32:46,201 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4998 transitions. Word has length 139 [2019-09-10 08:32:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:46,201 INFO L475 AbstractCegarLoop]: Abstraction has 3386 states and 4998 transitions. [2019-09-10 08:32:46,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4998 transitions. [2019-09-10 08:32:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:46,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:46,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:46,204 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:46,204 INFO L82 PathProgramCache]: Analyzing trace with hash 34945767, now seen corresponding path program 1 times [2019-09-10 08:32:46,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:46,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:46,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:46,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:46,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:46,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:46,312 INFO L87 Difference]: Start difference. First operand 3386 states and 4998 transitions. Second operand 3 states. [2019-09-10 08:32:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:46,381 INFO L93 Difference]: Finished difference Result 3388 states and 4991 transitions. [2019-09-10 08:32:46,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:46,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 08:32:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:46,398 INFO L225 Difference]: With dead ends: 3388 [2019-09-10 08:32:46,398 INFO L226 Difference]: Without dead ends: 3388 [2019-09-10 08:32:46,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-09-10 08:32:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3386. [2019-09-10 08:32:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-09-10 08:32:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4990 transitions. [2019-09-10 08:32:46,493 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4990 transitions. Word has length 139 [2019-09-10 08:32:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:46,494 INFO L475 AbstractCegarLoop]: Abstraction has 3386 states and 4990 transitions. [2019-09-10 08:32:46,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4990 transitions. [2019-09-10 08:32:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:46,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:46,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:46,498 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash 878292919, now seen corresponding path program 1 times [2019-09-10 08:32:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:46,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:46,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:46,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:46,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:46,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:46,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:46,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:46,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:46,719 INFO L87 Difference]: Start difference. First operand 3386 states and 4990 transitions. Second operand 5 states. [2019-09-10 08:32:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:46,844 INFO L93 Difference]: Finished difference Result 4184 states and 6162 transitions. [2019-09-10 08:32:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:46,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 08:32:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:46,863 INFO L225 Difference]: With dead ends: 4184 [2019-09-10 08:32:46,864 INFO L226 Difference]: Without dead ends: 4184 [2019-09-10 08:32:46,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2019-09-10 08:32:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3740. [2019-09-10 08:32:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3740 states. [2019-09-10 08:32:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5516 transitions. [2019-09-10 08:32:46,937 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5516 transitions. Word has length 139 [2019-09-10 08:32:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:46,937 INFO L475 AbstractCegarLoop]: Abstraction has 3740 states and 5516 transitions. [2019-09-10 08:32:46,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5516 transitions. [2019-09-10 08:32:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:46,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:46,940 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:46,940 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1642320824, now seen corresponding path program 1 times [2019-09-10 08:32:46,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:46,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:46,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:47,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:47,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:47,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:47,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:47,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:47,083 INFO L87 Difference]: Start difference. First operand 3740 states and 5516 transitions. Second operand 5 states. [2019-09-10 08:32:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:47,197 INFO L93 Difference]: Finished difference Result 4688 states and 6916 transitions. [2019-09-10 08:32:47,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:47,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 08:32:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:47,219 INFO L225 Difference]: With dead ends: 4688 [2019-09-10 08:32:47,219 INFO L226 Difference]: Without dead ends: 4688 [2019-09-10 08:32:47,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4688 states. [2019-09-10 08:32:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4688 to 4124. [2019-09-10 08:32:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2019-09-10 08:32:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 6090 transitions. [2019-09-10 08:32:47,300 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 6090 transitions. Word has length 139 [2019-09-10 08:32:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:47,301 INFO L475 AbstractCegarLoop]: Abstraction has 4124 states and 6090 transitions. [2019-09-10 08:32:47,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 6090 transitions. [2019-09-10 08:32:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:32:47,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:47,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:47,304 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:47,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:47,306 INFO L82 PathProgramCache]: Analyzing trace with hash 884469899, now seen corresponding path program 1 times [2019-09-10 08:32:47,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:47,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:47,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:47,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:47,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:47,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:47,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:47,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:47,466 INFO L87 Difference]: Start difference. First operand 4124 states and 6090 transitions. Second operand 5 states. [2019-09-10 08:32:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:47,608 INFO L93 Difference]: Finished difference Result 8226 states and 12177 transitions. [2019-09-10 08:32:47,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:47,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 08:32:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:47,678 INFO L225 Difference]: With dead ends: 8226 [2019-09-10 08:32:47,679 INFO L226 Difference]: Without dead ends: 8226 [2019-09-10 08:32:47,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8226 states. [2019-09-10 08:32:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8226 to 7964. [2019-09-10 08:32:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7964 states. [2019-09-10 08:32:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7964 states to 7964 states and 11798 transitions. [2019-09-10 08:32:47,821 INFO L78 Accepts]: Start accepts. Automaton has 7964 states and 11798 transitions. Word has length 139 [2019-09-10 08:32:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:47,822 INFO L475 AbstractCegarLoop]: Abstraction has 7964 states and 11798 transitions. [2019-09-10 08:32:47,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7964 states and 11798 transitions. [2019-09-10 08:32:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:32:47,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:47,825 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:47,825 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1339516528, now seen corresponding path program 1 times [2019-09-10 08:32:47,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:47,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:32:47,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:47,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:32:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:32:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:32:47,967 INFO L87 Difference]: Start difference. First operand 7964 states and 11798 transitions. Second operand 4 states. [2019-09-10 08:32:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:48,021 INFO L93 Difference]: Finished difference Result 11535 states and 17058 transitions. [2019-09-10 08:32:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:32:48,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-10 08:32:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:48,046 INFO L225 Difference]: With dead ends: 11535 [2019-09-10 08:32:48,046 INFO L226 Difference]: Without dead ends: 11535 [2019-09-10 08:32:48,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:32:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11535 states. [2019-09-10 08:32:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11535 to 11533. [2019-09-10 08:32:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11533 states. [2019-09-10 08:32:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11533 states to 11533 states and 17057 transitions. [2019-09-10 08:32:48,236 INFO L78 Accepts]: Start accepts. Automaton has 11533 states and 17057 transitions. Word has length 140 [2019-09-10 08:32:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:48,237 INFO L475 AbstractCegarLoop]: Abstraction has 11533 states and 17057 transitions. [2019-09-10 08:32:48,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:32:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 11533 states and 17057 transitions. [2019-09-10 08:32:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:32:48,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:48,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:48,240 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:48,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:48,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1081409652, now seen corresponding path program 1 times [2019-09-10 08:32:48,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:48,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:48,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:48,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:48,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:48,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:48,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:48,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:48,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:48,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:48,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:48,367 INFO L87 Difference]: Start difference. First operand 11533 states and 17057 transitions. Second operand 5 states. [2019-09-10 08:32:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:48,457 INFO L93 Difference]: Finished difference Result 19231 states and 28333 transitions. [2019-09-10 08:32:48,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:32:48,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-09-10 08:32:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:48,496 INFO L225 Difference]: With dead ends: 19231 [2019-09-10 08:32:48,496 INFO L226 Difference]: Without dead ends: 19231 [2019-09-10 08:32:48,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19231 states. [2019-09-10 08:32:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19231 to 11597. [2019-09-10 08:32:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-10 08:32:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17105 transitions. [2019-09-10 08:32:48,825 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17105 transitions. Word has length 140 [2019-09-10 08:32:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:48,826 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17105 transitions. [2019-09-10 08:32:48,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17105 transitions. [2019-09-10 08:32:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:32:48,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:48,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:48,829 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1469081280, now seen corresponding path program 1 times [2019-09-10 08:32:48,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:48,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:48,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:49,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:49,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:49,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:49,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:49,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:49,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:49,110 INFO L87 Difference]: Start difference. First operand 11597 states and 17105 transitions. Second operand 10 states. [2019-09-10 08:32:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:50,435 INFO L93 Difference]: Finished difference Result 23138 states and 33999 transitions. [2019-09-10 08:32:50,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:32:50,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2019-09-10 08:32:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:50,477 INFO L225 Difference]: With dead ends: 23138 [2019-09-10 08:32:50,477 INFO L226 Difference]: Without dead ends: 23138 [2019-09-10 08:32:50,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:32:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23138 states. [2019-09-10 08:32:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23138 to 11597. [2019-09-10 08:32:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-10 08:32:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17102 transitions. [2019-09-10 08:32:51,216 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17102 transitions. Word has length 141 [2019-09-10 08:32:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:51,216 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17102 transitions. [2019-09-10 08:32:51,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17102 transitions. [2019-09-10 08:32:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:32:51,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:51,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:51,220 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1896763478, now seen corresponding path program 1 times [2019-09-10 08:32:51,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:51,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:51,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:51,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:51,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:51,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:51,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:51,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:51,501 INFO L87 Difference]: Start difference. First operand 11597 states and 17102 transitions. Second operand 10 states. [2019-09-10 08:32:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:52,644 INFO L93 Difference]: Finished difference Result 23231 states and 34166 transitions. [2019-09-10 08:32:52,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:32:52,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2019-09-10 08:32:52,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:52,688 INFO L225 Difference]: With dead ends: 23231 [2019-09-10 08:32:52,689 INFO L226 Difference]: Without dead ends: 23231 [2019-09-10 08:32:52,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23231 states. [2019-09-10 08:32:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23231 to 11597. [2019-09-10 08:32:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-10 08:32:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17096 transitions. [2019-09-10 08:32:53,075 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17096 transitions. Word has length 141 [2019-09-10 08:32:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:53,075 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17096 transitions. [2019-09-10 08:32:53,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17096 transitions. [2019-09-10 08:32:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:32:53,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:53,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:53,080 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1860895276, now seen corresponding path program 1 times [2019-09-10 08:32:53,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:53,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:53,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:53,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:53,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:53,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:53,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:53,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:53,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:53,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:53,418 INFO L87 Difference]: Start difference. First operand 11597 states and 17096 transitions. Second operand 9 states. [2019-09-10 08:32:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:54,212 INFO L93 Difference]: Finished difference Result 22744 states and 33555 transitions. [2019-09-10 08:32:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:32:54,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-09-10 08:32:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:54,256 INFO L225 Difference]: With dead ends: 22744 [2019-09-10 08:32:54,256 INFO L226 Difference]: Without dead ends: 22744 [2019-09-10 08:32:54,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:32:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22744 states. [2019-09-10 08:32:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22744 to 11597. [2019-09-10 08:32:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-10 08:32:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17095 transitions. [2019-09-10 08:32:54,524 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17095 transitions. Word has length 141 [2019-09-10 08:32:54,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:54,525 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17095 transitions. [2019-09-10 08:32:54,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17095 transitions. [2019-09-10 08:32:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:32:54,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:54,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:54,528 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:54,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2088796575, now seen corresponding path program 1 times [2019-09-10 08:32:54,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:54,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:54,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:54,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:54,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:54,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:54,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:54,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:54,860 INFO L87 Difference]: Start difference. First operand 11597 states and 17095 transitions. Second operand 10 states. [2019-09-10 08:32:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:55,878 INFO L93 Difference]: Finished difference Result 23213 states and 34115 transitions. [2019-09-10 08:32:55,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:32:55,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-09-10 08:32:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:55,909 INFO L225 Difference]: With dead ends: 23213 [2019-09-10 08:32:55,909 INFO L226 Difference]: Without dead ends: 23213 [2019-09-10 08:32:55,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23213 states. [2019-09-10 08:32:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23213 to 11597. [2019-09-10 08:32:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-10 08:32:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17082 transitions. [2019-09-10 08:32:56,139 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17082 transitions. Word has length 142 [2019-09-10 08:32:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:56,139 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17082 transitions. [2019-09-10 08:32:56,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:56,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17082 transitions. [2019-09-10 08:32:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:32:56,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:56,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:56,143 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:56,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash 564881863, now seen corresponding path program 1 times [2019-09-10 08:32:56,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:56,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:56,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:56,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:56,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:56,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:56,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:56,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:56,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:56,419 INFO L87 Difference]: Start difference. First operand 11597 states and 17082 transitions. Second operand 10 states. [2019-09-10 08:32:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:57,422 INFO L93 Difference]: Finished difference Result 23243 states and 34147 transitions. [2019-09-10 08:32:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:32:57,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2019-09-10 08:32:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:57,448 INFO L225 Difference]: With dead ends: 23243 [2019-09-10 08:32:57,448 INFO L226 Difference]: Without dead ends: 23243 [2019-09-10 08:32:57,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23243 states. [2019-09-10 08:32:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23243 to 11597. [2019-09-10 08:32:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-10 08:32:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17072 transitions. [2019-09-10 08:32:57,780 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17072 transitions. Word has length 143 [2019-09-10 08:32:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:57,780 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17072 transitions. [2019-09-10 08:32:57,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17072 transitions. [2019-09-10 08:32:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:32:57,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:57,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:57,783 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash 256129908, now seen corresponding path program 1 times [2019-09-10 08:32:57,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:57,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:57,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:58,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:58,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:58,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:58,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:58,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:58,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:58,074 INFO L87 Difference]: Start difference. First operand 11597 states and 17072 transitions. Second operand 10 states. [2019-09-10 08:32:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:59,479 INFO L93 Difference]: Finished difference Result 23163 states and 34007 transitions. [2019-09-10 08:32:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:32:59,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2019-09-10 08:32:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:59,500 INFO L225 Difference]: With dead ends: 23163 [2019-09-10 08:32:59,500 INFO L226 Difference]: Without dead ends: 23163 [2019-09-10 08:32:59,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23163 states. [2019-09-10 08:32:59,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23163 to 11597. [2019-09-10 08:32:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-10 08:32:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17057 transitions. [2019-09-10 08:32:59,685 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17057 transitions. Word has length 144 [2019-09-10 08:32:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:59,686 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17057 transitions. [2019-09-10 08:32:59,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17057 transitions. [2019-09-10 08:32:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 08:32:59,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:59,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:59,688 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:59,689 INFO L82 PathProgramCache]: Analyzing trace with hash 86948800, now seen corresponding path program 1 times [2019-09-10 08:32:59,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:59,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:59,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:59,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:59,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:59,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:59,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:59,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:59,973 INFO L87 Difference]: Start difference. First operand 11597 states and 17057 transitions. Second operand 10 states. [2019-09-10 08:33:00,551 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-09-10 08:33:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:01,217 INFO L93 Difference]: Finished difference Result 23098 states and 33884 transitions. [2019-09-10 08:33:01,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:33:01,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2019-09-10 08:33:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:01,236 INFO L225 Difference]: With dead ends: 23098 [2019-09-10 08:33:01,236 INFO L226 Difference]: Without dead ends: 23098 [2019-09-10 08:33:01,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23098 states. [2019-09-10 08:33:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23098 to 11597. [2019-09-10 08:33:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11597 states. [2019-09-10 08:33:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11597 states to 11597 states and 17040 transitions. [2019-09-10 08:33:01,441 INFO L78 Accepts]: Start accepts. Automaton has 11597 states and 17040 transitions. Word has length 145 [2019-09-10 08:33:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:01,441 INFO L475 AbstractCegarLoop]: Abstraction has 11597 states and 17040 transitions. [2019-09-10 08:33:01,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11597 states and 17040 transitions. [2019-09-10 08:33:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:33:01,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:01,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:01,444 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:01,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash 27281514, now seen corresponding path program 1 times [2019-09-10 08:33:01,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:01,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:01,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:01,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:01,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:01,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:01,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:01,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:01,752 INFO L87 Difference]: Start difference. First operand 11597 states and 17040 transitions. Second operand 10 states. [2019-09-10 08:33:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:03,201 INFO L93 Difference]: Finished difference Result 43771 states and 63915 transitions. [2019-09-10 08:33:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:33:03,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2019-09-10 08:33:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:03,248 INFO L225 Difference]: With dead ends: 43771 [2019-09-10 08:33:03,249 INFO L226 Difference]: Without dead ends: 43771 [2019-09-10 08:33:03,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:33:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43771 states. [2019-09-10 08:33:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43771 to 11654. [2019-09-10 08:33:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-09-10 08:33:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 17116 transitions. [2019-09-10 08:33:03,638 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 17116 transitions. Word has length 146 [2019-09-10 08:33:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:03,638 INFO L475 AbstractCegarLoop]: Abstraction has 11654 states and 17116 transitions. [2019-09-10 08:33:03,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 17116 transitions. [2019-09-10 08:33:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:33:03,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:03,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:03,640 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash -612151363, now seen corresponding path program 1 times [2019-09-10 08:33:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:03,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:03,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:05,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:05,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 08:33:05,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:05,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 08:33:05,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 08:33:05,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:33:05,153 INFO L87 Difference]: Start difference. First operand 11654 states and 17116 transitions. Second operand 23 states. [2019-09-10 08:33:06,271 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:33:06,483 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 08:33:06,798 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 08:33:07,144 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-10 08:33:07,575 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 99 [2019-09-10 08:33:07,771 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 08:33:08,088 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 08:33:08,266 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 08:33:08,528 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:33:08,813 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:33:09,133 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:33:09,356 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:33:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:11,484 INFO L93 Difference]: Finished difference Result 43462 states and 64008 transitions. [2019-09-10 08:33:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:33:11,484 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 147 [2019-09-10 08:33:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:11,532 INFO L225 Difference]: With dead ends: 43462 [2019-09-10 08:33:11,532 INFO L226 Difference]: Without dead ends: 43462 [2019-09-10 08:33:11,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:33:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43462 states. [2019-09-10 08:33:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43462 to 11659. [2019-09-10 08:33:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11659 states. [2019-09-10 08:33:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11659 states to 11659 states and 17119 transitions. [2019-09-10 08:33:11,804 INFO L78 Accepts]: Start accepts. Automaton has 11659 states and 17119 transitions. Word has length 147 [2019-09-10 08:33:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:11,805 INFO L475 AbstractCegarLoop]: Abstraction has 11659 states and 17119 transitions. [2019-09-10 08:33:11,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 08:33:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 11659 states and 17119 transitions. [2019-09-10 08:33:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:33:11,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:11,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:11,807 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:11,808 INFO L82 PathProgramCache]: Analyzing trace with hash 784796829, now seen corresponding path program 1 times [2019-09-10 08:33:11,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:11,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:11,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:11,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:11,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:12,960 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-09-10 08:33:13,365 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2019-09-10 08:33:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:13,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:13,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:33:13,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:13,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:33:13,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:33:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:33:13,687 INFO L87 Difference]: Start difference. First operand 11659 states and 17119 transitions. Second operand 25 states. [2019-09-10 08:33:14,915 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 08:33:15,164 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 08:33:15,564 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 08:33:15,955 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-09-10 08:33:16,444 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 112 [2019-09-10 08:33:16,941 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2019-09-10 08:33:17,169 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 08:33:17,625 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 08:33:18,044 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:33:18,290 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 08:33:18,643 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 08:33:19,120 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 08:33:19,784 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 08:33:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:22,652 INFO L93 Difference]: Finished difference Result 65332 states and 96273 transitions. [2019-09-10 08:33:22,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:33:22,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147 [2019-09-10 08:33:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:22,708 INFO L225 Difference]: With dead ends: 65332 [2019-09-10 08:33:22,708 INFO L226 Difference]: Without dead ends: 65332 [2019-09-10 08:33:22,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:33:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65332 states. [2019-09-10 08:33:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65332 to 11704. [2019-09-10 08:33:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11704 states. [2019-09-10 08:33:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11704 states to 11704 states and 17170 transitions. [2019-09-10 08:33:23,081 INFO L78 Accepts]: Start accepts. Automaton has 11704 states and 17170 transitions. Word has length 147 [2019-09-10 08:33:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:23,081 INFO L475 AbstractCegarLoop]: Abstraction has 11704 states and 17170 transitions. [2019-09-10 08:33:23,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:33:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 11704 states and 17170 transitions. [2019-09-10 08:33:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:33:23,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:23,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:23,083 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash 711494045, now seen corresponding path program 1 times [2019-09-10 08:33:23,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:23,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:23,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:23,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:23,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:24,204 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 08:33:24,375 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 08:33:24,553 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 08:33:24,765 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:33:24,990 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 08:33:25,204 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-09-10 08:33:25,582 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 08:33:25,806 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 08:33:26,079 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 08:33:26,319 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 08:33:26,611 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:33:26,863 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-09-10 08:33:27,145 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-09-10 08:33:27,377 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 08:33:27,639 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 08:33:27,928 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 08:33:28,170 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:33:30,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 08:33:30,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:30,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2019-09-10 08:33:30,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:30,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 08:33:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 08:33:30,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 08:33:30,971 INFO L87 Difference]: Start difference. First operand 11704 states and 17170 transitions. Second operand 48 states. [2019-09-10 08:33:31,284 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-09-10 08:33:32,254 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 08:33:33,206 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 08:33:33,449 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 08:33:33,734 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-09-10 08:33:34,022 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2019-09-10 08:33:34,318 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-09-10 08:33:35,700 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-09-10 08:33:36,172 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-09-10 08:33:36,642 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 87 [2019-09-10 08:33:37,251 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 102 [2019-09-10 08:33:37,902 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 111 [2019-09-10 08:33:38,768 WARN L188 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 133 [2019-09-10 08:33:39,694 WARN L188 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 148 [2019-09-10 08:33:40,926 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 225 DAG size of output: 170 [2019-09-10 08:33:42,145 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 245 DAG size of output: 185 [2019-09-10 08:33:43,594 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 270 DAG size of output: 207 [2019-09-10 08:33:45,113 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 288 DAG size of output: 221 [2019-09-10 08:33:46,949 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 315 DAG size of output: 240 [2019-09-10 08:33:48,964 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 338 DAG size of output: 261 [2019-09-10 08:33:51,306 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 360 DAG size of output: 280 [2019-09-10 08:33:51,891 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 107 [2019-09-10 08:33:52,405 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 107 [2019-09-10 08:33:52,733 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 08:33:53,239 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 104 [2019-09-10 08:33:53,495 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 08:33:53,739 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-10 08:33:54,236 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 104 [2019-09-10 08:33:54,786 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-10 08:33:55,324 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2019-09-10 08:33:55,713 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-10 08:33:56,209 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2019-09-10 08:33:57,066 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-09-10 08:33:58,403 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-09-10 08:34:00,262 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-10 08:34:03,527 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-09-10 08:34:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:16,681 INFO L93 Difference]: Finished difference Result 57523 states and 84229 transitions. [2019-09-10 08:34:16,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 08:34:16,682 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2019-09-10 08:34:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:16,728 INFO L225 Difference]: With dead ends: 57523 [2019-09-10 08:34:16,728 INFO L226 Difference]: Without dead ends: 57523 [2019-09-10 08:34:16,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=1460, Invalid=7660, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 08:34:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57523 states. [2019-09-10 08:34:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57523 to 11858. [2019-09-10 08:34:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11858 states. [2019-09-10 08:34:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11858 states to 11858 states and 17380 transitions. [2019-09-10 08:34:17,030 INFO L78 Accepts]: Start accepts. Automaton has 11858 states and 17380 transitions. Word has length 147 [2019-09-10 08:34:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:17,031 INFO L475 AbstractCegarLoop]: Abstraction has 11858 states and 17380 transitions. [2019-09-10 08:34:17,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 08:34:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 11858 states and 17380 transitions. [2019-09-10 08:34:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:34:17,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:17,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:17,034 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash -214493605, now seen corresponding path program 1 times [2019-09-10 08:34:17,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:17,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:17,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:17,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:18,545 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:34:18,710 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:34:18,942 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 08:34:19,182 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 08:34:19,432 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 08:34:19,717 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 08:34:19,967 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 08:34:20,223 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-09-10 08:34:20,467 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 08:34:20,687 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-09-10 08:34:21,099 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 08:34:21,378 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 08:34:21,631 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 08:34:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:24,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:24,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2019-09-10 08:34:24,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:24,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 08:34:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 08:34:24,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2140, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 08:34:24,625 INFO L87 Difference]: Start difference. First operand 11858 states and 17380 transitions. Second operand 48 states. [2019-09-10 08:34:25,001 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-09-10 08:34:26,987 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-10 08:34:27,248 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 08:34:27,555 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-09-10 08:34:27,867 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-09-10 08:34:29,415 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-09-10 08:34:29,993 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2019-09-10 08:34:30,579 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-09-10 08:34:31,399 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 134 [2019-09-10 08:34:32,509 WARN L188 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 158 [2019-09-10 08:34:33,984 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 225 DAG size of output: 182 [2019-09-10 08:34:38,556 WARN L188 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 252 DAG size of output: 208 [2019-09-10 08:34:43,096 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 282 DAG size of output: 236 [2019-09-10 08:34:45,455 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 311 DAG size of output: 263 [2019-09-10 08:34:48,233 WARN L188 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 329 DAG size of output: 273 [2019-09-10 08:34:51,111 WARN L188 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 351 DAG size of output: 292 [2019-09-10 08:35:08,191 WARN L188 SmtUtils]: Spent 16.67 s on a formula simplification. DAG size of input: 380 DAG size of output: 318 [2019-09-10 08:35:41,467 WARN L188 SmtUtils]: Spent 32.99 s on a formula simplification. DAG size of input: 407 DAG size of output: 342 [2019-09-10 08:36:04,711 WARN L188 SmtUtils]: Spent 22.85 s on a formula simplification. DAG size of input: 427 DAG size of output: 361 [2019-09-10 08:36:05,279 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 110 [2019-09-10 08:36:05,829 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 110 [2019-09-10 08:36:06,345 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-09-10 08:36:06,738 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-09-10 08:36:07,099 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-09-10 08:36:07,651 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:36:08,550 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:36:16,634 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2019-09-10 08:36:17,682 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2019-09-10 08:36:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:43,506 INFO L93 Difference]: Finished difference Result 70375 states and 103314 transitions. [2019-09-10 08:36:43,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 08:36:43,506 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2019-09-10 08:36:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:43,570 INFO L225 Difference]: With dead ends: 70375 [2019-09-10 08:36:43,571 INFO L226 Difference]: Without dead ends: 70375 [2019-09-10 08:36:43,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 107.7s TimeCoverageRelationStatistics Valid=1351, Invalid=8549, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 08:36:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70375 states. [2019-09-10 08:36:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70375 to 11878. [2019-09-10 08:36:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-09-10 08:36:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 17406 transitions. [2019-09-10 08:36:43,907 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 17406 transitions. Word has length 147 [2019-09-10 08:36:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:43,907 INFO L475 AbstractCegarLoop]: Abstraction has 11878 states and 17406 transitions. [2019-09-10 08:36:43,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 08:36:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 17406 transitions. [2019-09-10 08:36:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:36:43,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:43,910 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:43,910 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1641428251, now seen corresponding path program 1 times [2019-09-10 08:36:43,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:43,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:43,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:43,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:43,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:43,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:43,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:43,998 INFO L87 Difference]: Start difference. First operand 11878 states and 17406 transitions. Second operand 3 states. [2019-09-10 08:36:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:44,058 INFO L93 Difference]: Finished difference Result 22501 states and 33052 transitions. [2019-09-10 08:36:44,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:44,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-10 08:36:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:44,082 INFO L225 Difference]: With dead ends: 22501 [2019-09-10 08:36:44,083 INFO L226 Difference]: Without dead ends: 22501 [2019-09-10 08:36:44,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22501 states. [2019-09-10 08:36:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22501 to 21975. [2019-09-10 08:36:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21975 states. [2019-09-10 08:36:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21975 states to 21975 states and 32134 transitions. [2019-09-10 08:36:44,360 INFO L78 Accepts]: Start accepts. Automaton has 21975 states and 32134 transitions. Word has length 147 [2019-09-10 08:36:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:44,361 INFO L475 AbstractCegarLoop]: Abstraction has 21975 states and 32134 transitions. [2019-09-10 08:36:44,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 21975 states and 32134 transitions. [2019-09-10 08:36:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:36:44,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:44,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:44,363 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 706801083, now seen corresponding path program 1 times [2019-09-10 08:36:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:44,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:45,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:45,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:36:45,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:45,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:36:45,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:36:45,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:36:45,480 INFO L87 Difference]: Start difference. First operand 21975 states and 32134 transitions. Second operand 19 states. [2019-09-10 08:36:46,309 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 08:36:46,524 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 08:36:46,841 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-10 08:36:47,160 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-09-10 08:36:47,333 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 08:36:47,730 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:36:48,069 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:36:48,240 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:36:48,504 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:36:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:50,049 INFO L93 Difference]: Finished difference Result 123302 states and 180908 transitions. [2019-09-10 08:36:50,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:36:50,049 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 147 [2019-09-10 08:36:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:50,167 INFO L225 Difference]: With dead ends: 123302 [2019-09-10 08:36:50,167 INFO L226 Difference]: Without dead ends: 123302 [2019-09-10 08:36:50,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:36:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123302 states. [2019-09-10 08:36:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123302 to 22000. [2019-09-10 08:36:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22000 states. [2019-09-10 08:36:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22000 states to 22000 states and 32151 transitions. [2019-09-10 08:36:50,877 INFO L78 Accepts]: Start accepts. Automaton has 22000 states and 32151 transitions. Word has length 147 [2019-09-10 08:36:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:50,877 INFO L475 AbstractCegarLoop]: Abstraction has 22000 states and 32151 transitions. [2019-09-10 08:36:50,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:36:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22000 states and 32151 transitions. [2019-09-10 08:36:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:36:50,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:50,880 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash -263001346, now seen corresponding path program 1 times [2019-09-10 08:36:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:50,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:50,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:52,347 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 08:36:52,644 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 08:36:52,968 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:36:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:54,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:54,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:36:54,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:54,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:36:54,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:36:54,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:36:54,054 INFO L87 Difference]: Start difference. First operand 22000 states and 32151 transitions. Second operand 31 states. [2019-09-10 08:36:54,246 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-10 08:36:55,420 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-09-10 08:36:56,087 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-09-10 08:36:56,402 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-10 08:36:56,851 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-09-10 08:36:57,347 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2019-09-10 08:36:57,973 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 122 [2019-09-10 08:36:58,778 WARN L188 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 135 [2019-09-10 08:36:59,649 WARN L188 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 165 [2019-09-10 08:37:00,594 WARN L188 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 180 [2019-09-10 08:37:00,913 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-10 08:37:01,145 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 08:37:01,654 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-09-10 08:37:02,275 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-09-10 08:37:02,561 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 08:37:03,064 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 08:37:03,742 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 08:37:04,381 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-09-10 08:37:05,144 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 08:37:05,713 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-10 08:37:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:11,389 INFO L93 Difference]: Finished difference Result 123693 states and 181411 transitions. [2019-09-10 08:37:11,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 08:37:11,390 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2019-09-10 08:37:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:11,523 INFO L225 Difference]: With dead ends: 123693 [2019-09-10 08:37:11,524 INFO L226 Difference]: Without dead ends: 123693 [2019-09-10 08:37:11,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=770, Invalid=3390, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 08:37:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123693 states. [2019-09-10 08:37:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123693 to 21979. [2019-09-10 08:37:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21979 states. [2019-09-10 08:37:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21979 states to 21979 states and 32119 transitions. [2019-09-10 08:37:12,551 INFO L78 Accepts]: Start accepts. Automaton has 21979 states and 32119 transitions. Word has length 147 [2019-09-10 08:37:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:12,551 INFO L475 AbstractCegarLoop]: Abstraction has 21979 states and 32119 transitions. [2019-09-10 08:37:12,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:37:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 21979 states and 32119 transitions. [2019-09-10 08:37:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:37:12,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:12,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:12,553 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash 380395743, now seen corresponding path program 1 times [2019-09-10 08:37:12,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:12,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:12,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:12,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:13,602 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:37:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:14,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:14,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 08:37:14,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:14,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 08:37:14,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 08:37:14,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:37:14,309 INFO L87 Difference]: Start difference. First operand 21979 states and 32119 transitions. Second operand 24 states. [2019-09-10 08:37:15,682 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 08:37:15,945 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:37:16,291 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-10 08:37:16,743 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-09-10 08:37:17,265 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2019-09-10 08:37:17,503 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-09-10 08:37:17,755 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-09-10 08:37:18,059 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 08:37:18,303 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 08:37:18,475 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:37:19,010 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 08:37:19,542 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 08:37:19,786 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 08:37:20,231 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 08:37:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:23,377 INFO L93 Difference]: Finished difference Result 111985 states and 164165 transitions. [2019-09-10 08:37:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:37:23,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 147 [2019-09-10 08:37:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:23,478 INFO L225 Difference]: With dead ends: 111985 [2019-09-10 08:37:23,478 INFO L226 Difference]: Without dead ends: 111985 [2019-09-10 08:37:23,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=528, Invalid=2022, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:37:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111985 states. [2019-09-10 08:37:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111985 to 22016. [2019-09-10 08:37:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22016 states. [2019-09-10 08:37:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22016 states to 22016 states and 32167 transitions. [2019-09-10 08:37:24,057 INFO L78 Accepts]: Start accepts. Automaton has 22016 states and 32167 transitions. Word has length 147 [2019-09-10 08:37:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:24,057 INFO L475 AbstractCegarLoop]: Abstraction has 22016 states and 32167 transitions. [2019-09-10 08:37:24,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 08:37:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 22016 states and 32167 transitions. [2019-09-10 08:37:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:37:24,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:24,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:24,060 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1588029789, now seen corresponding path program 1 times [2019-09-10 08:37:24,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:24,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:24,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:24,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:24,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:25,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:37:25,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:25,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:37:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:37:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:37:25,886 INFO L87 Difference]: Start difference. First operand 22016 states and 32167 transitions. Second operand 25 states. [2019-09-10 08:37:27,037 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:37:27,283 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 08:37:27,626 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 08:37:28,004 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-10 08:37:28,474 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-09-10 08:37:28,986 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2019-09-10 08:37:29,220 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 08:37:29,386 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 08:37:29,729 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:37:30,090 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:37:30,388 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:37:30,714 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:37:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:33,145 INFO L93 Difference]: Finished difference Result 73699 states and 107944 transitions. [2019-09-10 08:37:33,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:37:33,145 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147 [2019-09-10 08:37:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:33,210 INFO L225 Difference]: With dead ends: 73699 [2019-09-10 08:37:33,211 INFO L226 Difference]: Without dead ends: 73699 [2019-09-10 08:37:33,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=437, Invalid=1915, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:37:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73699 states. [2019-09-10 08:37:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73699 to 21981. [2019-09-10 08:37:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-09-10 08:37:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 32115 transitions. [2019-09-10 08:37:33,928 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 32115 transitions. Word has length 147 [2019-09-10 08:37:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:33,928 INFO L475 AbstractCegarLoop]: Abstraction has 21981 states and 32115 transitions. [2019-09-10 08:37:33,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:37:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 32115 transitions. [2019-09-10 08:37:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:37:33,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:33,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:33,930 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:33,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:33,931 INFO L82 PathProgramCache]: Analyzing trace with hash -405164467, now seen corresponding path program 1 times [2019-09-10 08:37:33,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:33,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:33,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:33,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:33,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:34,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:34,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:37:34,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:34,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:37:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:37:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:37:34,870 INFO L87 Difference]: Start difference. First operand 21981 states and 32115 transitions. Second operand 17 states. [2019-09-10 08:37:35,655 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 08:37:35,887 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-09-10 08:37:36,039 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:37:36,186 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:37:36,324 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:37:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:37,595 INFO L93 Difference]: Finished difference Result 85956 states and 126097 transitions. [2019-09-10 08:37:37,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:37:37,595 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2019-09-10 08:37:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:37,670 INFO L225 Difference]: With dead ends: 85956 [2019-09-10 08:37:37,670 INFO L226 Difference]: Without dead ends: 85956 [2019-09-10 08:37:37,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:37:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85956 states. [2019-09-10 08:37:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85956 to 21941. [2019-09-10 08:37:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21941 states. [2019-09-10 08:37:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21941 states to 21941 states and 32063 transitions. [2019-09-10 08:37:38,205 INFO L78 Accepts]: Start accepts. Automaton has 21941 states and 32063 transitions. Word has length 148 [2019-09-10 08:37:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:38,205 INFO L475 AbstractCegarLoop]: Abstraction has 21941 states and 32063 transitions. [2019-09-10 08:37:38,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:37:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 21941 states and 32063 transitions. [2019-09-10 08:37:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:37:38,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:38,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:38,207 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:38,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1220357330, now seen corresponding path program 1 times [2019-09-10 08:37:38,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:38,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:38,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:38,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:38,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:39,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:39,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:37:39,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:39,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:37:39,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:37:39,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:37:39,307 INFO L87 Difference]: Start difference. First operand 21941 states and 32063 transitions. Second operand 19 states. [2019-09-10 08:37:40,081 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 08:37:40,296 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:37:40,621 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-09-10 08:37:40,949 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-09-10 08:37:41,128 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:37:41,263 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 08:37:41,592 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:37:41,996 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:37:42,176 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:37:42,484 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 08:37:42,771 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:37:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:43,648 INFO L93 Difference]: Finished difference Result 71016 states and 103988 transitions. [2019-09-10 08:37:43,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:37:43,648 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 148 [2019-09-10 08:37:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:43,709 INFO L225 Difference]: With dead ends: 71016 [2019-09-10 08:37:43,710 INFO L226 Difference]: Without dead ends: 71016 [2019-09-10 08:37:43,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:37:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71016 states. [2019-09-10 08:37:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71016 to 21935. [2019-09-10 08:37:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21935 states. [2019-09-10 08:37:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21935 states to 21935 states and 32051 transitions. [2019-09-10 08:37:44,113 INFO L78 Accepts]: Start accepts. Automaton has 21935 states and 32051 transitions. Word has length 148 [2019-09-10 08:37:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:44,113 INFO L475 AbstractCegarLoop]: Abstraction has 21935 states and 32051 transitions. [2019-09-10 08:37:44,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:37:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 21935 states and 32051 transitions. [2019-09-10 08:37:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:37:44,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:44,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:44,115 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1933106769, now seen corresponding path program 1 times [2019-09-10 08:37:44,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:44,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:44,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:44,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:44,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:44,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:44,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:37:44,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:44,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:37:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:37:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:37:44,696 INFO L87 Difference]: Start difference. First operand 21935 states and 32051 transitions. Second operand 12 states. [2019-09-10 08:37:45,190 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:37:45,363 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 08:37:45,547 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 08:37:45,698 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:37:45,885 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:37:46,053 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:37:46,374 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:37:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:46,742 INFO L93 Difference]: Finished difference Result 86171 states and 126654 transitions. [2019-09-10 08:37:46,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:37:46,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-09-10 08:37:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:46,825 INFO L225 Difference]: With dead ends: 86171 [2019-09-10 08:37:46,826 INFO L226 Difference]: Without dead ends: 86171 [2019-09-10 08:37:46,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:37:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86171 states. [2019-09-10 08:37:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86171 to 21733. [2019-09-10 08:37:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21733 states. [2019-09-10 08:37:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21733 states to 21733 states and 31761 transitions. [2019-09-10 08:37:47,320 INFO L78 Accepts]: Start accepts. Automaton has 21733 states and 31761 transitions. Word has length 148 [2019-09-10 08:37:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:47,320 INFO L475 AbstractCegarLoop]: Abstraction has 21733 states and 31761 transitions. [2019-09-10 08:37:47,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:37:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21733 states and 31761 transitions. [2019-09-10 08:37:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:37:47,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:47,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:47,322 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:47,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1230685290, now seen corresponding path program 1 times [2019-09-10 08:37:47,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:47,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:47,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:47,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:47,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:49,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:49,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:37:49,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:49,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:37:49,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:37:49,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:37:49,156 INFO L87 Difference]: Start difference. First operand 21733 states and 31761 transitions. Second operand 25 states. [2019-09-10 08:37:50,461 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 08:37:50,692 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 08:37:51,026 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 08:37:51,605 WARN L188 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-09-10 08:37:52,118 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2019-09-10 08:37:52,698 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 131 [2019-09-10 08:37:52,939 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 08:37:53,121 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 08:37:53,442 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 08:37:53,791 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 08:37:54,101 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 08:37:54,437 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 08:37:55,123 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 08:37:55,596 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 08:37:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:58,788 INFO L93 Difference]: Finished difference Result 163630 states and 240049 transitions. [2019-09-10 08:37:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:37:58,789 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2019-09-10 08:37:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:58,955 INFO L225 Difference]: With dead ends: 163630 [2019-09-10 08:37:58,956 INFO L226 Difference]: Without dead ends: 163630 [2019-09-10 08:37:58,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=527, Invalid=2229, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:37:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163630 states. [2019-09-10 08:37:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163630 to 21759. [2019-09-10 08:37:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21759 states. [2019-09-10 08:37:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21759 states to 21759 states and 31789 transitions. [2019-09-10 08:37:59,932 INFO L78 Accepts]: Start accepts. Automaton has 21759 states and 31789 transitions. Word has length 148 [2019-09-10 08:37:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:59,932 INFO L475 AbstractCegarLoop]: Abstraction has 21759 states and 31789 transitions. [2019-09-10 08:37:59,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:37:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 21759 states and 31789 transitions. [2019-09-10 08:37:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:37:59,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:59,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:59,934 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:59,934 INFO L82 PathProgramCache]: Analyzing trace with hash -890223344, now seen corresponding path program 1 times [2019-09-10 08:37:59,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:59,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:59,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:59,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:00,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:00,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:38:00,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:00,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:38:00,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:38:00,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:38:00,969 INFO L87 Difference]: Start difference. First operand 21759 states and 31789 transitions. Second operand 19 states. [2019-09-10 08:38:01,607 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-10 08:38:01,809 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:38:02,092 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 08:38:02,396 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 08:38:02,600 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:38:02,966 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:38:03,442 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:38:03,614 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:38:03,851 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:38:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:04,635 INFO L93 Difference]: Finished difference Result 122917 states and 180280 transitions. [2019-09-10 08:38:04,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:38:04,636 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 148 [2019-09-10 08:38:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:04,759 INFO L225 Difference]: With dead ends: 122917 [2019-09-10 08:38:04,760 INFO L226 Difference]: Without dead ends: 122917 [2019-09-10 08:38:04,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:38:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122917 states. [2019-09-10 08:38:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122917 to 21739. [2019-09-10 08:38:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21739 states. [2019-09-10 08:38:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21739 states to 21739 states and 31757 transitions. [2019-09-10 08:38:05,525 INFO L78 Accepts]: Start accepts. Automaton has 21739 states and 31757 transitions. Word has length 148 [2019-09-10 08:38:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:05,526 INFO L475 AbstractCegarLoop]: Abstraction has 21739 states and 31757 transitions. [2019-09-10 08:38:05,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:38:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 21739 states and 31757 transitions. [2019-09-10 08:38:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:38:05,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:05,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:05,527 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1970266993, now seen corresponding path program 1 times [2019-09-10 08:38:05,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:05,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:05,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:06,653 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:38:06,934 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:38:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:08,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:08,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 08:38:08,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:08,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 08:38:08,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 08:38:08,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:38:08,180 INFO L87 Difference]: Start difference. First operand 21739 states and 31757 transitions. Second operand 30 states. [2019-09-10 08:38:09,893 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:38:10,132 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:38:10,378 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 08:38:10,726 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-10 08:38:11,123 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:38:11,652 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 109 [2019-09-10 08:38:12,270 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 128 [2019-09-10 08:38:13,023 WARN L188 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 146 [2019-09-10 08:38:13,291 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 08:38:13,549 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 08:38:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:18,242 INFO L93 Difference]: Finished difference Result 67974 states and 99399 transitions. [2019-09-10 08:38:18,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:38:18,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 148 [2019-09-10 08:38:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:18,309 INFO L225 Difference]: With dead ends: 67974 [2019-09-10 08:38:18,309 INFO L226 Difference]: Without dead ends: 67974 [2019-09-10 08:38:18,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=524, Invalid=2668, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 08:38:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67974 states. [2019-09-10 08:38:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67974 to 21872. [2019-09-10 08:38:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21872 states. [2019-09-10 08:38:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21872 states to 21872 states and 31928 transitions. [2019-09-10 08:38:18,725 INFO L78 Accepts]: Start accepts. Automaton has 21872 states and 31928 transitions. Word has length 148 [2019-09-10 08:38:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:18,725 INFO L475 AbstractCegarLoop]: Abstraction has 21872 states and 31928 transitions. [2019-09-10 08:38:18,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 08:38:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 21872 states and 31928 transitions. [2019-09-10 08:38:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:38:18,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:18,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:18,727 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1747415914, now seen corresponding path program 1 times [2019-09-10 08:38:18,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:18,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:18,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:19,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:19,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:38:19,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:19,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:38:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:38:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:38:19,331 INFO L87 Difference]: Start difference. First operand 21872 states and 31928 transitions. Second operand 13 states. [2019-09-10 08:38:19,824 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-09-10 08:38:20,002 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:38:20,179 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:38:20,493 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-09-10 08:38:20,716 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-10 08:38:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:21,093 INFO L93 Difference]: Finished difference Result 85741 states and 125581 transitions. [2019-09-10 08:38:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:21,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 148 [2019-09-10 08:38:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:21,170 INFO L225 Difference]: With dead ends: 85741 [2019-09-10 08:38:21,170 INFO L226 Difference]: Without dead ends: 85741 [2019-09-10 08:38:21,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:38:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85741 states. [2019-09-10 08:38:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85741 to 21770. [2019-09-10 08:38:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21770 states. [2019-09-10 08:38:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21770 states to 21770 states and 31793 transitions. [2019-09-10 08:38:21,706 INFO L78 Accepts]: Start accepts. Automaton has 21770 states and 31793 transitions. Word has length 148 [2019-09-10 08:38:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:21,706 INFO L475 AbstractCegarLoop]: Abstraction has 21770 states and 31793 transitions. [2019-09-10 08:38:21,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:38:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 21770 states and 31793 transitions. [2019-09-10 08:38:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:38:21,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:21,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:21,708 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 811931432, now seen corresponding path program 1 times [2019-09-10 08:38:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:21,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:21,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:22,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:38:22,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:22,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:38:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:38:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:38:22,766 INFO L87 Difference]: Start difference. First operand 21770 states and 31793 transitions. Second operand 16 states. [2019-09-10 08:38:22,938 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-09-10 08:38:23,450 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 08:38:23,691 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:38:23,874 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 08:38:24,244 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-09-10 08:38:24,488 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 08:38:24,751 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 08:38:24,925 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:38:25,081 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:38:25,316 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-09-10 08:38:25,519 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 08:38:25,735 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 08:38:25,959 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-09-10 08:38:26,756 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:38:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:27,337 INFO L93 Difference]: Finished difference Result 127447 states and 186978 transitions. [2019-09-10 08:38:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:38:27,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 148 [2019-09-10 08:38:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:27,467 INFO L225 Difference]: With dead ends: 127447 [2019-09-10 08:38:27,468 INFO L226 Difference]: Without dead ends: 127447 [2019-09-10 08:38:27,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:38:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127447 states. [2019-09-10 08:38:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127447 to 21594. [2019-09-10 08:38:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21594 states. [2019-09-10 08:38:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21594 states to 21594 states and 31569 transitions. [2019-09-10 08:38:28,227 INFO L78 Accepts]: Start accepts. Automaton has 21594 states and 31569 transitions. Word has length 148 [2019-09-10 08:38:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:28,227 INFO L475 AbstractCegarLoop]: Abstraction has 21594 states and 31569 transitions. [2019-09-10 08:38:28,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:38:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 21594 states and 31569 transitions. [2019-09-10 08:38:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:38:28,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:28,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:28,229 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:28,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:28,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1910678863, now seen corresponding path program 1 times [2019-09-10 08:38:28,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:28,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:28,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:29,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:29,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 08:38:29,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:29,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:38:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:38:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:38:29,236 INFO L87 Difference]: Start difference. First operand 21594 states and 31569 transitions. Second operand 18 states. [2019-09-10 08:38:30,007 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-09-10 08:38:30,200 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:38:30,496 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-09-10 08:38:30,656 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:38:30,820 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:38:30,992 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:38:31,493 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:38:31,728 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 08:38:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:32,648 INFO L93 Difference]: Finished difference Result 99373 states and 145578 transitions. [2019-09-10 08:38:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:38:32,649 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2019-09-10 08:38:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:32,754 INFO L225 Difference]: With dead ends: 99373 [2019-09-10 08:38:32,755 INFO L226 Difference]: Without dead ends: 99373 [2019-09-10 08:38:32,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:38:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99373 states. [2019-09-10 08:38:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99373 to 21501. [2019-09-10 08:38:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21501 states. [2019-09-10 08:38:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21501 states to 21501 states and 31459 transitions. [2019-09-10 08:38:33,320 INFO L78 Accepts]: Start accepts. Automaton has 21501 states and 31459 transitions. Word has length 148 [2019-09-10 08:38:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:33,320 INFO L475 AbstractCegarLoop]: Abstraction has 21501 states and 31459 transitions. [2019-09-10 08:38:33,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:38:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 21501 states and 31459 transitions. [2019-09-10 08:38:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:38:33,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:33,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:33,322 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash -9821882, now seen corresponding path program 1 times [2019-09-10 08:38:33,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:33,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:33,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:33,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:33,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:33,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:33,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:38:33,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:33,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:38:33,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:38:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:38:33,890 INFO L87 Difference]: Start difference. First operand 21501 states and 31459 transitions. Second operand 13 states. [2019-09-10 08:38:34,449 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-10 08:38:34,679 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:38:34,917 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:38:35,299 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:38:35,761 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 08:38:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:36,222 INFO L93 Difference]: Finished difference Result 85026 states and 124721 transitions. [2019-09-10 08:38:36,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:36,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 149 [2019-09-10 08:38:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:36,298 INFO L225 Difference]: With dead ends: 85026 [2019-09-10 08:38:36,299 INFO L226 Difference]: Without dead ends: 85026 [2019-09-10 08:38:36,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:38:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85026 states. [2019-09-10 08:38:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85026 to 21398. [2019-09-10 08:38:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21398 states. [2019-09-10 08:38:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21398 states to 21398 states and 31334 transitions. [2019-09-10 08:38:36,811 INFO L78 Accepts]: Start accepts. Automaton has 21398 states and 31334 transitions. Word has length 149 [2019-09-10 08:38:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:36,812 INFO L475 AbstractCegarLoop]: Abstraction has 21398 states and 31334 transitions. [2019-09-10 08:38:36,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:38:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states and 31334 transitions. [2019-09-10 08:38:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:38:36,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:36,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:36,813 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:36,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash -186454579, now seen corresponding path program 1 times [2019-09-10 08:38:36,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:36,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:36,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:36,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:36,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:38,102 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 08:38:38,308 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 08:38:38,455 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:38:38,604 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 08:38:38,767 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:38:38,951 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:38:39,124 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:38:39,298 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 08:38:39,451 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:38:39,635 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 08:38:39,808 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:38:39,990 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:38:40,175 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 08:38:40,373 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 08:38:40,561 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:38:40,815 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 08:38:40,997 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:38:41,204 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 08:38:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:44,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:44,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2019-09-10 08:38:44,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:44,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 08:38:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 08:38:44,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 08:38:44,213 INFO L87 Difference]: Start difference. First operand 21398 states and 31334 transitions. Second operand 50 states. [2019-09-10 08:38:44,725 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 72 [2019-09-10 08:38:45,809 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 08:38:46,073 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 08:38:46,394 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:38:46,717 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 08:38:47,087 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 08:38:47,463 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:38:47,885 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:38:48,319 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-10 08:38:49,029 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-09-10 08:38:49,569 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-10 08:38:51,298 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-09-10 08:38:51,892 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-09-10 08:38:52,455 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 90 [2019-09-10 08:38:53,037 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 98 [2019-09-10 08:38:53,731 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 108 [2019-09-10 08:38:54,442 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 115 [2019-09-10 08:38:55,270 WARN L188 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 124 [2019-09-10 08:38:56,130 WARN L188 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 133 [2019-09-10 08:38:57,104 WARN L188 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 144 [2019-09-10 08:38:58,090 WARN L188 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 153 [2019-09-10 08:38:59,218 WARN L188 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 164 [2019-09-10 08:39:00,424 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 233 DAG size of output: 174 [2019-09-10 08:39:01,895 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 263 DAG size of output: 196 [2019-09-10 08:39:03,455 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 280 DAG size of output: 212 [2019-09-10 08:39:05,155 WARN L188 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 291 DAG size of output: 222 [2019-09-10 08:39:05,720 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2019-09-10 08:39:06,271 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2019-09-10 08:39:07,057 WARN L188 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 112 [2019-09-10 08:39:07,581 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 105 [2019-09-10 08:39:08,299 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-09-10 08:39:08,729 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2019-09-10 08:39:09,549 WARN L188 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-09-10 08:39:10,106 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 08:39:11,033 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 08:39:12,098 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:39:12,643 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 08:39:14,046 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 08:39:15,985 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:39:18,308 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:39:19,649 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 08:39:20,075 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 08:39:20,685 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:39:21,438 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 08:39:21,965 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-09-10 08:39:28,507 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 82 [2019-09-10 08:39:29,840 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2019-09-10 08:39:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:57,688 INFO L93 Difference]: Finished difference Result 260149 states and 381352 transitions. [2019-09-10 08:39:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 08:39:57,689 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 149 [2019-09-10 08:39:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:57,971 INFO L225 Difference]: With dead ends: 260149 [2019-09-10 08:39:57,971 INFO L226 Difference]: Without dead ends: 260149 [2019-09-10 08:39:57,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2570 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=1817, Invalid=10615, Unknown=0, NotChecked=0, Total=12432 [2019-09-10 08:39:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260149 states. [2019-09-10 08:39:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260149 to 21424. [2019-09-10 08:39:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21424 states. [2019-09-10 08:39:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21424 states to 21424 states and 31366 transitions. [2019-09-10 08:39:59,200 INFO L78 Accepts]: Start accepts. Automaton has 21424 states and 31366 transitions. Word has length 149 [2019-09-10 08:39:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:59,201 INFO L475 AbstractCegarLoop]: Abstraction has 21424 states and 31366 transitions. [2019-09-10 08:39:59,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 08:39:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 21424 states and 31366 transitions. [2019-09-10 08:39:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:39:59,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:59,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:59,202 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash -714511866, now seen corresponding path program 1 times [2019-09-10 08:39:59,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:59,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:59,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:59,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:59,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:00,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:00,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:40:00,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:00,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:40:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:40:00,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:40:00,404 INFO L87 Difference]: Start difference. First operand 21424 states and 31366 transitions. Second operand 19 states. [2019-09-10 08:40:01,333 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:40:01,501 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 08:40:01,761 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 08:40:02,056 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:40:02,254 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 08:40:02,704 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 08:40:02,845 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 08:40:03,100 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 08:40:03,422 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:40:03,796 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:40:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:05,092 INFO L93 Difference]: Finished difference Result 132258 states and 193772 transitions. [2019-09-10 08:40:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:40:05,093 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 149 [2019-09-10 08:40:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:05,223 INFO L225 Difference]: With dead ends: 132258 [2019-09-10 08:40:05,223 INFO L226 Difference]: Without dead ends: 132258 [2019-09-10 08:40:05,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:40:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132258 states. [2019-09-10 08:40:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132258 to 21433. [2019-09-10 08:40:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21433 states. [2019-09-10 08:40:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21433 states to 21433 states and 31378 transitions. [2019-09-10 08:40:07,072 INFO L78 Accepts]: Start accepts. Automaton has 21433 states and 31378 transitions. Word has length 149 [2019-09-10 08:40:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:07,072 INFO L475 AbstractCegarLoop]: Abstraction has 21433 states and 31378 transitions. [2019-09-10 08:40:07,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:40:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21433 states and 31378 transitions. [2019-09-10 08:40:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:40:07,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:07,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:07,074 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash 206342949, now seen corresponding path program 1 times [2019-09-10 08:40:07,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:07,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:07,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:07,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:07,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:07,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:07,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:40:07,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:07,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:40:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:40:07,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:40:07,501 INFO L87 Difference]: Start difference. First operand 21433 states and 31378 transitions. Second operand 12 states. [2019-09-10 08:40:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:08,048 INFO L93 Difference]: Finished difference Result 42509 states and 62350 transitions. [2019-09-10 08:40:08,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:40:08,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2019-09-10 08:40:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:08,084 INFO L225 Difference]: With dead ends: 42509 [2019-09-10 08:40:08,085 INFO L226 Difference]: Without dead ends: 42509 [2019-09-10 08:40:08,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:40:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42509 states. [2019-09-10 08:40:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42509 to 21327. [2019-09-10 08:40:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21327 states. [2019-09-10 08:40:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21327 states to 21327 states and 31252 transitions. [2019-09-10 08:40:08,364 INFO L78 Accepts]: Start accepts. Automaton has 21327 states and 31252 transitions. Word has length 149 [2019-09-10 08:40:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:08,365 INFO L475 AbstractCegarLoop]: Abstraction has 21327 states and 31252 transitions. [2019-09-10 08:40:08,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:40:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 21327 states and 31252 transitions. [2019-09-10 08:40:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:40:08,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:08,366 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:08,366 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1770358535, now seen corresponding path program 1 times [2019-09-10 08:40:08,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:08,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:09,080 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 08:40:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:09,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:09,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:40:09,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:09,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:40:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:40:09,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:40:09,642 INFO L87 Difference]: Start difference. First operand 21327 states and 31252 transitions. Second operand 14 states. [2019-09-10 08:40:10,285 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 08:40:10,440 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 08:40:10,587 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 08:40:10,808 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 08:40:11,010 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 08:40:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:11,378 INFO L93 Difference]: Finished difference Result 84617 states and 124244 transitions. [2019-09-10 08:40:11,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:40:11,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2019-09-10 08:40:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:11,452 INFO L225 Difference]: With dead ends: 84617 [2019-09-10 08:40:11,452 INFO L226 Difference]: Without dead ends: 84617 [2019-09-10 08:40:11,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:40:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84617 states. [2019-09-10 08:40:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84617 to 21315. [2019-09-10 08:40:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21315 states. [2019-09-10 08:40:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21315 states to 21315 states and 31238 transitions. [2019-09-10 08:40:11,957 INFO L78 Accepts]: Start accepts. Automaton has 21315 states and 31238 transitions. Word has length 149 [2019-09-10 08:40:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:11,957 INFO L475 AbstractCegarLoop]: Abstraction has 21315 states and 31238 transitions. [2019-09-10 08:40:11,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:40:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 21315 states and 31238 transitions. [2019-09-10 08:40:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:40:11,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:11,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:11,958 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash -736718463, now seen corresponding path program 1 times [2019-09-10 08:40:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:11,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:12,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:12,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 08:40:12,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:12,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 08:40:12,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 08:40:12,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:40:12,935 INFO L87 Difference]: Start difference. First operand 21315 states and 31238 transitions. Second operand 19 states. [2019-09-10 08:40:14,022 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 08:40:14,261 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:40:14,559 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:40:14,869 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 08:40:15,114 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 08:40:15,252 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 08:40:15,594 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:40:16,013 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 08:40:16,364 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:40:16,703 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:40:16,944 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 08:40:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:18,162 INFO L93 Difference]: Finished difference Result 84635 states and 124262 transitions. [2019-09-10 08:40:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:40:18,162 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 149 [2019-09-10 08:40:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:18,298 INFO L225 Difference]: With dead ends: 84635 [2019-09-10 08:40:18,298 INFO L226 Difference]: Without dead ends: 84619 [2019-09-10 08:40:18,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=325, Invalid=1235, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:40:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84619 states. [2019-09-10 08:40:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84619 to 21293. [2019-09-10 08:40:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21293 states. [2019-09-10 08:40:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21293 states to 21293 states and 31212 transitions. [2019-09-10 08:40:18,806 INFO L78 Accepts]: Start accepts. Automaton has 21293 states and 31212 transitions. Word has length 149 [2019-09-10 08:40:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:18,807 INFO L475 AbstractCegarLoop]: Abstraction has 21293 states and 31212 transitions. [2019-09-10 08:40:18,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 08:40:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 21293 states and 31212 transitions. [2019-09-10 08:40:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:40:18,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:18,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:18,808 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1716902069, now seen corresponding path program 1 times [2019-09-10 08:40:18,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:18,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:18,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:20,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:20,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:40:20,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:20,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:40:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:40:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:40:20,682 INFO L87 Difference]: Start difference. First operand 21293 states and 31212 transitions. Second operand 25 states. [2019-09-10 08:40:21,925 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:40:22,091 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:40:22,297 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:40:22,535 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:40:22,894 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-09-10 08:40:23,459 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2019-09-10 08:40:23,678 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 08:40:24,188 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 08:40:25,673 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:40:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:28,859 INFO L93 Difference]: Finished difference Result 189838 states and 278318 transitions. [2019-09-10 08:40:28,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 08:40:28,860 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 150 [2019-09-10 08:40:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:29,111 INFO L225 Difference]: With dead ends: 189838 [2019-09-10 08:40:29,112 INFO L226 Difference]: Without dead ends: 189838 [2019-09-10 08:40:29,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=493, Invalid=2369, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 08:40:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189838 states. [2019-09-10 08:40:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189838 to 21277. [2019-09-10 08:40:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21277 states. [2019-09-10 08:40:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 31192 transitions. [2019-09-10 08:40:30,440 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 31192 transitions. Word has length 150 [2019-09-10 08:40:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:30,441 INFO L475 AbstractCegarLoop]: Abstraction has 21277 states and 31192 transitions. [2019-09-10 08:40:30,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:40:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 31192 transitions. [2019-09-10 08:40:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:40:30,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:30,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:30,442 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:30,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash -140702477, now seen corresponding path program 1 times [2019-09-10 08:40:30,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:30,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:30,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:30,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:30,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:31,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:31,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:40:31,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:31,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:40:31,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:40:31,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:40:31,154 INFO L87 Difference]: Start difference. First operand 21277 states and 31192 transitions. Second operand 14 states. [2019-09-10 08:40:31,770 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:40:31,980 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:40:32,201 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:40:32,568 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:40:32,817 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:40:33,000 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:40:33,397 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 08:40:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:33,740 INFO L93 Difference]: Finished difference Result 96387 states and 141277 transitions. [2019-09-10 08:40:33,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:40:33,740 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 150 [2019-09-10 08:40:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:33,826 INFO L225 Difference]: With dead ends: 96387 [2019-09-10 08:40:33,826 INFO L226 Difference]: Without dead ends: 96387 [2019-09-10 08:40:33,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:40:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96387 states. [2019-09-10 08:40:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96387 to 21269. [2019-09-10 08:40:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21269 states. [2019-09-10 08:40:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 31183 transitions. [2019-09-10 08:40:34,407 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 31183 transitions. Word has length 150 [2019-09-10 08:40:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:34,407 INFO L475 AbstractCegarLoop]: Abstraction has 21269 states and 31183 transitions. [2019-09-10 08:40:34,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:40:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 31183 transitions. [2019-09-10 08:40:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:40:34,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:34,411 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:34,411 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:34,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash -110580967, now seen corresponding path program 1 times [2019-09-10 08:40:34,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:34,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:34,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:34,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:34,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:34,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:34,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:34,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:34,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:34,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:34,502 INFO L87 Difference]: Start difference. First operand 21269 states and 31183 transitions. Second operand 3 states. [2019-09-10 08:40:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:34,612 INFO L93 Difference]: Finished difference Result 41315 states and 60088 transitions. [2019-09-10 08:40:34,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:34,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-10 08:40:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:34,661 INFO L225 Difference]: With dead ends: 41315 [2019-09-10 08:40:34,661 INFO L226 Difference]: Without dead ends: 41315 [2019-09-10 08:40:34,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41315 states. [2019-09-10 08:40:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41315 to 40273. [2019-09-10 08:40:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40273 states. [2019-09-10 08:40:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40273 states to 40273 states and 58787 transitions. [2019-09-10 08:40:35,307 INFO L78 Accepts]: Start accepts. Automaton has 40273 states and 58787 transitions. Word has length 188 [2019-09-10 08:40:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:35,307 INFO L475 AbstractCegarLoop]: Abstraction has 40273 states and 58787 transitions. [2019-09-10 08:40:35,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 40273 states and 58787 transitions. [2019-09-10 08:40:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:40:35,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:35,312 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:35,313 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:35,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2059924894, now seen corresponding path program 1 times [2019-09-10 08:40:35,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:35,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:35,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:35,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:35,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:35,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:35,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:35,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:35,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:35,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:35,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:35,435 INFO L87 Difference]: Start difference. First operand 40273 states and 58787 transitions. Second operand 3 states. [2019-09-10 08:40:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:35,630 INFO L93 Difference]: Finished difference Result 78283 states and 113216 transitions. [2019-09-10 08:40:35,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:35,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-10 08:40:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:35,704 INFO L225 Difference]: With dead ends: 78283 [2019-09-10 08:40:35,704 INFO L226 Difference]: Without dead ends: 78283 [2019-09-10 08:40:35,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78283 states. [2019-09-10 08:40:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78283 to 76201. [2019-09-10 08:40:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76201 states. [2019-09-10 08:40:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76201 states to 76201 states and 110615 transitions. [2019-09-10 08:40:36,655 INFO L78 Accepts]: Start accepts. Automaton has 76201 states and 110615 transitions. Word has length 189 [2019-09-10 08:40:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:36,655 INFO L475 AbstractCegarLoop]: Abstraction has 76201 states and 110615 transitions. [2019-09-10 08:40:36,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 76201 states and 110615 transitions. [2019-09-10 08:40:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:40:36,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:36,659 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:36,659 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:36,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -876524955, now seen corresponding path program 1 times [2019-09-10 08:40:36,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:36,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:36,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:36,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:36,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:36,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:36,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:36,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:36,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:36,756 INFO L87 Difference]: Start difference. First operand 76201 states and 110615 transitions. Second operand 3 states. [2019-09-10 08:40:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:37,193 INFO L93 Difference]: Finished difference Result 148059 states and 212712 transitions. [2019-09-10 08:40:37,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:37,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 08:40:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:37,367 INFO L225 Difference]: With dead ends: 148059 [2019-09-10 08:40:37,368 INFO L226 Difference]: Without dead ends: 148059 [2019-09-10 08:40:37,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148059 states. [2019-09-10 08:40:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148059 to 143897. [2019-09-10 08:40:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143897 states. [2019-09-10 08:40:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143897 states to 143897 states and 207511 transitions. [2019-09-10 08:40:38,626 INFO L78 Accepts]: Start accepts. Automaton has 143897 states and 207511 transitions. Word has length 190 [2019-09-10 08:40:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:38,626 INFO L475 AbstractCegarLoop]: Abstraction has 143897 states and 207511 transitions. [2019-09-10 08:40:38,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 143897 states and 207511 transitions. [2019-09-10 08:40:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 08:40:38,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:38,629 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:38,629 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1963020609, now seen corresponding path program 1 times [2019-09-10 08:40:38,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:38,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:38,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:38,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:38,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:38,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:38,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:38,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:38,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:38,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:38,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:38,702 INFO L87 Difference]: Start difference. First operand 143897 states and 207511 transitions. Second operand 3 states. [2019-09-10 08:40:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:39,052 INFO L93 Difference]: Finished difference Result 198519 states and 284823 transitions. [2019-09-10 08:40:39,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:39,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-09-10 08:40:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:42,008 INFO L225 Difference]: With dead ends: 198519 [2019-09-10 08:40:42,009 INFO L226 Difference]: Without dead ends: 198519 [2019-09-10 08:40:42,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198519 states. [2019-09-10 08:40:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198519 to 193133. [2019-09-10 08:40:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193133 states. [2019-09-10 08:40:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193133 states to 193133 states and 277419 transitions. [2019-09-10 08:40:43,800 INFO L78 Accepts]: Start accepts. Automaton has 193133 states and 277419 transitions. Word has length 191 [2019-09-10 08:40:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:43,800 INFO L475 AbstractCegarLoop]: Abstraction has 193133 states and 277419 transitions. [2019-09-10 08:40:43,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 193133 states and 277419 transitions. [2019-09-10 08:40:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:40:43,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:43,802 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:43,802 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1836538090, now seen corresponding path program 1 times [2019-09-10 08:40:43,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:43,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:43,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:43,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:43,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:43,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:40:43,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:40:43,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 08:40:43,957 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [193], [196], [199], [201], [205], [208], [211], [213], [217], [220], [223], [225], [229], [232], [235], [237], [241], [244], [247], [249], [253], [256], [259], [261], [265], [268], [271], [273], [277], [280], [283], [285], [288], [292], [295], [298], [302], [305], [308], [311], [314], [316], [319], [322], [325], [327], [330], [333], [336], [338], [341], [344], [347], [349], [352], [355], [358], [360], [363], [366], [369], [371], [374], [377], [380], [382], [384], [387], [390], [393], [395], [397], [400], [407], [409], [412], [413], [415], [418], [431], [434], [442], [444], [457], [460], [468], [470], [473], [481], [483], [496], [509], [520], [523], [526], [528], [545], [548], [551], [553], [568], [593], [620], [623], [626], [628], [643], [670], [673], [676], [678], [694], [697], [699], [703], [706], [890], [891], [895], [896], [897] [2019-09-10 08:40:44,011 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:40:44,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:40:44,186 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:40:45,028 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:40:45,031 INFO L272 AbstractInterpreter]: Visited 185 different actions 532 times. Merged at 50 different actions 332 times. Widened at 19 different actions 37 times. Performed 1994 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1994 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 16 fixpoints after 9 different actions. Largest state had 227 variables. [2019-09-10 08:40:45,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:45,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:40:45,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:40:45,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:40:45,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:45,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:40:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:45,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:40:45,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:40:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:45,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:40:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-10 08:40:45,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:40:45,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 08:40:45,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:40:45,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:40:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:40:45,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:40:45,771 INFO L87 Difference]: Start difference. First operand 193133 states and 277419 transitions. Second operand 11 states. [2019-09-10 08:40:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:50,269 INFO L93 Difference]: Finished difference Result 303523 states and 430638 transitions. [2019-09-10 08:40:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:40:50,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-09-10 08:40:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:51,002 INFO L225 Difference]: With dead ends: 303523 [2019-09-10 08:40:51,003 INFO L226 Difference]: Without dead ends: 303523 [2019-09-10 08:40:51,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 378 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:40:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303523 states. [2019-09-10 08:40:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303523 to 204965. [2019-09-10 08:40:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204965 states. [2019-09-10 08:40:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204965 states to 204965 states and 292035 transitions. [2019-09-10 08:40:56,182 INFO L78 Accepts]: Start accepts. Automaton has 204965 states and 292035 transitions. Word has length 193 [2019-09-10 08:40:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:56,182 INFO L475 AbstractCegarLoop]: Abstraction has 204965 states and 292035 transitions. [2019-09-10 08:40:56,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:40:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 204965 states and 292035 transitions. [2019-09-10 08:40:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:40:56,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:56,185 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:56,185 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:56,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2066046004, now seen corresponding path program 1 times [2019-09-10 08:40:56,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:56,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:56,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:56,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:56,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:56,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:56,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:40:56,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:56,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:40:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:40:56,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:40:56,357 INFO L87 Difference]: Start difference. First operand 204965 states and 292035 transitions. Second operand 7 states. [2019-09-10 08:40:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:58,631 INFO L93 Difference]: Finished difference Result 965411 states and 1349838 transitions. [2019-09-10 08:40:58,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:40:58,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-09-10 08:40:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:00,221 INFO L225 Difference]: With dead ends: 965411 [2019-09-10 08:41:00,221 INFO L226 Difference]: Without dead ends: 965411 [2019-09-10 08:41:00,222 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 08:41:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965411 states. [2019-09-10 08:41:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965411 to 437565. [2019-09-10 08:41:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437565 states. [2019-09-10 08:41:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437565 states to 437565 states and 622827 transitions. [2019-09-10 08:41:15,823 INFO L78 Accepts]: Start accepts. Automaton has 437565 states and 622827 transitions. Word has length 193 [2019-09-10 08:41:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:15,823 INFO L475 AbstractCegarLoop]: Abstraction has 437565 states and 622827 transitions. [2019-09-10 08:41:15,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:41:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 437565 states and 622827 transitions. [2019-09-10 08:41:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:41:15,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:15,825 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:15,825 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2129115730, now seen corresponding path program 1 times [2019-09-10 08:41:15,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:15,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:15,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:15,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:15,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:15,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:15,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:41:15,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:15,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:41:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:41:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:41:15,979 INFO L87 Difference]: Start difference. First operand 437565 states and 622827 transitions. Second operand 7 states. [2019-09-10 08:41:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:18,259 INFO L93 Difference]: Finished difference Result 734551 states and 1032618 transitions. [2019-09-10 08:41:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:41:18,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-09-10 08:41:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:27,567 INFO L225 Difference]: With dead ends: 734551 [2019-09-10 08:41:27,568 INFO L226 Difference]: Without dead ends: 734551 [2019-09-10 08:41:27,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:41:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734551 states. [2019-09-10 08:41:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734551 to 462621. [2019-09-10 08:41:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462621 states. [2019-09-10 08:41:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462621 states to 462621 states and 656235 transitions. [2019-09-10 08:41:34,446 INFO L78 Accepts]: Start accepts. Automaton has 462621 states and 656235 transitions. Word has length 193 [2019-09-10 08:41:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:34,447 INFO L475 AbstractCegarLoop]: Abstraction has 462621 states and 656235 transitions. [2019-09-10 08:41:34,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:41:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 462621 states and 656235 transitions. [2019-09-10 08:41:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 08:41:34,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:34,448 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:34,449 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:34,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -493077976, now seen corresponding path program 1 times [2019-09-10 08:41:34,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:34,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:34,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:34,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:34,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:34,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:34,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:41:34,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:34,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:41:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:41:34,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:41:34,611 INFO L87 Difference]: Start difference. First operand 462621 states and 656235 transitions. Second operand 7 states. [2019-09-10 08:41:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:47,873 INFO L93 Difference]: Finished difference Result 1261597 states and 1773521 transitions. [2019-09-10 08:41:47,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:41:47,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-09-10 08:41:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:49,474 INFO L225 Difference]: With dead ends: 1261597 [2019-09-10 08:41:49,474 INFO L226 Difference]: Without dead ends: 1261597 [2019-09-10 08:41:49,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:41:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261597 states. [2019-09-10 08:42:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261597 to 486831. [2019-09-10 08:42:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486831 states. [2019-09-10 08:42:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486831 states to 486831 states and 689860 transitions. [2019-09-10 08:42:06,711 INFO L78 Accepts]: Start accepts. Automaton has 486831 states and 689860 transitions. Word has length 193 [2019-09-10 08:42:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:06,712 INFO L475 AbstractCegarLoop]: Abstraction has 486831 states and 689860 transitions. [2019-09-10 08:42:06,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:42:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 486831 states and 689860 transitions. [2019-09-10 08:42:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 08:42:06,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:06,745 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:06,745 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1711904776, now seen corresponding path program 1 times [2019-09-10 08:42:06,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:06,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:06,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:06,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:06,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:06,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:06,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:06,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:06,859 INFO L87 Difference]: Start difference. First operand 486831 states and 689860 transitions. Second operand 3 states. [2019-09-10 08:42:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:13,547 INFO L93 Difference]: Finished difference Result 457601 states and 641141 transitions. [2019-09-10 08:42:13,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:13,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-09-10 08:42:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:14,129 INFO L225 Difference]: With dead ends: 457601 [2019-09-10 08:42:14,129 INFO L226 Difference]: Without dead ends: 457601 [2019-09-10 08:42:14,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457601 states. [2019-09-10 08:42:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457601 to 449247. [2019-09-10 08:42:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449247 states. [2019-09-10 08:42:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449247 states to 449247 states and 631396 transitions. [2019-09-10 08:42:24,232 INFO L78 Accepts]: Start accepts. Automaton has 449247 states and 631396 transitions. Word has length 232 [2019-09-10 08:42:24,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:24,233 INFO L475 AbstractCegarLoop]: Abstraction has 449247 states and 631396 transitions. [2019-09-10 08:42:24,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:24,233 INFO L276 IsEmpty]: Start isEmpty. Operand 449247 states and 631396 transitions. [2019-09-10 08:42:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 08:42:24,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:24,264 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:24,264 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:24,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1922107566, now seen corresponding path program 1 times [2019-09-10 08:42:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:24,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:24,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:24,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:24,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 08:42:24,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:24,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:24,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:24,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:24,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:24,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:24,379 INFO L87 Difference]: Start difference. First operand 449247 states and 631396 transitions. Second operand 3 states. [2019-09-10 08:42:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:32,293 INFO L93 Difference]: Finished difference Result 867931 states and 1204555 transitions. [2019-09-10 08:42:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:32,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-10 08:42:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:33,275 INFO L225 Difference]: With dead ends: 867931 [2019-09-10 08:42:33,275 INFO L226 Difference]: Without dead ends: 867931 [2019-09-10 08:42:33,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867931 states. [2019-09-10 08:42:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867931 to 829517. [2019-09-10 08:42:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829517 states. [2019-09-10 08:42:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829517 states to 829517 states and 1156539 transitions. [2019-09-10 08:42:55,656 INFO L78 Accepts]: Start accepts. Automaton has 829517 states and 1156539 transitions. Word has length 233 [2019-09-10 08:42:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:55,656 INFO L475 AbstractCegarLoop]: Abstraction has 829517 states and 1156539 transitions. [2019-09-10 08:42:55,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 829517 states and 1156539 transitions. [2019-09-10 08:42:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 08:42:55,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:55,707 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:55,708 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1457558028, now seen corresponding path program 1 times [2019-09-10 08:42:55,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:55,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:55,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:42:55,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:55,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:55,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:55,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:55,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:55,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:55,821 INFO L87 Difference]: Start difference. First operand 829517 states and 1156539 transitions. Second operand 3 states. [2019-09-10 08:43:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:10,085 INFO L93 Difference]: Finished difference Result 829519 states and 1148188 transitions. [2019-09-10 08:43:10,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:10,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-10 08:43:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:11,264 INFO L225 Difference]: With dead ends: 829519 [2019-09-10 08:43:11,264 INFO L226 Difference]: Without dead ends: 829519 [2019-09-10 08:43:11,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829519 states. [2019-09-10 08:43:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829519 to 810029. [2019-09-10 08:43:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810029 states. [2019-09-10 08:43:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810029 states to 810029 states and 1125915 transitions. [2019-09-10 08:43:33,827 INFO L78 Accepts]: Start accepts. Automaton has 810029 states and 1125915 transitions. Word has length 234 [2019-09-10 08:43:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:33,827 INFO L475 AbstractCegarLoop]: Abstraction has 810029 states and 1125915 transitions. [2019-09-10 08:43:33,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 810029 states and 1125915 transitions. [2019-09-10 08:43:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 08:43:33,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:33,849 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:33,849 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 597212427, now seen corresponding path program 1 times [2019-09-10 08:43:33,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:33,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:34,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:43:34,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:43:34,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2019-09-10 08:43:34,239 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [193], [196], [199], [201], [205], [208], [211], [213], [217], [220], [223], [225], [229], [232], [235], [237], [241], [244], [247], [249], [253], [256], [259], [261], [265], [268], [271], [273], [277], [280], [283], [285], [288], [292], [295], [298], [302], [305], [308], [311], [314], [316], [319], [322], [325], [327], [330], [333], [336], [338], [341], [344], [347], [349], [352], [355], [358], [360], [363], [366], [369], [371], [374], [377], [380], [382], [384], [387], [390], [393], [395], [397], [400], [403], [407], [409], [412], [413], [415], [418], [421], [429], [431], [434], [442], [444], [447], [455], [457], [460], [468], [470], [473], [481], [483], [486], [494], [496], [499], [507], [509], [518], [520], [523], [526], [528], [543], [545], [548], [551], [553], [568], [593], [595], [598], [601], [603], [618], [620], [623], [626], [628], [643], [645], [648], [651], [653], [668], [670], [673], [676], [678], [687], [692], [694], [697], [710], [712], [715], [718], [720], [890], [891], [895], [896], [897] [2019-09-10 08:43:34,246 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:43:34,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:43:34,296 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:43:36,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:43:36,037 INFO L272 AbstractInterpreter]: Visited 210 different actions 1841 times. Merged at 75 different actions 1405 times. Widened at 34 different actions 313 times. Performed 6801 root evaluator evaluations with a maximum evaluation depth of 10. Performed 6801 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 227 fixpoints after 31 different actions. Largest state had 230 variables. [2019-09-10 08:43:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:36,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:43:36,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:43:36,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:43:36,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:36,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:43:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:36,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1478 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:43:36,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:43:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:43:37,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:43:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:43:37,907 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:43:37,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [12] total 17 [2019-09-10 08:43:37,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:37,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:37,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:37,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:43:37,912 INFO L87 Difference]: Start difference. First operand 810029 states and 1125915 transitions. Second operand 5 states. [2019-09-10 08:43:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:52,085 INFO L93 Difference]: Finished difference Result 1580123 states and 2164265 transitions. [2019-09-10 08:43:52,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:52,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-09-10 08:43:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:54,177 INFO L225 Difference]: With dead ends: 1580123 [2019-09-10 08:43:54,177 INFO L226 Difference]: Without dead ends: 1580123 [2019-09-10 08:43:54,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:43:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580123 states.