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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:56:50,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:56:50,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:56:50,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:56:50,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:56:50,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:56:50,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:56:50,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:56:50,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:56:50,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:56:50,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:56:50,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:56:50,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:56:50,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:56:50,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:56:50,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:56:50,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:56:50,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:56:50,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:56:50,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:56:50,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:56:50,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:56:50,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:56:50,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:56:50,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:56:50,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:56:50,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:56:50,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:56:50,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:56:50,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:56:50,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:56:50,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:56:50,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:56:50,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:56:50,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:56:50,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:56:50,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:56:50,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:56:50,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:56:50,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:56:50,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:56:50,289 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:56:50,303 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:56:50,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:56:50,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:56:50,304 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:56:50,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:56:50,305 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:56:50,305 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:56:50,305 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:56:50,305 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:56:50,306 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:56:50,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:56:50,306 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:56:50,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:56:50,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:56:50,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:56:50,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:56:50,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:56:50,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:56:50,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:56:50,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:56:50,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:56:50,308 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:56:50,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:56:50,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:56:50,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:56:50,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:56:50,309 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:56:50,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:56:50,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:56:50,310 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:56:50,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:56:50,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:56:50,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:56:50,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:56:50,360 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:56:50,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:56:50,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1453e03f/7ddcf1fd15f34940b3986598164331f0/FLAG4e9bd3178 [2019-09-10 08:56:50,979 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:56:50,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:56:50,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1453e03f/7ddcf1fd15f34940b3986598164331f0/FLAG4e9bd3178 [2019-09-10 08:56:51,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1453e03f/7ddcf1fd15f34940b3986598164331f0 [2019-09-10 08:56:51,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:56:51,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:56:51,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:56:51,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:56:51,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:56:51,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:56:51" (1/1) ... [2019-09-10 08:56:51,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5735c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:51, skipping insertion in model container [2019-09-10 08:56:51,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:56:51" (1/1) ... [2019-09-10 08:56:51,280 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:56:51,356 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:56:51,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:56:51,921 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:56:52,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:56:52,300 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:56:52,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52 WrapperNode [2019-09-10 08:56:52,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:56:52,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:56:52,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:56:52,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:56:52,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (1/1) ... [2019-09-10 08:56:52,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (1/1) ... [2019-09-10 08:56:52,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (1/1) ... [2019-09-10 08:56:52,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (1/1) ... [2019-09-10 08:56:52,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (1/1) ... [2019-09-10 08:56:52,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (1/1) ... [2019-09-10 08:56:52,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (1/1) ... [2019-09-10 08:56:52,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:56:52,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:56:52,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:56:52,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:56:52,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (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:56:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:56:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:56:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:56:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:56:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:56:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:56:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:56:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:56:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:56:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:56:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:56:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:56:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:56:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:56:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:56:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:56:54,244 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:56:54,245 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:56:54,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:56:54 BoogieIcfgContainer [2019-09-10 08:56:54,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:56:54,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:56:54,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:56:54,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:56:54,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:56:51" (1/3) ... [2019-09-10 08:56:54,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e791d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:56:54, skipping insertion in model container [2019-09-10 08:56:54,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:56:52" (2/3) ... [2019-09-10 08:56:54,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e791d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:56:54, skipping insertion in model container [2019-09-10 08:56:54,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:56:54" (3/3) ... [2019-09-10 08:56:54,266 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:56:54,278 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:56:54,300 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:56:54,320 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:56:54,354 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:56:54,355 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:56:54,355 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:56:54,355 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:56:54,355 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:56:54,356 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:56:54,356 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:56:54,356 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:56:54,401 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states. [2019-09-10 08:56:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:56:54,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:54,450 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] [2019-09-10 08:56:54,452 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash -173501281, now seen corresponding path program 1 times [2019-09-10 08:56:54,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:54,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:54,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:54,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:55,110 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:56:55,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:55,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:55,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:55,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:55,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:55,143 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 3 states. [2019-09-10 08:56:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:55,289 INFO L93 Difference]: Finished difference Result 501 states and 860 transitions. [2019-09-10 08:56:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:55,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:56:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:55,322 INFO L225 Difference]: With dead ends: 501 [2019-09-10 08:56:55,322 INFO L226 Difference]: Without dead ends: 493 [2019-09-10 08:56:55,325 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:56:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-10 08:56:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2019-09-10 08:56:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 08:56:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2019-09-10 08:56:55,435 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 122 [2019-09-10 08:56:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:55,436 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2019-09-10 08:56:55,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2019-09-10 08:56:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:56:55,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:55,463 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] [2019-09-10 08:56:55,463 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:55,464 INFO L82 PathProgramCache]: Analyzing trace with hash -911022634, now seen corresponding path program 1 times [2019-09-10 08:56:55,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:55,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:55,716 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:56:55,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:55,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:55,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:55,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:55,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:55,720 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand 3 states. [2019-09-10 08:56:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:55,762 INFO L93 Difference]: Finished difference Result 763 states and 1253 transitions. [2019-09-10 08:56:55,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:55,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:56:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:55,769 INFO L225 Difference]: With dead ends: 763 [2019-09-10 08:56:55,769 INFO L226 Difference]: Without dead ends: 763 [2019-09-10 08:56:55,770 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:56:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-10 08:56:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2019-09-10 08:56:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-10 08:56:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1250 transitions. [2019-09-10 08:56:55,798 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1250 transitions. Word has length 125 [2019-09-10 08:56:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:55,800 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1250 transitions. [2019-09-10 08:56:55,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1250 transitions. [2019-09-10 08:56:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:56:55,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:55,805 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] [2019-09-10 08:56:55,805 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash -462854808, now seen corresponding path program 1 times [2019-09-10 08:56:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:55,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:55,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:55,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:56:55,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:55,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:55,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:55,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:55,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:55,974 INFO L87 Difference]: Start difference. First operand 759 states and 1250 transitions. Second operand 3 states. [2019-09-10 08:56:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:56,019 INFO L93 Difference]: Finished difference Result 1281 states and 2103 transitions. [2019-09-10 08:56:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:56,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:56:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:56,030 INFO L225 Difference]: With dead ends: 1281 [2019-09-10 08:56:56,031 INFO L226 Difference]: Without dead ends: 1281 [2019-09-10 08:56:56,031 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:56:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-10 08:56:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1275. [2019-09-10 08:56:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-09-10 08:56:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2098 transitions. [2019-09-10 08:56:56,062 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2098 transitions. Word has length 128 [2019-09-10 08:56:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:56,064 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 2098 transitions. [2019-09-10 08:56:56,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2098 transitions. [2019-09-10 08:56:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:56:56,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:56,067 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:56:56,067 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 750481413, now seen corresponding path program 1 times [2019-09-10 08:56:56,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:56,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:56,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:56,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:56,264 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:56:56,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:56,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:56,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:56,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:56,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:56,267 INFO L87 Difference]: Start difference. First operand 1275 states and 2098 transitions. Second operand 3 states. [2019-09-10 08:56:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:56,317 INFO L93 Difference]: Finished difference Result 2273 states and 3719 transitions. [2019-09-10 08:56:56,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:56,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 08:56:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:56,331 INFO L225 Difference]: With dead ends: 2273 [2019-09-10 08:56:56,331 INFO L226 Difference]: Without dead ends: 2273 [2019-09-10 08:56:56,332 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:56:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-09-10 08:56:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2263. [2019-09-10 08:56:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-09-10 08:56:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3710 transitions. [2019-09-10 08:56:56,389 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3710 transitions. Word has length 131 [2019-09-10 08:56:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:56,390 INFO L475 AbstractCegarLoop]: Abstraction has 2263 states and 3710 transitions. [2019-09-10 08:56:56,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3710 transitions. [2019-09-10 08:56:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:56:56,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:56,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] [2019-09-10 08:56:56,393 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2145185539, now seen corresponding path program 1 times [2019-09-10 08:56:56,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:56,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:56,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:56,627 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:56:56,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:56,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:56:56,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:56,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:56:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:56:56,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:56:56,630 INFO L87 Difference]: Start difference. First operand 2263 states and 3710 transitions. Second operand 6 states. [2019-09-10 08:56:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:56,930 INFO L93 Difference]: Finished difference Result 6567 states and 10822 transitions. [2019-09-10 08:56:56,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:56:56,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 08:56:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:56,961 INFO L225 Difference]: With dead ends: 6567 [2019-09-10 08:56:56,961 INFO L226 Difference]: Without dead ends: 6567 [2019-09-10 08:56:56,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:56:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2019-09-10 08:56:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 5164. [2019-09-10 08:56:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-09-10 08:56:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8485 transitions. [2019-09-10 08:56:57,098 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8485 transitions. Word has length 134 [2019-09-10 08:56:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:57,099 INFO L475 AbstractCegarLoop]: Abstraction has 5164 states and 8485 transitions. [2019-09-10 08:56:57,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:56:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8485 transitions. [2019-09-10 08:56:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:56:57,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:57,103 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:56:57,103 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2142410535, now seen corresponding path program 1 times [2019-09-10 08:56:57,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:57,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:57,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:57,256 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:56:57,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:57,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:57,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:57,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:57,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:57,258 INFO L87 Difference]: Start difference. First operand 5164 states and 8485 transitions. Second operand 4 states. [2019-09-10 08:56:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:57,422 INFO L93 Difference]: Finished difference Result 8735 states and 14408 transitions. [2019-09-10 08:56:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:57,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:56:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:57,476 INFO L225 Difference]: With dead ends: 8735 [2019-09-10 08:56:57,476 INFO L226 Difference]: Without dead ends: 8735 [2019-09-10 08:56:57,477 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:56:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-09-10 08:56:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7629. [2019-09-10 08:56:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7629 states. [2019-09-10 08:56:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 12558 transitions. [2019-09-10 08:56:57,899 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 12558 transitions. Word has length 135 [2019-09-10 08:56:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:57,899 INFO L475 AbstractCegarLoop]: Abstraction has 7629 states and 12558 transitions. [2019-09-10 08:56:57,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 12558 transitions. [2019-09-10 08:56:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:56:57,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:57,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:56:57,904 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:57,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2051827388, now seen corresponding path program 1 times [2019-09-10 08:56:57,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:57,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:57,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:57,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:57,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:58,098 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:56:58,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:58,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:58,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:58,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:58,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:58,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:58,101 INFO L87 Difference]: Start difference. First operand 7629 states and 12558 transitions. Second operand 4 states. [2019-09-10 08:56:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:58,260 INFO L93 Difference]: Finished difference Result 12870 states and 21193 transitions. [2019-09-10 08:56:58,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:58,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 08:56:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:58,318 INFO L225 Difference]: With dead ends: 12870 [2019-09-10 08:56:58,319 INFO L226 Difference]: Without dead ends: 12870 [2019-09-10 08:56:58,319 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:56:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12870 states. [2019-09-10 08:56:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12870 to 11204. [2019-09-10 08:56:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11204 states. [2019-09-10 08:56:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11204 states to 11204 states and 18427 transitions. [2019-09-10 08:56:58,573 INFO L78 Accepts]: Start accepts. Automaton has 11204 states and 18427 transitions. Word has length 136 [2019-09-10 08:56:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:58,574 INFO L475 AbstractCegarLoop]: Abstraction has 11204 states and 18427 transitions. [2019-09-10 08:56:58,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 11204 states and 18427 transitions. [2019-09-10 08:56:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:56:58,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:58,580 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:56:58,581 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash 760808192, now seen corresponding path program 1 times [2019-09-10 08:56:58,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:58,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:58,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:58,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:58,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:58,881 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:56:58,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:58,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:56:58,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:58,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:56:58,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:56:58,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:56:58,883 INFO L87 Difference]: Start difference. First operand 11204 states and 18427 transitions. Second operand 7 states. [2019-09-10 08:56:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:59,516 INFO L93 Difference]: Finished difference Result 41333 states and 67854 transitions. [2019-09-10 08:56:59,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:56:59,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-10 08:56:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:59,627 INFO L225 Difference]: With dead ends: 41333 [2019-09-10 08:56:59,627 INFO L226 Difference]: Without dead ends: 41333 [2019-09-10 08:56:59,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:56:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-09-10 08:57:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 32212. [2019-09-10 08:57:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32212 states. [2019-09-10 08:57:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32212 states to 32212 states and 52804 transitions. [2019-09-10 08:57:00,939 INFO L78 Accepts]: Start accepts. Automaton has 32212 states and 52804 transitions. Word has length 137 [2019-09-10 08:57:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:00,939 INFO L475 AbstractCegarLoop]: Abstraction has 32212 states and 52804 transitions. [2019-09-10 08:57:00,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:57:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 32212 states and 52804 transitions. [2019-09-10 08:57:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:57:00,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:00,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,951 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 547273736, now seen corresponding path program 1 times [2019-09-10 08:57:00,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:00,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:00,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:00,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:00,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:01,105 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:57:01,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:01,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:01,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:01,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:01,108 INFO L87 Difference]: Start difference. First operand 32212 states and 52804 transitions. Second operand 3 states. [2019-09-10 08:57:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:01,574 INFO L93 Difference]: Finished difference Result 47784 states and 78035 transitions. [2019-09-10 08:57:01,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:01,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:57:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:01,678 INFO L225 Difference]: With dead ends: 47784 [2019-09-10 08:57:01,678 INFO L226 Difference]: Without dead ends: 47784 [2019-09-10 08:57:01,679 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:57:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47784 states. [2019-09-10 08:57:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47784 to 47782. [2019-09-10 08:57:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47782 states. [2019-09-10 08:57:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47782 states to 47782 states and 78034 transitions. [2019-09-10 08:57:03,518 INFO L78 Accepts]: Start accepts. Automaton has 47782 states and 78034 transitions. Word has length 138 [2019-09-10 08:57:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:03,518 INFO L475 AbstractCegarLoop]: Abstraction has 47782 states and 78034 transitions. [2019-09-10 08:57:03,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 47782 states and 78034 transitions. [2019-09-10 08:57:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:57:03,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:03,523 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:57:03,523 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:03,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash 696050988, now seen corresponding path program 1 times [2019-09-10 08:57:03,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:03,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:03,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:03,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:03,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:03,636 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:57:03,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:03,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:03,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:03,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:03,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:03,639 INFO L87 Difference]: Start difference. First operand 47782 states and 78034 transitions. Second operand 3 states. [2019-09-10 08:57:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:03,875 INFO L93 Difference]: Finished difference Result 68203 states and 111032 transitions. [2019-09-10 08:57:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:03,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:57:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:04,109 INFO L225 Difference]: With dead ends: 68203 [2019-09-10 08:57:04,110 INFO L226 Difference]: Without dead ends: 68203 [2019-09-10 08:57:04,110 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:57:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-09-10 08:57:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 68201. [2019-09-10 08:57:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68201 states. [2019-09-10 08:57:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68201 states to 68201 states and 111031 transitions. [2019-09-10 08:57:05,220 INFO L78 Accepts]: Start accepts. Automaton has 68201 states and 111031 transitions. Word has length 138 [2019-09-10 08:57:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:05,221 INFO L475 AbstractCegarLoop]: Abstraction has 68201 states and 111031 transitions. [2019-09-10 08:57:05,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 68201 states and 111031 transitions. [2019-09-10 08:57:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:57:05,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:05,225 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:57:05,225 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2057723275, now seen corresponding path program 1 times [2019-09-10 08:57:05,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:05,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:05,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:05,336 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:57:05,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:05,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:05,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:05,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:05,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:05,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:05,338 INFO L87 Difference]: Start difference. First operand 68201 states and 111031 transitions. Second operand 4 states. [2019-09-10 08:57:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:06,139 INFO L93 Difference]: Finished difference Result 133397 states and 217120 transitions. [2019-09-10 08:57:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:57:06,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 08:57:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:06,580 INFO L225 Difference]: With dead ends: 133397 [2019-09-10 08:57:06,580 INFO L226 Difference]: Without dead ends: 133397 [2019-09-10 08:57:06,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133397 states. [2019-09-10 08:57:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133397 to 100647. [2019-09-10 08:57:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100647 states. [2019-09-10 08:57:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100647 states to 100647 states and 163638 transitions. [2019-09-10 08:57:09,394 INFO L78 Accepts]: Start accepts. Automaton has 100647 states and 163638 transitions. Word has length 138 [2019-09-10 08:57:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:09,395 INFO L475 AbstractCegarLoop]: Abstraction has 100647 states and 163638 transitions. [2019-09-10 08:57:09,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 100647 states and 163638 transitions. [2019-09-10 08:57:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:57:09,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:09,399 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:57:09,399 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:09,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:09,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1977095112, now seen corresponding path program 1 times [2019-09-10 08:57:09,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:09,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:09,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:09,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:09,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:09,485 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:57:09,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:09,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:09,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:09,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:09,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:09,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:09,487 INFO L87 Difference]: Start difference. First operand 100647 states and 163638 transitions. Second operand 3 states. [2019-09-10 08:57:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:10,245 INFO L93 Difference]: Finished difference Result 148819 states and 240984 transitions. [2019-09-10 08:57:10,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:10,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:57:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:10,503 INFO L225 Difference]: With dead ends: 148819 [2019-09-10 08:57:10,503 INFO L226 Difference]: Without dead ends: 148819 [2019-09-10 08:57:10,504 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:57:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148819 states. [2019-09-10 08:57:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148819 to 148817. [2019-09-10 08:57:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148817 states. [2019-09-10 08:57:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148817 states to 148817 states and 240983 transitions. [2019-09-10 08:57:13,938 INFO L78 Accepts]: Start accepts. Automaton has 148817 states and 240983 transitions. Word has length 138 [2019-09-10 08:57:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:13,938 INFO L475 AbstractCegarLoop]: Abstraction has 148817 states and 240983 transitions. [2019-09-10 08:57:13,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 148817 states and 240983 transitions. [2019-09-10 08:57:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:57:13,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:13,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] [2019-09-10 08:57:13,941 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:13,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash -682116612, now seen corresponding path program 1 times [2019-09-10 08:57:13,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:13,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:13,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:14,033 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:57:14,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:14,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:14,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:14,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:14,035 INFO L87 Difference]: Start difference. First operand 148817 states and 240983 transitions. Second operand 3 states. [2019-09-10 08:57:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:15,320 INFO L93 Difference]: Finished difference Result 216937 states and 350276 transitions. [2019-09-10 08:57:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:15,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:57:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:15,590 INFO L225 Difference]: With dead ends: 216937 [2019-09-10 08:57:15,590 INFO L226 Difference]: Without dead ends: 216937 [2019-09-10 08:57:15,591 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:57:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216937 states. [2019-09-10 08:57:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216937 to 216935. [2019-09-10 08:57:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216935 states. [2019-09-10 08:57:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216935 states to 216935 states and 350275 transitions. [2019-09-10 08:57:21,059 INFO L78 Accepts]: Start accepts. Automaton has 216935 states and 350275 transitions. Word has length 138 [2019-09-10 08:57:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:21,059 INFO L475 AbstractCegarLoop]: Abstraction has 216935 states and 350275 transitions. [2019-09-10 08:57:21,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 216935 states and 350275 transitions. [2019-09-10 08:57:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:57:21,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:21,061 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:57:21,061 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash 297482555, now seen corresponding path program 1 times [2019-09-10 08:57:21,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:21,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:21,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:21,371 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:57:21,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:21,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:57:21,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:21,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:57:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:57:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:57:21,373 INFO L87 Difference]: Start difference. First operand 216935 states and 350275 transitions. Second operand 6 states. [2019-09-10 08:57:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:22,287 INFO L93 Difference]: Finished difference Result 313197 states and 505899 transitions. [2019-09-10 08:57:22,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:57:22,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 08:57:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:22,778 INFO L225 Difference]: With dead ends: 313197 [2019-09-10 08:57:22,779 INFO L226 Difference]: Without dead ends: 313197 [2019-09-10 08:57:22,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:57:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313197 states. [2019-09-10 08:57:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313197 to 247495. [2019-09-10 08:57:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247495 states. [2019-09-10 08:57:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247495 states to 247495 states and 398885 transitions. [2019-09-10 08:57:29,751 INFO L78 Accepts]: Start accepts. Automaton has 247495 states and 398885 transitions. Word has length 140 [2019-09-10 08:57:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:29,752 INFO L475 AbstractCegarLoop]: Abstraction has 247495 states and 398885 transitions. [2019-09-10 08:57:29,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:57:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 247495 states and 398885 transitions. [2019-09-10 08:57:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:57:29,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:29,753 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:57:29,754 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:29,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash -264023695, now seen corresponding path program 1 times [2019-09-10 08:57:29,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:29,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:29,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:29,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:30,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:30,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:57:30,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:30,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:57:30,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:57:30,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:57:30,022 INFO L87 Difference]: Start difference. First operand 247495 states and 398885 transitions. Second operand 6 states. [2019-09-10 08:57:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:35,896 INFO L93 Difference]: Finished difference Result 480781 states and 775685 transitions. [2019-09-10 08:57:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:57:35,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 08:57:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:36,551 INFO L225 Difference]: With dead ends: 480781 [2019-09-10 08:57:36,551 INFO L226 Difference]: Without dead ends: 480781 [2019-09-10 08:57:36,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:57:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480781 states. [2019-09-10 08:57:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480781 to 440423. [2019-09-10 08:57:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440423 states. [2019-09-10 08:57:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440423 states to 440423 states and 709542 transitions. [2019-09-10 08:57:41,127 INFO L78 Accepts]: Start accepts. Automaton has 440423 states and 709542 transitions. Word has length 143 [2019-09-10 08:57:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:41,127 INFO L475 AbstractCegarLoop]: Abstraction has 440423 states and 709542 transitions. [2019-09-10 08:57:41,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:57:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 440423 states and 709542 transitions. [2019-09-10 08:57:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:57:41,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:41,128 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:57:41,129 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash 403290968, now seen corresponding path program 1 times [2019-09-10 08:57:41,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:41,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:41,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:47,584 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:57:47,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:47,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:57:47,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:47,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:57:47,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:57:47,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:57:47,590 INFO L87 Difference]: Start difference. First operand 440423 states and 709542 transitions. Second operand 5 states. [2019-09-10 08:57:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:49,396 INFO L93 Difference]: Finished difference Result 737111 states and 1180397 transitions. [2019-09-10 08:57:49,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:57:49,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:57:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:50,505 INFO L225 Difference]: With dead ends: 737111 [2019-09-10 08:57:50,505 INFO L226 Difference]: Without dead ends: 737111 [2019-09-10 08:57:50,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:57:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737111 states. [2019-09-10 08:57:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737111 to 446335. [2019-09-10 08:57:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446335 states. [2019-09-10 08:58:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446335 states to 446335 states and 715409 transitions. [2019-09-10 08:58:10,789 INFO L78 Accepts]: Start accepts. Automaton has 446335 states and 715409 transitions. Word has length 144 [2019-09-10 08:58:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:10,789 INFO L475 AbstractCegarLoop]: Abstraction has 446335 states and 715409 transitions. [2019-09-10 08:58:10,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:58:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 446335 states and 715409 transitions. [2019-09-10 08:58:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:58:10,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:10,795 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 08:58:10,795 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:10,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1108095999, now seen corresponding path program 1 times [2019-09-10 08:58:10,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:10,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:10,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:58:10,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:10,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:58:10,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:10,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:58:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:58:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:58:10,986 INFO L87 Difference]: Start difference. First operand 446335 states and 715409 transitions. Second operand 6 states. [2019-09-10 08:58:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:12,389 INFO L93 Difference]: Finished difference Result 540412 states and 867228 transitions. [2019-09-10 08:58:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:58:12,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-10 08:58:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:14,677 INFO L225 Difference]: With dead ends: 540412 [2019-09-10 08:58:14,677 INFO L226 Difference]: Without dead ends: 540412 [2019-09-10 08:58:14,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:58:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540412 states. [2019-09-10 08:58:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540412 to 498602. [2019-09-10 08:58:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498602 states. [2019-09-10 08:58:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498602 states to 498602 states and 799201 transitions. [2019-09-10 08:58:26,812 INFO L78 Accepts]: Start accepts. Automaton has 498602 states and 799201 transitions. Word has length 180 [2019-09-10 08:58:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:26,812 INFO L475 AbstractCegarLoop]: Abstraction has 498602 states and 799201 transitions. [2019-09-10 08:58:26,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:58:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 498602 states and 799201 transitions. [2019-09-10 08:58:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:58:26,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:26,818 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-09-10 08:58:26,819 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:26,819 INFO L82 PathProgramCache]: Analyzing trace with hash -959318747, now seen corresponding path program 1 times [2019-09-10 08:58:26,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:26,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:26,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:26,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:58:26,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:58:26,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:58:26,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2019-09-10 08:58:27,002 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [252], [255], [258], [261], [263], [303], [343], [383], [386], [391], [413], [416], [419], [421], [423], [426], [429], [432], [435], [438], [445], [453], [455], [458], [459], [461], [470], [473], [484], [487], [499], [507], [511], [515], [517], [519], [522], [568], [578], [588], [598], [620], [623], [669], [679], [689], [699], [721], [724], [770], [780], [790], [800], [822], [825], [871], [881], [891], [901], [1529], [1530], [1534], [1535], [1536] [2019-09-10 08:58:27,066 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:58:27,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:58:27,293 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:58:27,644 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:58:27,647 INFO L272 AbstractInterpreter]: Visited 155 different actions 237 times. Merged at 52 different actions 77 times. Never widened. Performed 1060 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1060 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 294 variables. [2019-09-10 08:58:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:27,653 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:58:28,435 INFO L227 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 89.55% of their original sizes. [2019-09-10 08:58:28,436 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:59:01,145 INFO L420 sIntCurrentIteration]: We unified 179 AI predicates to 179 [2019-09-10 08:59:01,145 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:59:01,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:59:01,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [101] imperfect sequences [5] total 104 [2019-09-10 08:59:01,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:01,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-10 08:59:01,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-10 08:59:01,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=8420, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 08:59:01,152 INFO L87 Difference]: Start difference. First operand 498602 states and 799201 transitions. Second operand 101 states. [2019-09-10 09:08:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:08:21,403 INFO L93 Difference]: Finished difference Result 7577994 states and 11720562 transitions. [2019-09-10 09:08:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 788 states. [2019-09-10 09:08:21,403 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 180 [2019-09-10 09:08:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted.