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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:54:37,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:54:37,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:54:37,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:54:37,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:54:37,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:54:37,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:54:37,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:54:37,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:54:37,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:54:37,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:54:37,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:54:37,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:54:37,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:54:37,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:54:37,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:54:37,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:54:37,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:54:37,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:54:37,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:54:37,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:54:37,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:54:37,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:54:37,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:54:37,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:54:37,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:54:37,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:54:37,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:54:37,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:54:37,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:54:37,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:54:37,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:54:37,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:54:37,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:54:37,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:54:37,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:54:37,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:54:37,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:54:37,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:54:37,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:54:37,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:54:37,311 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:54:37,336 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:54:37,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:54:37,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:54:37,338 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:54:37,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:54:37,339 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:54:37,339 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:54:37,339 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:54:37,340 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:54:37,340 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:54:37,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:54:37,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:54:37,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:54:37,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:54:37,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:54:37,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:54:37,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:54:37,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:54:37,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:54:37,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:54:37,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:54:37,345 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:54:37,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:54:37,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:54:37,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:54:37,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:54:37,346 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:54:37,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:54:37,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:54:37,346 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:54:37,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:54:37,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:54:37,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:54:37,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:54:37,421 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:54:37,423 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.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:54:37,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c407dcd/c1f95933bcef4ccb96356e61b4b0e928/FLAGab7995265 [2019-09-10 08:54:38,054 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:54:38,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:54:38,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c407dcd/c1f95933bcef4ccb96356e61b4b0e928/FLAGab7995265 [2019-09-10 08:54:38,334 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c407dcd/c1f95933bcef4ccb96356e61b4b0e928 [2019-09-10 08:54:38,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:54:38,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:54:38,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:54:38,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:54:38,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:54:38,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:54:38" (1/1) ... [2019-09-10 08:54:38,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d5ffe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:38, skipping insertion in model container [2019-09-10 08:54:38,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:54:38" (1/1) ... [2019-09-10 08:54:38,359 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:54:38,430 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:54:38,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:54:38,918 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:54:39,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:54:39,138 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:54:39,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39 WrapperNode [2019-09-10 08:54:39,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:54:39,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:54:39,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:54:39,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:54:39,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (1/1) ... [2019-09-10 08:54:39,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (1/1) ... [2019-09-10 08:54:39,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (1/1) ... [2019-09-10 08:54:39,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (1/1) ... [2019-09-10 08:54:39,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (1/1) ... [2019-09-10 08:54:39,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (1/1) ... [2019-09-10 08:54:39,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (1/1) ... [2019-09-10 08:54:39,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:54:39,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:54:39,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:54:39,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:54:39,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (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:54:39,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:54:39,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:54:39,327 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:54:39,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:54:39,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:54:39,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:54:39,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:54:39,328 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:54:39,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:54:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:54:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:54:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:54:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:54:39,329 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:54:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:54:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:54:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:54:39,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:54:39,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:54:39,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:54:41,012 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:54:41,012 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:54:41,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:54:41 BoogieIcfgContainer [2019-09-10 08:54:41,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:54:41,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:54:41,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:54:41,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:54:41,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:54:38" (1/3) ... [2019-09-10 08:54:41,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34180aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:54:41, skipping insertion in model container [2019-09-10 08:54:41,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:39" (2/3) ... [2019-09-10 08:54:41,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34180aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:54:41, skipping insertion in model container [2019-09-10 08:54:41,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:54:41" (3/3) ... [2019-09-10 08:54:41,022 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:54:41,032 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:54:41,040 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:54:41,060 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:54:41,091 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:54:41,092 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:54:41,092 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:54:41,092 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:54:41,092 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:54:41,093 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:54:41,093 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:54:41,093 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:54:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states. [2019-09-10 08:54:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:54:41,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:41,149 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:54:41,151 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:41,157 INFO L82 PathProgramCache]: Analyzing trace with hash -173501281, now seen corresponding path program 1 times [2019-09-10 08:54:41,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:41,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:41,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:41,873 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:54:41,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:41,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:41,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:41,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:41,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:41,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:41,900 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 3 states. [2019-09-10 08:54:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:42,031 INFO L93 Difference]: Finished difference Result 501 states and 860 transitions. [2019-09-10 08:54:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:42,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:54:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:42,064 INFO L225 Difference]: With dead ends: 501 [2019-09-10 08:54:42,065 INFO L226 Difference]: Without dead ends: 493 [2019-09-10 08:54:42,067 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:54:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-10 08:54:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2019-09-10 08:54:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 08:54:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2019-09-10 08:54:42,152 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 122 [2019-09-10 08:54:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:42,153 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2019-09-10 08:54:42,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2019-09-10 08:54:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:54:42,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:42,159 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:54:42,159 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash -911022634, now seen corresponding path program 1 times [2019-09-10 08:54:42,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:42,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:42,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:42,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:42,338 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:54:42,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:42,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:42,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:42,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:42,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:42,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:42,342 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand 3 states. [2019-09-10 08:54:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:42,393 INFO L93 Difference]: Finished difference Result 763 states and 1253 transitions. [2019-09-10 08:54:42,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:42,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:54:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:42,401 INFO L225 Difference]: With dead ends: 763 [2019-09-10 08:54:42,402 INFO L226 Difference]: Without dead ends: 763 [2019-09-10 08:54:42,403 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:54:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-10 08:54:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2019-09-10 08:54:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-10 08:54:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1250 transitions. [2019-09-10 08:54:42,433 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1250 transitions. Word has length 125 [2019-09-10 08:54:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:42,434 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1250 transitions. [2019-09-10 08:54:42,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1250 transitions. [2019-09-10 08:54:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:54:42,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:42,437 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:54:42,437 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash -462854808, now seen corresponding path program 1 times [2019-09-10 08:54:42,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:42,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:42,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:42,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:42,592 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:54:42,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:42,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:42,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:42,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:42,597 INFO L87 Difference]: Start difference. First operand 759 states and 1250 transitions. Second operand 3 states. [2019-09-10 08:54:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:42,644 INFO L93 Difference]: Finished difference Result 1281 states and 2103 transitions. [2019-09-10 08:54:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:42,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:54:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:42,655 INFO L225 Difference]: With dead ends: 1281 [2019-09-10 08:54:42,655 INFO L226 Difference]: Without dead ends: 1281 [2019-09-10 08:54:42,656 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:54:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-10 08:54:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1275. [2019-09-10 08:54:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-09-10 08:54:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2098 transitions. [2019-09-10 08:54:42,693 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2098 transitions. Word has length 128 [2019-09-10 08:54:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:42,695 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 2098 transitions. [2019-09-10 08:54:42,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2098 transitions. [2019-09-10 08:54:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:54:42,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:42,699 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:54:42,699 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash 750481413, now seen corresponding path program 1 times [2019-09-10 08:54:42,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:42,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:42,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:42,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:42,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:42,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:42,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:42,911 INFO L87 Difference]: Start difference. First operand 1275 states and 2098 transitions. Second operand 3 states. [2019-09-10 08:54:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:42,989 INFO L93 Difference]: Finished difference Result 2273 states and 3719 transitions. [2019-09-10 08:54:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:42,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 08:54:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:43,009 INFO L225 Difference]: With dead ends: 2273 [2019-09-10 08:54:43,009 INFO L226 Difference]: Without dead ends: 2273 [2019-09-10 08:54:43,010 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:54:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-09-10 08:54:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2263. [2019-09-10 08:54:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-09-10 08:54:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3710 transitions. [2019-09-10 08:54:43,091 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3710 transitions. Word has length 131 [2019-09-10 08:54:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:43,092 INFO L475 AbstractCegarLoop]: Abstraction has 2263 states and 3710 transitions. [2019-09-10 08:54:43,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3710 transitions. [2019-09-10 08:54:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:54:43,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:43,101 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:54:43,102 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2145185539, now seen corresponding path program 1 times [2019-09-10 08:54:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:43,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:43,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:43,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:43,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:43,416 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:54:43,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:43,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:54:43,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:43,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:54:43,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:54:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:54:43,420 INFO L87 Difference]: Start difference. First operand 2263 states and 3710 transitions. Second operand 6 states. [2019-09-10 08:54:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:43,792 INFO L93 Difference]: Finished difference Result 6567 states and 10822 transitions. [2019-09-10 08:54:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:54:43,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 08:54:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:43,830 INFO L225 Difference]: With dead ends: 6567 [2019-09-10 08:54:43,830 INFO L226 Difference]: Without dead ends: 6567 [2019-09-10 08:54:43,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:54:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2019-09-10 08:54:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 5164. [2019-09-10 08:54:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-09-10 08:54:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8485 transitions. [2019-09-10 08:54:43,997 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8485 transitions. Word has length 134 [2019-09-10 08:54:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:43,997 INFO L475 AbstractCegarLoop]: Abstraction has 5164 states and 8485 transitions. [2019-09-10 08:54:43,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:54:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8485 transitions. [2019-09-10 08:54:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:54:44,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:44,001 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:54:44,002 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:44,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:44,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2142410535, now seen corresponding path program 1 times [2019-09-10 08:54:44,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:44,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:44,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:44,278 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:54:44,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:44,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:44,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:44,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:44,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:44,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:44,283 INFO L87 Difference]: Start difference. First operand 5164 states and 8485 transitions. Second operand 4 states. [2019-09-10 08:54:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:44,488 INFO L93 Difference]: Finished difference Result 8735 states and 14408 transitions. [2019-09-10 08:54:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:44,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:54:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:44,533 INFO L225 Difference]: With dead ends: 8735 [2019-09-10 08:54:44,534 INFO L226 Difference]: Without dead ends: 8735 [2019-09-10 08:54:44,534 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:54:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-09-10 08:54:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7629. [2019-09-10 08:54:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7629 states. [2019-09-10 08:54:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 12558 transitions. [2019-09-10 08:54:44,839 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 12558 transitions. Word has length 135 [2019-09-10 08:54:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:44,840 INFO L475 AbstractCegarLoop]: Abstraction has 7629 states and 12558 transitions. [2019-09-10 08:54:44,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 12558 transitions. [2019-09-10 08:54:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:54:44,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:44,845 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:54:44,845 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:44,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:44,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2051827388, now seen corresponding path program 1 times [2019-09-10 08:54:44,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:44,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:44,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:45,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:45,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:45,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:45,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:45,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:45,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:45,016 INFO L87 Difference]: Start difference. First operand 7629 states and 12558 transitions. Second operand 4 states. [2019-09-10 08:54:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:45,183 INFO L93 Difference]: Finished difference Result 12870 states and 21193 transitions. [2019-09-10 08:54:45,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:45,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 08:54:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:45,243 INFO L225 Difference]: With dead ends: 12870 [2019-09-10 08:54:45,244 INFO L226 Difference]: Without dead ends: 12870 [2019-09-10 08:54:45,244 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:54:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12870 states. [2019-09-10 08:54:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12870 to 11204. [2019-09-10 08:54:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11204 states. [2019-09-10 08:54:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11204 states to 11204 states and 18427 transitions. [2019-09-10 08:54:45,488 INFO L78 Accepts]: Start accepts. Automaton has 11204 states and 18427 transitions. Word has length 136 [2019-09-10 08:54:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:45,489 INFO L475 AbstractCegarLoop]: Abstraction has 11204 states and 18427 transitions. [2019-09-10 08:54:45,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 11204 states and 18427 transitions. [2019-09-10 08:54:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:54:45,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:45,494 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:54:45,495 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash 760808192, now seen corresponding path program 1 times [2019-09-10 08:54:45,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:45,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:45,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:45,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:45,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:54:45,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:45,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:54:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:54:45,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:54:45,752 INFO L87 Difference]: Start difference. First operand 11204 states and 18427 transitions. Second operand 7 states. [2019-09-10 08:54:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:46,360 INFO L93 Difference]: Finished difference Result 41333 states and 67854 transitions. [2019-09-10 08:54:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:54:46,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-10 08:54:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:46,459 INFO L225 Difference]: With dead ends: 41333 [2019-09-10 08:54:46,460 INFO L226 Difference]: Without dead ends: 41333 [2019-09-10 08:54:46,462 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:54:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-09-10 08:54:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 32212. [2019-09-10 08:54:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32212 states. [2019-09-10 08:54:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32212 states to 32212 states and 52804 transitions. [2019-09-10 08:54:47,777 INFO L78 Accepts]: Start accepts. Automaton has 32212 states and 52804 transitions. Word has length 137 [2019-09-10 08:54:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:47,777 INFO L475 AbstractCegarLoop]: Abstraction has 32212 states and 52804 transitions. [2019-09-10 08:54:47,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:54:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32212 states and 52804 transitions. [2019-09-10 08:54:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:54:47,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:47,784 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:54:47,784 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:47,785 INFO L82 PathProgramCache]: Analyzing trace with hash 547273736, now seen corresponding path program 1 times [2019-09-10 08:54:47,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:47,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:47,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:47,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:47,890 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:54:47,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:47,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:47,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:47,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:47,892 INFO L87 Difference]: Start difference. First operand 32212 states and 52804 transitions. Second operand 3 states. [2019-09-10 08:54:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:48,155 INFO L93 Difference]: Finished difference Result 47784 states and 78035 transitions. [2019-09-10 08:54:48,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:48,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:54:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:48,266 INFO L225 Difference]: With dead ends: 47784 [2019-09-10 08:54:48,266 INFO L226 Difference]: Without dead ends: 47784 [2019-09-10 08:54:48,267 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:54:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47784 states. [2019-09-10 08:54:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47784 to 47782. [2019-09-10 08:54:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47782 states. [2019-09-10 08:54:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47782 states to 47782 states and 78034 transitions. [2019-09-10 08:54:49,957 INFO L78 Accepts]: Start accepts. Automaton has 47782 states and 78034 transitions. Word has length 138 [2019-09-10 08:54:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:49,957 INFO L475 AbstractCegarLoop]: Abstraction has 47782 states and 78034 transitions. [2019-09-10 08:54:49,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 47782 states and 78034 transitions. [2019-09-10 08:54:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:54:49,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:49,961 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:54:49,962 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash 696050988, now seen corresponding path program 1 times [2019-09-10 08:54:49,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:49,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:49,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:49,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:49,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:50,063 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:54:50,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:50,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:50,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:50,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:50,065 INFO L87 Difference]: Start difference. First operand 47782 states and 78034 transitions. Second operand 3 states. [2019-09-10 08:54:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:50,267 INFO L93 Difference]: Finished difference Result 68203 states and 111032 transitions. [2019-09-10 08:54:50,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:50,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:54:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:50,374 INFO L225 Difference]: With dead ends: 68203 [2019-09-10 08:54:50,374 INFO L226 Difference]: Without dead ends: 68203 [2019-09-10 08:54:50,375 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:54:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-09-10 08:54:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 68201. [2019-09-10 08:54:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68201 states. [2019-09-10 08:54:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68201 states to 68201 states and 111031 transitions. [2019-09-10 08:54:51,450 INFO L78 Accepts]: Start accepts. Automaton has 68201 states and 111031 transitions. Word has length 138 [2019-09-10 08:54:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:51,450 INFO L475 AbstractCegarLoop]: Abstraction has 68201 states and 111031 transitions. [2019-09-10 08:54:51,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 68201 states and 111031 transitions. [2019-09-10 08:54:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:54:51,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:51,454 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:54:51,455 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2057723275, now seen corresponding path program 1 times [2019-09-10 08:54:51,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:51,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:51,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:51,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:51,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:51,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:51,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:51,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:51,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:51,562 INFO L87 Difference]: Start difference. First operand 68201 states and 111031 transitions. Second operand 4 states. [2019-09-10 08:54:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:52,346 INFO L93 Difference]: Finished difference Result 133397 states and 217120 transitions. [2019-09-10 08:54:52,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:52,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 08:54:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:52,605 INFO L225 Difference]: With dead ends: 133397 [2019-09-10 08:54:52,605 INFO L226 Difference]: Without dead ends: 133397 [2019-09-10 08:54:52,607 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:54:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133397 states. [2019-09-10 08:54:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133397 to 100647. [2019-09-10 08:54:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100647 states. [2019-09-10 08:54:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100647 states to 100647 states and 163638 transitions. [2019-09-10 08:54:55,719 INFO L78 Accepts]: Start accepts. Automaton has 100647 states and 163638 transitions. Word has length 138 [2019-09-10 08:54:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:55,720 INFO L475 AbstractCegarLoop]: Abstraction has 100647 states and 163638 transitions. [2019-09-10 08:54:55,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 100647 states and 163638 transitions. [2019-09-10 08:54:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:54:55,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:55,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:54:55,724 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1977095112, now seen corresponding path program 1 times [2019-09-10 08:54:55,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:55,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:55,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:55,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:55,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:56,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:56,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:56,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:56,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:56,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:56,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:56,153 INFO L87 Difference]: Start difference. First operand 100647 states and 163638 transitions. Second operand 3 states. [2019-09-10 08:54:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:56,583 INFO L93 Difference]: Finished difference Result 148819 states and 240984 transitions. [2019-09-10 08:54:56,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:56,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:54:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:56,815 INFO L225 Difference]: With dead ends: 148819 [2019-09-10 08:54:56,816 INFO L226 Difference]: Without dead ends: 148819 [2019-09-10 08:54:56,816 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:54:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148819 states. [2019-09-10 08:55:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148819 to 148817. [2019-09-10 08:55:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148817 states. [2019-09-10 08:55:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148817 states to 148817 states and 240983 transitions. [2019-09-10 08:55:00,793 INFO L78 Accepts]: Start accepts. Automaton has 148817 states and 240983 transitions. Word has length 138 [2019-09-10 08:55:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:00,793 INFO L475 AbstractCegarLoop]: Abstraction has 148817 states and 240983 transitions. [2019-09-10 08:55:00,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 148817 states and 240983 transitions. [2019-09-10 08:55:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:55:00,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:00,795 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:55:00,796 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash -475052957, now seen corresponding path program 1 times [2019-09-10 08:55:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:00,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:00,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:00,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:00,897 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:55:00,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:00,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:00,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:00,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:00,899 INFO L87 Difference]: Start difference. First operand 148817 states and 240983 transitions. Second operand 3 states. [2019-09-10 08:55:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:01,420 INFO L93 Difference]: Finished difference Result 216937 states and 350276 transitions. [2019-09-10 08:55:01,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:01,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 08:55:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:01,692 INFO L225 Difference]: With dead ends: 216937 [2019-09-10 08:55:01,693 INFO L226 Difference]: Without dead ends: 216937 [2019-09-10 08:55:01,693 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:55:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216937 states. [2019-09-10 08:55:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216937 to 216935. [2019-09-10 08:55:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216935 states. [2019-09-10 08:55:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216935 states to 216935 states and 350275 transitions. [2019-09-10 08:55:06,747 INFO L78 Accepts]: Start accepts. Automaton has 216935 states and 350275 transitions. Word has length 138 [2019-09-10 08:55:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:06,747 INFO L475 AbstractCegarLoop]: Abstraction has 216935 states and 350275 transitions. [2019-09-10 08:55:06,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 216935 states and 350275 transitions. [2019-09-10 08:55:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:55:06,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:06,749 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:55:06,749 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash 297482555, now seen corresponding path program 1 times [2019-09-10 08:55:06,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:06,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:06,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:07,054 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:55:07,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:07,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:55:07,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:07,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:55:07,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:55:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:55:07,056 INFO L87 Difference]: Start difference. First operand 216935 states and 350275 transitions. Second operand 6 states. [2019-09-10 08:55:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:07,913 INFO L93 Difference]: Finished difference Result 313197 states and 505899 transitions. [2019-09-10 08:55:07,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:55:07,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 08:55:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:12,607 INFO L225 Difference]: With dead ends: 313197 [2019-09-10 08:55:12,607 INFO L226 Difference]: Without dead ends: 313197 [2019-09-10 08:55:12,608 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:55:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313197 states. [2019-09-10 08:55:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313197 to 247495. [2019-09-10 08:55:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247495 states. [2019-09-10 08:55:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247495 states to 247495 states and 398885 transitions. [2019-09-10 08:55:15,740 INFO L78 Accepts]: Start accepts. Automaton has 247495 states and 398885 transitions. Word has length 140 [2019-09-10 08:55:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:15,741 INFO L475 AbstractCegarLoop]: Abstraction has 247495 states and 398885 transitions. [2019-09-10 08:55:15,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:55:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 247495 states and 398885 transitions. [2019-09-10 08:55:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:55:15,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:15,742 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:55:15,743 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash -264023695, now seen corresponding path program 1 times [2019-09-10 08:55:15,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:15,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:15,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:15,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:15,982 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:55:15,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:15,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:55:15,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:15,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:55:15,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:55:15,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:55:15,984 INFO L87 Difference]: Start difference. First operand 247495 states and 398885 transitions. Second operand 6 states. [2019-09-10 08:55:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:17,165 INFO L93 Difference]: Finished difference Result 480781 states and 775685 transitions. [2019-09-10 08:55:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:55:17,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 08:55:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:22,908 INFO L225 Difference]: With dead ends: 480781 [2019-09-10 08:55:22,908 INFO L226 Difference]: Without dead ends: 480781 [2019-09-10 08:55:22,909 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:55:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480781 states. [2019-09-10 08:55:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480781 to 440423. [2019-09-10 08:55:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440423 states. [2019-09-10 08:55:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440423 states to 440423 states and 709542 transitions. [2019-09-10 08:55:28,530 INFO L78 Accepts]: Start accepts. Automaton has 440423 states and 709542 transitions. Word has length 143 [2019-09-10 08:55:28,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:28,530 INFO L475 AbstractCegarLoop]: Abstraction has 440423 states and 709542 transitions. [2019-09-10 08:55:28,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:55:28,530 INFO L276 IsEmpty]: Start isEmpty. Operand 440423 states and 709542 transitions. [2019-09-10 08:55:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:55:28,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:28,531 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:55:28,532 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash 403290968, now seen corresponding path program 1 times [2019-09-10 08:55:28,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:28,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:28,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:28,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:28,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:28,726 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:55:28,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:28,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:55:28,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:28,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:55:28,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:55:28,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:55:28,730 INFO L87 Difference]: Start difference. First operand 440423 states and 709542 transitions. Second operand 5 states. [2019-09-10 08:55:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:38,445 INFO L93 Difference]: Finished difference Result 737111 states and 1180397 transitions. [2019-09-10 08:55:38,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:55:38,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:55:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:39,485 INFO L225 Difference]: With dead ends: 737111 [2019-09-10 08:55:39,486 INFO L226 Difference]: Without dead ends: 737111 [2019-09-10 08:55:39,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:55:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737111 states. [2019-09-10 08:55:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737111 to 446335. [2019-09-10 08:55:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446335 states. [2019-09-10 08:55:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446335 states to 446335 states and 715409 transitions. [2019-09-10 08:55:47,048 INFO L78 Accepts]: Start accepts. Automaton has 446335 states and 715409 transitions. Word has length 144 [2019-09-10 08:55:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:47,048 INFO L475 AbstractCegarLoop]: Abstraction has 446335 states and 715409 transitions. [2019-09-10 08:55:47,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:55:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 446335 states and 715409 transitions. [2019-09-10 08:55:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:55:47,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:47,054 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:55:47,055 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1108095999, now seen corresponding path program 1 times [2019-09-10 08:55:47,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:47,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:47,229 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:55:47,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:47,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:55:47,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:47,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:55:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:55:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:55:47,231 INFO L87 Difference]: Start difference. First operand 446335 states and 715409 transitions. Second operand 6 states. [2019-09-10 08:55:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:55,327 INFO L93 Difference]: Finished difference Result 540412 states and 867228 transitions. [2019-09-10 08:55:55,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:55:55,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-10 08:55:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:56,065 INFO L225 Difference]: With dead ends: 540412 [2019-09-10 08:55:56,065 INFO L226 Difference]: Without dead ends: 540412 [2019-09-10 08:55:56,066 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:55:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540412 states. [2019-09-10 08:56:01,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540412 to 498602. [2019-09-10 08:56:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498602 states. [2019-09-10 08:56:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498602 states to 498602 states and 799201 transitions. [2019-09-10 08:56:02,449 INFO L78 Accepts]: Start accepts. Automaton has 498602 states and 799201 transitions. Word has length 180 [2019-09-10 08:56:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:02,450 INFO L475 AbstractCegarLoop]: Abstraction has 498602 states and 799201 transitions. [2019-09-10 08:56:02,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:56:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 498602 states and 799201 transitions. [2019-09-10 08:56:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:56:02,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:02,455 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:56:02,456 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash -959318747, now seen corresponding path program 1 times [2019-09-10 08:56:02,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:02,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:02,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:02,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:02,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 08:56:02,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:02,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:56:02,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:02,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:56:02,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:56:02,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:56:02,647 INFO L87 Difference]: Start difference. First operand 498602 states and 799201 transitions. Second operand 6 states. [2019-09-10 08:56:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:05,650 INFO L93 Difference]: Finished difference Result 651224 states and 1046933 transitions. [2019-09-10 08:56:05,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:56:05,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-10 08:56:05,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:15,558 INFO L225 Difference]: With dead ends: 651224 [2019-09-10 08:56:15,559 INFO L226 Difference]: Without dead ends: 651224 [2019-09-10 08:56:15,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:56:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651224 states. [2019-09-10 08:56:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651224 to 489736. [2019-09-10 08:56:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489736 states. [2019-09-10 08:56:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489736 states to 489736 states and 784841 transitions. [2019-09-10 08:56:21,678 INFO L78 Accepts]: Start accepts. Automaton has 489736 states and 784841 transitions. Word has length 180 [2019-09-10 08:56:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:21,679 INFO L475 AbstractCegarLoop]: Abstraction has 489736 states and 784841 transitions. [2019-09-10 08:56:21,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:56:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 489736 states and 784841 transitions. [2019-09-10 08:56:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:56:21,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:21,683 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:56:21,683 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:21,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:21,683 INFO L82 PathProgramCache]: Analyzing trace with hash 662502449, now seen corresponding path program 1 times [2019-09-10 08:56:21,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:21,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:21,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:21,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:21,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:30,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:56:30,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:56:30,300 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2019-09-10 08:56:30,302 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], [306], [311], [333], [336], [339], [341], [343], [383], [423], [426], [429], [432], [435], [438], [445], [453], [455], [458], [459], [461], [470], [473], [484], [487], [499], [519], [522], [568], [578], [588], [598], [620], [623], [669], [679], [689], [699], [709], [713], [717], [719], [721], [724], [770], [780], [790], [800], [822], [825], [871], [881], [891], [901], [1529], [1530], [1534], [1535], [1536] [2019-09-10 08:56:30,349 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:56:30,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:56:30,524 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:56:30,859 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:56:30,862 INFO L272 AbstractInterpreter]: Visited 155 different actions 265 times. Merged at 52 different actions 105 times. Never widened. Performed 1056 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1056 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:56:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:30,866 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:56:31,825 INFO L227 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 89.58% of their original sizes. [2019-09-10 08:56:31,826 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:56:58,610 INFO L420 sIntCurrentIteration]: We unified 179 AI predicates to 179 [2019-09-10 08:56:58,610 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:56:58,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:56:58,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [101] imperfect sequences [5] total 104 [2019-09-10 08:56:58,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:58,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-10 08:56:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-10 08:56:58,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=8478, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 08:56:58,617 INFO L87 Difference]: Start difference. First operand 489736 states and 784841 transitions. Second operand 101 states.