java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:01:58,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:01:58,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:01:58,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:01:58,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:01:58,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:01:58,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:01:58,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:01:58,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:01:58,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:01:58,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:01:58,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:01:58,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:01:58,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:01:58,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:01:58,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:01:58,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:01:58,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:01:58,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:01:58,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:01:58,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:01:58,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:01:58,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:01:58,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:01:58,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:01:58,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:01:58,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:01:58,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:01:58,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:01:58,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:01:58,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:01:58,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:01:58,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:01:58,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:01:58,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:01:58,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:01:58,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:01:58,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:01:58,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:01:58,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:01:58,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:01:58,261 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-10-03 03:01:58,286 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:01:58,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:01:58,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:01:58,287 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:01:58,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:01:58,289 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:01:58,289 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:01:58,289 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:01:58,290 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:01:58,290 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:01:58,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:01:58,292 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:01:58,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:01:58,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:01:58,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:01:58,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:01:58,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:01:58,294 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:01:58,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:01:58,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:01:58,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:01:58,295 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:01:58,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:01:58,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:01:58,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:01:58,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:01:58,296 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:01:58,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:01:58,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:01:58,297 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:01:58,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:01:58,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:01:58,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:01:58,352 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:01:58,352 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:01:58,353 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:01:58,427 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927e01499/c0dc05e1ed8d4e6fa585911804cc5b8f/FLAGcf44422ec [2019-10-03 03:01:59,165 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:01:59,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:01:59,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927e01499/c0dc05e1ed8d4e6fa585911804cc5b8f/FLAGcf44422ec [2019-10-03 03:01:59,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927e01499/c0dc05e1ed8d4e6fa585911804cc5b8f [2019-10-03 03:01:59,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:01:59,265 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:01:59,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:59,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:01:59,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:01:59,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:59" (1/1) ... [2019-10-03 03:01:59,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56714b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:59, skipping insertion in model container [2019-10-03 03:01:59,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:59" (1/1) ... [2019-10-03 03:01:59,280 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:01:59,428 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:02:00,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:02:00,410 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:02:00,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:02:00,749 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:02:00,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00 WrapperNode [2019-10-03 03:02:00,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:02:00,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:02:00,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:02:00,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:02:00,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (1/1) ... [2019-10-03 03:02:00,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (1/1) ... [2019-10-03 03:02:00,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (1/1) ... [2019-10-03 03:02:00,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (1/1) ... [2019-10-03 03:02:00,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (1/1) ... [2019-10-03 03:02:00,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (1/1) ... [2019-10-03 03:02:00,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (1/1) ... [2019-10-03 03:02:01,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:02:01,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:02:01,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:02:01,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:02:01,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (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-10-03 03:02:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:02:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:02:01,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:02:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:02:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:02:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:02:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-03 03:02:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:02:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:02:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:02:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:02:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-03 03:02:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-03 03:02:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-03 03:02:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:02:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:02:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:02:01,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:02:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:02:04,671 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:02:04,672 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 03:02:04,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:02:04 BoogieIcfgContainer [2019-10-03 03:02:04,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:02:04,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:02:04,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:02:04,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:02:04,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:01:59" (1/3) ... [2019-10-03 03:02:04,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a165176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:02:04, skipping insertion in model container [2019-10-03 03:02:04,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:02:00" (2/3) ... [2019-10-03 03:02:04,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a165176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:02:04, skipping insertion in model container [2019-10-03 03:02:04,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:02:04" (3/3) ... [2019-10-03 03:02:04,689 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:02:04,704 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:02:04,723 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-03 03:02:04,744 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-03 03:02:04,785 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:02:04,785 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:02:04,785 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:02:04,785 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:02:04,785 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:02:04,786 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:02:04,786 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:02:04,786 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:02:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-10-03 03:02:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:02:04,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:04,876 INFO L411 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] [2019-10-03 03:02:04,879 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:04,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:04,885 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-10-03 03:02:04,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:04,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:04,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:04,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:05,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:05,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:05,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:05,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:05,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:05,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:05,519 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-10-03 03:02:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:07,759 INFO L93 Difference]: Finished difference Result 1566 states and 2684 transitions. [2019-10-03 03:02:07,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:07,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-03 03:02:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:07,793 INFO L225 Difference]: With dead ends: 1566 [2019-10-03 03:02:07,793 INFO L226 Difference]: Without dead ends: 1554 [2019-10-03 03:02:07,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:02:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-10-03 03:02:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1548. [2019-10-03 03:02:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-03 03:02:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2090 transitions. [2019-10-03 03:02:07,923 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2090 transitions. Word has length 55 [2019-10-03 03:02:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:07,924 INFO L475 AbstractCegarLoop]: Abstraction has 1548 states and 2090 transitions. [2019-10-03 03:02:07,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2090 transitions. [2019-10-03 03:02:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:07,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:07,931 INFO L411 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] [2019-10-03 03:02:07,931 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-10-03 03:02:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:08,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:08,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:08,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:08,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:08,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:08,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:08,176 INFO L87 Difference]: Start difference. First operand 1548 states and 2090 transitions. Second operand 6 states. [2019-10-03 03:02:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:09,596 INFO L93 Difference]: Finished difference Result 2296 states and 3137 transitions. [2019-10-03 03:02:09,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:09,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-03 03:02:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:09,614 INFO L225 Difference]: With dead ends: 2296 [2019-10-03 03:02:09,614 INFO L226 Difference]: Without dead ends: 2296 [2019-10-03 03:02:09,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-10-03 03:02:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2280. [2019-10-03 03:02:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-10-03 03:02:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3126 transitions. [2019-10-03 03:02:09,696 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3126 transitions. Word has length 56 [2019-10-03 03:02:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:09,697 INFO L475 AbstractCegarLoop]: Abstraction has 2280 states and 3126 transitions. [2019-10-03 03:02:09,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3126 transitions. [2019-10-03 03:02:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:09,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:09,702 INFO L411 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] [2019-10-03 03:02:09,703 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-10-03 03:02:09,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:09,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:09,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:09,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:09,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:09,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:09,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:09,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:09,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:09,863 INFO L87 Difference]: Start difference. First operand 2280 states and 3126 transitions. Second operand 6 states. [2019-10-03 03:02:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:11,414 INFO L93 Difference]: Finished difference Result 4335 states and 5986 transitions. [2019-10-03 03:02:11,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:11,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-03 03:02:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:11,435 INFO L225 Difference]: With dead ends: 4335 [2019-10-03 03:02:11,435 INFO L226 Difference]: Without dead ends: 4335 [2019-10-03 03:02:11,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-10-03 03:02:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4315. [2019-10-03 03:02:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-03 03:02:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5971 transitions. [2019-10-03 03:02:11,530 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5971 transitions. Word has length 56 [2019-10-03 03:02:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:11,530 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5971 transitions. [2019-10-03 03:02:11,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5971 transitions. [2019-10-03 03:02:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:11,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:11,535 INFO L411 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] [2019-10-03 03:02:11,536 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-10-03 03:02:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:11,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:11,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:11,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:11,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:11,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:11,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:11,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:11,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:11,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:11,775 INFO L87 Difference]: Start difference. First operand 4315 states and 5971 transitions. Second operand 9 states. [2019-10-03 03:02:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:15,375 INFO L93 Difference]: Finished difference Result 8355 states and 12144 transitions. [2019-10-03 03:02:15,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:02:15,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-03 03:02:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:15,419 INFO L225 Difference]: With dead ends: 8355 [2019-10-03 03:02:15,419 INFO L226 Difference]: Without dead ends: 8355 [2019-10-03 03:02:15,420 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:02:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2019-10-03 03:02:15,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 4315. [2019-10-03 03:02:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-03 03:02:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5970 transitions. [2019-10-03 03:02:15,619 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5970 transitions. Word has length 57 [2019-10-03 03:02:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:15,620 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5970 transitions. [2019-10-03 03:02:15,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5970 transitions. [2019-10-03 03:02:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:15,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:15,629 INFO L411 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] [2019-10-03 03:02:15,630 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-10-03 03:02:15,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:15,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:15,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:15,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:15,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:15,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:15,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:15,949 INFO L87 Difference]: Start difference. First operand 4315 states and 5970 transitions. Second operand 9 states. [2019-10-03 03:02:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:19,680 INFO L93 Difference]: Finished difference Result 11066 states and 15933 transitions. [2019-10-03 03:02:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:02:19,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-03 03:02:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:19,731 INFO L225 Difference]: With dead ends: 11066 [2019-10-03 03:02:19,731 INFO L226 Difference]: Without dead ends: 11066 [2019-10-03 03:02:19,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:02:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-10-03 03:02:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4315. [2019-10-03 03:02:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-03 03:02:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5969 transitions. [2019-10-03 03:02:19,913 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5969 transitions. Word has length 57 [2019-10-03 03:02:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:19,914 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5969 transitions. [2019-10-03 03:02:19,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5969 transitions. [2019-10-03 03:02:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:19,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:19,918 INFO L411 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] [2019-10-03 03:02:19,918 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-10-03 03:02:19,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:19,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:19,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:20,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:20,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:02:20,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:20,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:02:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:02:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:20,105 INFO L87 Difference]: Start difference. First operand 4315 states and 5969 transitions. Second operand 8 states. [2019-10-03 03:02:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:22,725 INFO L93 Difference]: Finished difference Result 8061 states and 11818 transitions. [2019-10-03 03:02:22,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:02:22,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-03 03:02:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:22,757 INFO L225 Difference]: With dead ends: 8061 [2019-10-03 03:02:22,757 INFO L226 Difference]: Without dead ends: 8061 [2019-10-03 03:02:22,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2019-10-03 03:02:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 4315. [2019-10-03 03:02:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-03 03:02:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5968 transitions. [2019-10-03 03:02:22,861 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5968 transitions. Word has length 57 [2019-10-03 03:02:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:22,863 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5968 transitions. [2019-10-03 03:02:22,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:02:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5968 transitions. [2019-10-03 03:02:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:02:22,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:22,872 INFO L411 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] [2019-10-03 03:02:22,872 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-10-03 03:02:22,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:22,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:22,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:22,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:22,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:22,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:22,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:22,970 INFO L87 Difference]: Start difference. First operand 4315 states and 5968 transitions. Second operand 3 states. [2019-10-03 03:02:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:23,112 INFO L93 Difference]: Finished difference Result 5459 states and 7529 transitions. [2019-10-03 03:02:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:23,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:02:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:23,122 INFO L225 Difference]: With dead ends: 5459 [2019-10-03 03:02:23,123 INFO L226 Difference]: Without dead ends: 5459 [2019-10-03 03:02:23,123 INFO L640 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-10-03 03:02:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5459 states. [2019-10-03 03:02:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5459 to 5453. [2019-10-03 03:02:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-03 03:02:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 7525 transitions. [2019-10-03 03:02:23,228 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 7525 transitions. Word has length 58 [2019-10-03 03:02:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:23,230 INFO L475 AbstractCegarLoop]: Abstraction has 5453 states and 7525 transitions. [2019-10-03 03:02:23,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 7525 transitions. [2019-10-03 03:02:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:02:23,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:23,237 INFO L411 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] [2019-10-03 03:02:23,238 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-10-03 03:02:23,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:23,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:23,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:23,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:23,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:23,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:23,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:23,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:23,371 INFO L87 Difference]: Start difference. First operand 5453 states and 7525 transitions. Second operand 3 states. [2019-10-03 03:02:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:23,485 INFO L93 Difference]: Finished difference Result 6617 states and 9342 transitions. [2019-10-03 03:02:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:23,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:02:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:23,501 INFO L225 Difference]: With dead ends: 6617 [2019-10-03 03:02:23,502 INFO L226 Difference]: Without dead ends: 6617 [2019-10-03 03:02:23,502 INFO L640 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-10-03 03:02:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-10-03 03:02:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6025. [2019-10-03 03:02:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6025 states. [2019-10-03 03:02:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8443 transitions. [2019-10-03 03:02:23,631 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8443 transitions. Word has length 58 [2019-10-03 03:02:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:23,631 INFO L475 AbstractCegarLoop]: Abstraction has 6025 states and 8443 transitions. [2019-10-03 03:02:23,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8443 transitions. [2019-10-03 03:02:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:02:23,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:23,636 INFO L411 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] [2019-10-03 03:02:23,636 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:23,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:23,637 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-10-03 03:02:23,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:23,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:23,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:23,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:23,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:23,713 INFO L87 Difference]: Start difference. First operand 6025 states and 8443 transitions. Second operand 3 states. [2019-10-03 03:02:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:23,803 INFO L93 Difference]: Finished difference Result 8007 states and 11370 transitions. [2019-10-03 03:02:23,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:23,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:02:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:23,816 INFO L225 Difference]: With dead ends: 8007 [2019-10-03 03:02:23,816 INFO L226 Difference]: Without dead ends: 8007 [2019-10-03 03:02:23,816 INFO L640 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-10-03 03:02:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8007 states. [2019-10-03 03:02:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8007 to 7105. [2019-10-03 03:02:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-10-03 03:02:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 10025 transitions. [2019-10-03 03:02:23,914 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 10025 transitions. Word has length 58 [2019-10-03 03:02:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:23,915 INFO L475 AbstractCegarLoop]: Abstraction has 7105 states and 10025 transitions. [2019-10-03 03:02:23,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 10025 transitions. [2019-10-03 03:02:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:23,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:23,919 INFO L411 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] [2019-10-03 03:02:23,920 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-10-03 03:02:23,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:23,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:23,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:23,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:23,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:23,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:23,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:23,979 INFO L87 Difference]: Start difference. First operand 7105 states and 10025 transitions. Second operand 3 states. [2019-10-03 03:02:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:24,266 INFO L93 Difference]: Finished difference Result 7194 states and 10208 transitions. [2019-10-03 03:02:24,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:24,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:02:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:24,285 INFO L225 Difference]: With dead ends: 7194 [2019-10-03 03:02:24,285 INFO L226 Difference]: Without dead ends: 7194 [2019-10-03 03:02:24,286 INFO L640 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-10-03 03:02:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-10-03 03:02:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 5653. [2019-10-03 03:02:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-10-03 03:02:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 8055 transitions. [2019-10-03 03:02:24,388 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 8055 transitions. Word has length 59 [2019-10-03 03:02:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:24,389 INFO L475 AbstractCegarLoop]: Abstraction has 5653 states and 8055 transitions. [2019-10-03 03:02:24,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 8055 transitions. [2019-10-03 03:02:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:24,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:24,393 INFO L411 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] [2019-10-03 03:02:24,393 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:24,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-10-03 03:02:24,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:24,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:24,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:24,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:24,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:24,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:24,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:24,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:24,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:24,493 INFO L87 Difference]: Start difference. First operand 5653 states and 8055 transitions. Second operand 3 states. [2019-10-03 03:02:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:24,627 INFO L93 Difference]: Finished difference Result 8449 states and 12356 transitions. [2019-10-03 03:02:24,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:24,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:02:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:24,647 INFO L225 Difference]: With dead ends: 8449 [2019-10-03 03:02:24,648 INFO L226 Difference]: Without dead ends: 8449 [2019-10-03 03:02:24,650 INFO L640 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-10-03 03:02:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-10-03 03:02:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 6679. [2019-10-03 03:02:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6679 states. [2019-10-03 03:02:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 9719 transitions. [2019-10-03 03:02:24,766 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 9719 transitions. Word has length 59 [2019-10-03 03:02:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:24,767 INFO L475 AbstractCegarLoop]: Abstraction has 6679 states and 9719 transitions. [2019-10-03 03:02:24,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 9719 transitions. [2019-10-03 03:02:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:24,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:24,770 INFO L411 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] [2019-10-03 03:02:24,771 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:24,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:24,771 INFO L82 PathProgramCache]: Analyzing trace with hash 926744535, now seen corresponding path program 1 times [2019-10-03 03:02:24,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:24,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:24,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:24,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:24,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:24,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:24,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:24,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:24,862 INFO L87 Difference]: Start difference. First operand 6679 states and 9719 transitions. Second operand 3 states. [2019-10-03 03:02:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:25,028 INFO L93 Difference]: Finished difference Result 10816 states and 15983 transitions. [2019-10-03 03:02:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:25,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:02:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:25,054 INFO L225 Difference]: With dead ends: 10816 [2019-10-03 03:02:25,055 INFO L226 Difference]: Without dead ends: 10816 [2019-10-03 03:02:25,059 INFO L640 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-10-03 03:02:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2019-10-03 03:02:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 8416. [2019-10-03 03:02:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-10-03 03:02:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 12405 transitions. [2019-10-03 03:02:25,274 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 12405 transitions. Word has length 59 [2019-10-03 03:02:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:25,275 INFO L475 AbstractCegarLoop]: Abstraction has 8416 states and 12405 transitions. [2019-10-03 03:02:25,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 12405 transitions. [2019-10-03 03:02:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:25,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:25,290 INFO L411 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] [2019-10-03 03:02:25,291 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1408819210, now seen corresponding path program 1 times [2019-10-03 03:02:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:25,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:25,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:25,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:25,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:26,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:26,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:02:26,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:26,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:02:26,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:02:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:26,026 INFO L87 Difference]: Start difference. First operand 8416 states and 12405 transitions. Second operand 19 states. [2019-10-03 03:02:26,209 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-10-03 03:02:27,080 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-03 03:02:27,338 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:02:27,599 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:02:27,788 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:02:32,393 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-10-03 03:02:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:33,465 INFO L93 Difference]: Finished difference Result 29889 states and 44685 transitions. [2019-10-03 03:02:33,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:02:33,466 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-03 03:02:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:33,511 INFO L225 Difference]: With dead ends: 29889 [2019-10-03 03:02:33,511 INFO L226 Difference]: Without dead ends: 29889 [2019-10-03 03:02:33,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:02:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29889 states. [2019-10-03 03:02:33,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29889 to 8428. [2019-10-03 03:02:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8428 states. [2019-10-03 03:02:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 12422 transitions. [2019-10-03 03:02:33,819 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 12422 transitions. Word has length 60 [2019-10-03 03:02:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:33,819 INFO L475 AbstractCegarLoop]: Abstraction has 8428 states and 12422 transitions. [2019-10-03 03:02:33,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:02:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 12422 transitions. [2019-10-03 03:02:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:33,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:33,823 INFO L411 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] [2019-10-03 03:02:33,823 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1965728590, now seen corresponding path program 1 times [2019-10-03 03:02:33,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:33,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:33,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:33,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:33,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:34,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:34,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 03:02:34,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:34,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:02:34,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:02:34,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:34,416 INFO L87 Difference]: Start difference. First operand 8428 states and 12422 transitions. Second operand 18 states. [2019-10-03 03:02:34,696 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-10-03 03:02:34,953 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-10-03 03:02:35,665 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-03 03:02:36,377 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-10-03 03:02:36,583 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-03 03:02:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:42,422 INFO L93 Difference]: Finished difference Result 29928 states and 44743 transitions. [2019-10-03 03:02:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 03:02:42,423 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-10-03 03:02:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:42,463 INFO L225 Difference]: With dead ends: 29928 [2019-10-03 03:02:42,464 INFO L226 Difference]: Without dead ends: 29928 [2019-10-03 03:02:42,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 03:02:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29928 states. [2019-10-03 03:02:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29928 to 8428. [2019-10-03 03:02:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8428 states. [2019-10-03 03:02:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 12421 transitions. [2019-10-03 03:02:42,725 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 12421 transitions. Word has length 60 [2019-10-03 03:02:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:42,725 INFO L475 AbstractCegarLoop]: Abstraction has 8428 states and 12421 transitions. [2019-10-03 03:02:42,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:02:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 12421 transitions. [2019-10-03 03:02:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:42,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:42,728 INFO L411 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] [2019-10-03 03:02:42,728 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1464680332, now seen corresponding path program 1 times [2019-10-03 03:02:42,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:42,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:42,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:42,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:42,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:43,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:43,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:02:43,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:43,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:02:43,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:02:43,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:43,319 INFO L87 Difference]: Start difference. First operand 8428 states and 12421 transitions. Second operand 19 states. [2019-10-03 03:02:43,580 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:02:44,378 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-03 03:02:44,603 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-03 03:02:44,902 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-03 03:02:45,087 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-03 03:02:45,359 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-03 03:02:45,550 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-03 03:02:46,567 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-10-03 03:02:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:50,286 INFO L93 Difference]: Finished difference Result 22179 states and 33113 transitions. [2019-10-03 03:02:50,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:02:50,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-03 03:02:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:50,312 INFO L225 Difference]: With dead ends: 22179 [2019-10-03 03:02:50,312 INFO L226 Difference]: Without dead ends: 22179 [2019-10-03 03:02:50,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 03:02:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22179 states. [2019-10-03 03:02:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22179 to 8428. [2019-10-03 03:02:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8428 states. [2019-10-03 03:02:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 12420 transitions. [2019-10-03 03:02:50,518 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 12420 transitions. Word has length 60 [2019-10-03 03:02:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:50,518 INFO L475 AbstractCegarLoop]: Abstraction has 8428 states and 12420 transitions. [2019-10-03 03:02:50,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:02:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 12420 transitions. [2019-10-03 03:02:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:50,520 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:50,520 INFO L411 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] [2019-10-03 03:02:50,521 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:50,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1506240748, now seen corresponding path program 1 times [2019-10-03 03:02:50,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:50,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:50,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:50,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:50,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 03:02:50,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:50,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:02:50,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:02:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:02:50,882 INFO L87 Difference]: Start difference. First operand 8428 states and 12420 transitions. Second operand 11 states. [2019-10-03 03:02:51,458 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-03 03:02:51,732 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-03 03:02:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:54,278 INFO L93 Difference]: Finished difference Result 32028 states and 47571 transitions. [2019-10-03 03:02:54,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:02:54,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-03 03:02:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:54,310 INFO L225 Difference]: With dead ends: 32028 [2019-10-03 03:02:54,311 INFO L226 Difference]: Without dead ends: 32028 [2019-10-03 03:02:54,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:02:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32028 states. [2019-10-03 03:02:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32028 to 8317. [2019-10-03 03:02:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2019-10-03 03:02:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 12278 transitions. [2019-10-03 03:02:54,535 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 12278 transitions. Word has length 60 [2019-10-03 03:02:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:54,535 INFO L475 AbstractCegarLoop]: Abstraction has 8317 states and 12278 transitions. [2019-10-03 03:02:54,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:02:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 12278 transitions. [2019-10-03 03:02:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:02:54,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:54,537 INFO L411 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] [2019-10-03 03:02:54,538 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 818671798, now seen corresponding path program 1 times [2019-10-03 03:02:54,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:54,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:54,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:54,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:54,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:55,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:55,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 03:02:55,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:55,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:02:55,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:02:55,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:02:55,090 INFO L87 Difference]: Start difference. First operand 8317 states and 12278 transitions. Second operand 13 states. [2019-10-03 03:02:55,743 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-03 03:02:55,889 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-10-03 03:02:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:57,076 INFO L93 Difference]: Finished difference Result 13510 states and 19839 transitions. [2019-10-03 03:02:57,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 03:02:57,076 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-10-03 03:02:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:57,088 INFO L225 Difference]: With dead ends: 13510 [2019-10-03 03:02:57,089 INFO L226 Difference]: Without dead ends: 13510 [2019-10-03 03:02:57,089 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-10-03 03:02:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13510 states. [2019-10-03 03:02:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13510 to 8308. [2019-10-03 03:02:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8308 states. [2019-10-03 03:02:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8308 states to 8308 states and 12266 transitions. [2019-10-03 03:02:57,287 INFO L78 Accepts]: Start accepts. Automaton has 8308 states and 12266 transitions. Word has length 61 [2019-10-03 03:02:57,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:57,287 INFO L475 AbstractCegarLoop]: Abstraction has 8308 states and 12266 transitions. [2019-10-03 03:02:57,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:02:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8308 states and 12266 transitions. [2019-10-03 03:02:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:02:57,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:57,297 INFO L411 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] [2019-10-03 03:02:57,298 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 624248826, now seen corresponding path program 1 times [2019-10-03 03:02:57,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:57,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:57,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:57,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:57,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:57,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:57,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:57,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:57,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:57,398 INFO L87 Difference]: Start difference. First operand 8308 states and 12266 transitions. Second operand 6 states. [2019-10-03 03:02:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:57,616 INFO L93 Difference]: Finished difference Result 29251 states and 42255 transitions. [2019-10-03 03:02:57,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:02:57,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-03 03:02:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:57,644 INFO L225 Difference]: With dead ends: 29251 [2019-10-03 03:02:57,645 INFO L226 Difference]: Without dead ends: 29251 [2019-10-03 03:02:57,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:02:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29251 states. [2019-10-03 03:02:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29251 to 25663. [2019-10-03 03:02:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25663 states. [2019-10-03 03:02:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25663 states to 25663 states and 37128 transitions. [2019-10-03 03:02:57,928 INFO L78 Accepts]: Start accepts. Automaton has 25663 states and 37128 transitions. Word has length 67 [2019-10-03 03:02:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:57,928 INFO L475 AbstractCegarLoop]: Abstraction has 25663 states and 37128 transitions. [2019-10-03 03:02:57,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 25663 states and 37128 transitions. [2019-10-03 03:02:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:02:57,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:57,932 INFO L411 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] [2019-10-03 03:02:57,932 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1849830759, now seen corresponding path program 1 times [2019-10-03 03:02:57,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:57,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:57,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:57,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:57,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:58,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:58,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:58,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:58,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:58,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:58,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:58,038 INFO L87 Difference]: Start difference. First operand 25663 states and 37128 transitions. Second operand 5 states. [2019-10-03 03:02:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:58,263 INFO L93 Difference]: Finished difference Result 22028 states and 31459 transitions. [2019-10-03 03:02:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:58,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-03 03:02:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:58,289 INFO L225 Difference]: With dead ends: 22028 [2019-10-03 03:02:58,289 INFO L226 Difference]: Without dead ends: 22028 [2019-10-03 03:02:58,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22028 states. [2019-10-03 03:02:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22028 to 19439. [2019-10-03 03:02:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19439 states. [2019-10-03 03:02:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19439 states to 19439 states and 27788 transitions. [2019-10-03 03:02:58,534 INFO L78 Accepts]: Start accepts. Automaton has 19439 states and 27788 transitions. Word has length 68 [2019-10-03 03:02:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:58,534 INFO L475 AbstractCegarLoop]: Abstraction has 19439 states and 27788 transitions. [2019-10-03 03:02:58,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 19439 states and 27788 transitions. [2019-10-03 03:02:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 03:02:58,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:58,537 INFO L411 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] [2019-10-03 03:02:58,537 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1871092716, now seen corresponding path program 1 times [2019-10-03 03:02:58,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:58,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:58,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:58,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:58,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:58,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:58,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:58,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:58,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:58,627 INFO L87 Difference]: Start difference. First operand 19439 states and 27788 transitions. Second operand 6 states. [2019-10-03 03:02:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:58,786 INFO L93 Difference]: Finished difference Result 33739 states and 47234 transitions. [2019-10-03 03:02:58,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:58,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-03 03:02:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:58,825 INFO L225 Difference]: With dead ends: 33739 [2019-10-03 03:02:58,825 INFO L226 Difference]: Without dead ends: 33739 [2019-10-03 03:02:58,825 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33739 states. [2019-10-03 03:02:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33739 to 20081. [2019-10-03 03:02:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20081 states. [2019-10-03 03:02:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20081 states to 20081 states and 28281 transitions. [2019-10-03 03:02:59,212 INFO L78 Accepts]: Start accepts. Automaton has 20081 states and 28281 transitions. Word has length 70 [2019-10-03 03:02:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:59,212 INFO L475 AbstractCegarLoop]: Abstraction has 20081 states and 28281 transitions. [2019-10-03 03:02:59,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 20081 states and 28281 transitions. [2019-10-03 03:02:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 03:02:59,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:59,216 INFO L411 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] [2019-10-03 03:02:59,217 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2055411099, now seen corresponding path program 1 times [2019-10-03 03:02:59,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:59,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:59,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:59,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:59,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:59,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:59,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:59,289 INFO L87 Difference]: Start difference. First operand 20081 states and 28281 transitions. Second operand 3 states. [2019-10-03 03:02:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:59,417 INFO L93 Difference]: Finished difference Result 35079 states and 48614 transitions. [2019-10-03 03:02:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:59,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-03 03:02:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:59,452 INFO L225 Difference]: With dead ends: 35079 [2019-10-03 03:02:59,452 INFO L226 Difference]: Without dead ends: 35079 [2019-10-03 03:02:59,453 INFO L640 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-10-03 03:02:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35079 states. [2019-10-03 03:02:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35079 to 34613. [2019-10-03 03:02:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34613 states. [2019-10-03 03:02:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34613 states to 34613 states and 48149 transitions. [2019-10-03 03:02:59,750 INFO L78 Accepts]: Start accepts. Automaton has 34613 states and 48149 transitions. Word has length 71 [2019-10-03 03:02:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:59,751 INFO L475 AbstractCegarLoop]: Abstraction has 34613 states and 48149 transitions. [2019-10-03 03:02:59,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 34613 states and 48149 transitions. [2019-10-03 03:02:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 03:02:59,755 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:59,755 INFO L411 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] [2019-10-03 03:02:59,756 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:59,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:59,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1175358734, now seen corresponding path program 1 times [2019-10-03 03:02:59,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:59,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:59,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:59,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:59,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:59,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:59,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:59,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:59,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:59,823 INFO L87 Difference]: Start difference. First operand 34613 states and 48149 transitions. Second operand 3 states. [2019-10-03 03:02:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:59,962 INFO L93 Difference]: Finished difference Result 34598 states and 47758 transitions. [2019-10-03 03:02:59,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:59,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-03 03:02:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:00,010 INFO L225 Difference]: With dead ends: 34598 [2019-10-03 03:03:00,010 INFO L226 Difference]: Without dead ends: 34598 [2019-10-03 03:03:00,013 INFO L640 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-10-03 03:03:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34598 states. [2019-10-03 03:03:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34598 to 29446. [2019-10-03 03:03:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29446 states. [2019-10-03 03:03:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29446 states to 29446 states and 40768 transitions. [2019-10-03 03:03:00,430 INFO L78 Accepts]: Start accepts. Automaton has 29446 states and 40768 transitions. Word has length 72 [2019-10-03 03:03:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:00,430 INFO L475 AbstractCegarLoop]: Abstraction has 29446 states and 40768 transitions. [2019-10-03 03:03:00,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29446 states and 40768 transitions. [2019-10-03 03:03:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 03:03:00,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:00,435 INFO L411 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] [2019-10-03 03:03:00,436 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash 353507174, now seen corresponding path program 1 times [2019-10-03 03:03:00,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:00,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:00,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:00,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:00,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:00,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:00,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:00,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:00,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:00,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:00,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:00,510 INFO L87 Difference]: Start difference. First operand 29446 states and 40768 transitions. Second operand 5 states. [2019-10-03 03:03:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:01,870 INFO L93 Difference]: Finished difference Result 92051 states and 124465 transitions. [2019-10-03 03:03:01,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:03:01,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-03 03:03:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:01,965 INFO L225 Difference]: With dead ends: 92051 [2019-10-03 03:03:01,965 INFO L226 Difference]: Without dead ends: 92051 [2019-10-03 03:03:01,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92051 states. [2019-10-03 03:03:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92051 to 47960. [2019-10-03 03:03:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47960 states. [2019-10-03 03:03:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47960 states to 47960 states and 65386 transitions. [2019-10-03 03:03:02,593 INFO L78 Accepts]: Start accepts. Automaton has 47960 states and 65386 transitions. Word has length 74 [2019-10-03 03:03:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:02,593 INFO L475 AbstractCegarLoop]: Abstraction has 47960 states and 65386 transitions. [2019-10-03 03:03:02,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47960 states and 65386 transitions. [2019-10-03 03:03:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 03:03:02,597 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:02,597 INFO L411 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] [2019-10-03 03:03:02,597 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2143339772, now seen corresponding path program 1 times [2019-10-03 03:03:02,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:02,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:02,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:02,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:02,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:02,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:02,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:02,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:02,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:02,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:02,672 INFO L87 Difference]: Start difference. First operand 47960 states and 65386 transitions. Second operand 5 states. [2019-10-03 03:03:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:03,838 INFO L93 Difference]: Finished difference Result 145763 states and 194953 transitions. [2019-10-03 03:03:03,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:03:03,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-03 03:03:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:03,996 INFO L225 Difference]: With dead ends: 145763 [2019-10-03 03:03:03,996 INFO L226 Difference]: Without dead ends: 145763 [2019-10-03 03:03:03,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145763 states. [2019-10-03 03:03:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145763 to 94921. [2019-10-03 03:03:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94921 states. [2019-10-03 03:03:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94921 states to 94921 states and 128897 transitions. [2019-10-03 03:03:05,088 INFO L78 Accepts]: Start accepts. Automaton has 94921 states and 128897 transitions. Word has length 77 [2019-10-03 03:03:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:05,088 INFO L475 AbstractCegarLoop]: Abstraction has 94921 states and 128897 transitions. [2019-10-03 03:03:05,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 94921 states and 128897 transitions. [2019-10-03 03:03:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 03:03:05,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:05,093 INFO L411 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] [2019-10-03 03:03:05,093 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1797768461, now seen corresponding path program 1 times [2019-10-03 03:03:05,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:05,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:05,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:05,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:05,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:05,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:05,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:03:05,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:05,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:03:05,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:03:05,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:03:05,229 INFO L87 Difference]: Start difference. First operand 94921 states and 128897 transitions. Second operand 6 states. [2019-10-03 03:03:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:06,996 INFO L93 Difference]: Finished difference Result 121603 states and 164581 transitions. [2019-10-03 03:03:06,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 03:03:06,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-03 03:03:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:07,129 INFO L225 Difference]: With dead ends: 121603 [2019-10-03 03:03:07,129 INFO L226 Difference]: Without dead ends: 121603 [2019-10-03 03:03:07,130 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121603 states. [2019-10-03 03:03:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121603 to 111125. [2019-10-03 03:03:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111125 states. [2019-10-03 03:03:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111125 states to 111125 states and 150595 transitions. [2019-10-03 03:03:08,809 INFO L78 Accepts]: Start accepts. Automaton has 111125 states and 150595 transitions. Word has length 79 [2019-10-03 03:03:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:08,809 INFO L475 AbstractCegarLoop]: Abstraction has 111125 states and 150595 transitions. [2019-10-03 03:03:08,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:03:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 111125 states and 150595 transitions. [2019-10-03 03:03:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 03:03:08,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:08,814 INFO L411 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] [2019-10-03 03:03:08,814 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:08,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1867381610, now seen corresponding path program 1 times [2019-10-03 03:03:08,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:08,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:08,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:08,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:08,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:08,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:08,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:08,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:08,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:08,887 INFO L87 Difference]: Start difference. First operand 111125 states and 150595 transitions. Second operand 3 states. [2019-10-03 03:03:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:09,423 INFO L93 Difference]: Finished difference Result 200108 states and 265166 transitions. [2019-10-03 03:03:09,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:09,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-03 03:03:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:09,693 INFO L225 Difference]: With dead ends: 200108 [2019-10-03 03:03:09,693 INFO L226 Difference]: Without dead ends: 200108 [2019-10-03 03:03:09,693 INFO L640 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-10-03 03:03:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200108 states. [2019-10-03 03:03:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200108 to 142347. [2019-10-03 03:03:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142347 states. [2019-10-03 03:03:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142347 states to 142347 states and 189634 transitions. [2019-10-03 03:03:14,031 INFO L78 Accepts]: Start accepts. Automaton has 142347 states and 189634 transitions. Word has length 79 [2019-10-03 03:03:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:14,031 INFO L475 AbstractCegarLoop]: Abstraction has 142347 states and 189634 transitions. [2019-10-03 03:03:14,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 142347 states and 189634 transitions. [2019-10-03 03:03:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 03:03:14,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:14,036 INFO L411 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] [2019-10-03 03:03:14,036 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash 186938905, now seen corresponding path program 1 times [2019-10-03 03:03:14,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:14,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:14,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:14,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:14,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:14,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:14,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:14,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:14,105 INFO L87 Difference]: Start difference. First operand 142347 states and 189634 transitions. Second operand 3 states. [2019-10-03 03:03:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:14,504 INFO L93 Difference]: Finished difference Result 179532 states and 233226 transitions. [2019-10-03 03:03:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:14,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-03 03:03:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:14,700 INFO L225 Difference]: With dead ends: 179532 [2019-10-03 03:03:14,700 INFO L226 Difference]: Without dead ends: 179532 [2019-10-03 03:03:14,701 INFO L640 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-10-03 03:03:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179532 states. [2019-10-03 03:03:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179532 to 140517. [2019-10-03 03:03:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140517 states. [2019-10-03 03:03:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140517 states to 140517 states and 183828 transitions. [2019-10-03 03:03:16,854 INFO L78 Accepts]: Start accepts. Automaton has 140517 states and 183828 transitions. Word has length 82 [2019-10-03 03:03:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:16,854 INFO L475 AbstractCegarLoop]: Abstraction has 140517 states and 183828 transitions. [2019-10-03 03:03:16,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 140517 states and 183828 transitions. [2019-10-03 03:03:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 03:03:16,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:16,859 INFO L411 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] [2019-10-03 03:03:16,859 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:16,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash 778717480, now seen corresponding path program 1 times [2019-10-03 03:03:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:16,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:16,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:16,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:16,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:16,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:16,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:16,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:16,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:16,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:16,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:16,919 INFO L87 Difference]: Start difference. First operand 140517 states and 183828 transitions. Second operand 3 states. [2019-10-03 03:03:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:17,298 INFO L93 Difference]: Finished difference Result 164128 states and 210364 transitions. [2019-10-03 03:03:17,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:17,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-03 03:03:17,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:17,467 INFO L225 Difference]: With dead ends: 164128 [2019-10-03 03:03:17,467 INFO L226 Difference]: Without dead ends: 164128 [2019-10-03 03:03:17,468 INFO L640 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-10-03 03:03:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164128 states. [2019-10-03 03:03:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164128 to 155254. [2019-10-03 03:03:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155254 states. [2019-10-03 03:03:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155254 states to 155254 states and 200097 transitions. [2019-10-03 03:03:21,668 INFO L78 Accepts]: Start accepts. Automaton has 155254 states and 200097 transitions. Word has length 85 [2019-10-03 03:03:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:21,668 INFO L475 AbstractCegarLoop]: Abstraction has 155254 states and 200097 transitions. [2019-10-03 03:03:21,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 155254 states and 200097 transitions. [2019-10-03 03:03:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 03:03:21,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:21,677 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:21,677 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:21,678 INFO L82 PathProgramCache]: Analyzing trace with hash 25741144, now seen corresponding path program 1 times [2019-10-03 03:03:21,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:21,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:21,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:03:21,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:21,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:03:21,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:21,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:03:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:03:21,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:21,823 INFO L87 Difference]: Start difference. First operand 155254 states and 200097 transitions. Second operand 9 states. [2019-10-03 03:03:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:24,164 INFO L93 Difference]: Finished difference Result 382949 states and 492495 transitions. [2019-10-03 03:03:24,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 03:03:24,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-03 03:03:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:24,639 INFO L225 Difference]: With dead ends: 382949 [2019-10-03 03:03:24,639 INFO L226 Difference]: Without dead ends: 382949 [2019-10-03 03:03:24,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-10-03 03:03:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382949 states. [2019-10-03 03:03:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382949 to 155239. [2019-10-03 03:03:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155239 states. [2019-10-03 03:03:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155239 states to 155239 states and 200081 transitions. [2019-10-03 03:03:31,821 INFO L78 Accepts]: Start accepts. Automaton has 155239 states and 200081 transitions. Word has length 92 [2019-10-03 03:03:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:31,821 INFO L475 AbstractCegarLoop]: Abstraction has 155239 states and 200081 transitions. [2019-10-03 03:03:31,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:03:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 155239 states and 200081 transitions. [2019-10-03 03:03:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:03:31,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:31,830 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:31,830 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -978519268, now seen corresponding path program 1 times [2019-10-03 03:03:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:31,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:31,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:32,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:32,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:03:32,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:32,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:03:32,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:03:32,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:03:32,054 INFO L87 Difference]: Start difference. First operand 155239 states and 200081 transitions. Second operand 10 states. [2019-10-03 03:03:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:35,611 INFO L93 Difference]: Finished difference Result 523889 states and 670490 transitions. [2019-10-03 03:03:35,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-03 03:03:35,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-10-03 03:03:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:37,319 INFO L225 Difference]: With dead ends: 523889 [2019-10-03 03:03:37,320 INFO L226 Difference]: Without dead ends: 523889 [2019-10-03 03:03:37,320 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 03:03:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523889 states. [2019-10-03 03:03:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523889 to 251201. [2019-10-03 03:03:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251201 states. [2019-10-03 03:03:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251201 states to 251201 states and 323594 transitions. [2019-10-03 03:03:46,065 INFO L78 Accepts]: Start accepts. Automaton has 251201 states and 323594 transitions. Word has length 93 [2019-10-03 03:03:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:46,065 INFO L475 AbstractCegarLoop]: Abstraction has 251201 states and 323594 transitions. [2019-10-03 03:03:46,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:03:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 251201 states and 323594 transitions. [2019-10-03 03:03:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:03:46,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:46,076 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:46,076 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash -287132240, now seen corresponding path program 1 times [2019-10-03 03:03:46,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:46,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:46,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:46,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:46,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:03:46,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:46,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:03:46,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:46,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:03:46,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:03:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:46,222 INFO L87 Difference]: Start difference. First operand 251201 states and 323594 transitions. Second operand 9 states. [2019-10-03 03:03:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:55,086 INFO L93 Difference]: Finished difference Result 792758 states and 1016132 transitions. [2019-10-03 03:03:55,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:03:55,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-10-03 03:03:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:56,203 INFO L225 Difference]: With dead ends: 792758 [2019-10-03 03:03:56,203 INFO L226 Difference]: Without dead ends: 792758 [2019-10-03 03:03:56,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:03:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792758 states. [2019-10-03 03:04:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792758 to 251186. [2019-10-03 03:04:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251186 states. [2019-10-03 03:04:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251186 states to 251186 states and 323578 transitions. [2019-10-03 03:04:02,745 INFO L78 Accepts]: Start accepts. Automaton has 251186 states and 323578 transitions. Word has length 93 [2019-10-03 03:04:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:02,746 INFO L475 AbstractCegarLoop]: Abstraction has 251186 states and 323578 transitions. [2019-10-03 03:04:02,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:04:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 251186 states and 323578 transitions. [2019-10-03 03:04:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:04:02,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:02,753 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:04:02,754 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1974005961, now seen corresponding path program 1 times [2019-10-03 03:04:02,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:02,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:02,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:02,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:02,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:02,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:04:02,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:02,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:04:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:04:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:04:02,920 INFO L87 Difference]: Start difference. First operand 251186 states and 323578 transitions. Second operand 9 states. [2019-10-03 03:04:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:06,265 INFO L93 Difference]: Finished difference Result 737793 states and 948520 transitions. [2019-10-03 03:04:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 03:04:06,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-10-03 03:04:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:08,722 INFO L225 Difference]: With dead ends: 737793 [2019-10-03 03:04:08,723 INFO L226 Difference]: Without dead ends: 737793 [2019-10-03 03:04:08,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:04:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737793 states. [2019-10-03 03:04:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737793 to 252088. [2019-10-03 03:04:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252088 states. [2019-10-03 03:04:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252088 states to 252088 states and 324660 transitions. [2019-10-03 03:04:21,456 INFO L78 Accepts]: Start accepts. Automaton has 252088 states and 324660 transitions. Word has length 93 [2019-10-03 03:04:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:21,456 INFO L475 AbstractCegarLoop]: Abstraction has 252088 states and 324660 transitions. [2019-10-03 03:04:21,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:04:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 252088 states and 324660 transitions. [2019-10-03 03:04:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:04:21,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:21,465 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:04:21,465 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:21,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:21,466 INFO L82 PathProgramCache]: Analyzing trace with hash -440996839, now seen corresponding path program 1 times [2019-10-03 03:04:21,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:21,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:21,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:04:22,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:22,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:04:22,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:22,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:04:22,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:04:22,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:04:22,330 INFO L87 Difference]: Start difference. First operand 252088 states and 324660 transitions. Second operand 8 states. [2019-10-03 03:04:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:24,276 INFO L93 Difference]: Finished difference Result 394561 states and 507557 transitions. [2019-10-03 03:04:24,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:04:24,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-10-03 03:04:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:24,784 INFO L225 Difference]: With dead ends: 394561 [2019-10-03 03:04:24,784 INFO L226 Difference]: Without dead ends: 394561 [2019-10-03 03:04:24,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-10-03 03:04:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394561 states. [2019-10-03 03:04:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394561 to 252076. [2019-10-03 03:04:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252076 states. [2019-10-03 03:04:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252076 states to 252076 states and 324647 transitions. [2019-10-03 03:04:32,642 INFO L78 Accepts]: Start accepts. Automaton has 252076 states and 324647 transitions. Word has length 94 [2019-10-03 03:04:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:32,642 INFO L475 AbstractCegarLoop]: Abstraction has 252076 states and 324647 transitions. [2019-10-03 03:04:32,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:04:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 252076 states and 324647 transitions. [2019-10-03 03:04:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:04:32,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:32,650 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:04:32,651 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:32,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:32,651 INFO L82 PathProgramCache]: Analyzing trace with hash -602915897, now seen corresponding path program 1 times [2019-10-03 03:04:32,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:32,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:32,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:32,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:32,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:32,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:32,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:32,866 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-10-03 03:04:32,868 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [203], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [2589], [2593], [2596], [2599], [2602], [2610], [2612], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3887], [3933], [3936], [3939], [3943], [3946], [3950], [3954], [3956], [3959], [3963], [3966], [3969], [3973], [4241], [4244], [4247], [4251], [4255], [4259], [4342], [4344], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:04:32,918 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:32,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:33,143 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:33,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:33,459 INFO L272 AbstractInterpreter]: Visited 89 different actions 206 times. Merged at 27 different actions 105 times. Widened at 1 different actions 1 times. Performed 1033 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1033 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-10-03 03:04:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:33,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:33,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:33,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:04:33,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:33,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:33,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:04:33,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:33,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:33,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:34,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:35,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:04:35,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:04:35,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-10-03 03:04:35,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:04:35,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:04:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:04:35,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-10-03 03:04:35,546 INFO L87 Difference]: Start difference. First operand 252076 states and 324647 transitions. Second operand 18 states. [2019-10-03 03:04:35,819 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-03 03:04:35,964 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:04:36,099 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:04:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:44,336 INFO L93 Difference]: Finished difference Result 626738 states and 801085 transitions. [2019-10-03 03:04:44,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:04:44,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2019-10-03 03:04:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:45,375 INFO L225 Difference]: With dead ends: 626738 [2019-10-03 03:04:45,375 INFO L226 Difference]: Without dead ends: 626738 [2019-10-03 03:04:45,376 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 168 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=382, Invalid=1424, Unknown=0, NotChecked=0, Total=1806 [2019-10-03 03:04:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626738 states. [2019-10-03 03:04:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626738 to 252655. [2019-10-03 03:04:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252655 states. [2019-10-03 03:05:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252655 states to 252655 states and 325352 transitions. [2019-10-03 03:05:00,616 INFO L78 Accepts]: Start accepts. Automaton has 252655 states and 325352 transitions. Word has length 94 [2019-10-03 03:05:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:00,616 INFO L475 AbstractCegarLoop]: Abstraction has 252655 states and 325352 transitions. [2019-10-03 03:05:00,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:05:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 252655 states and 325352 transitions. [2019-10-03 03:05:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:05:00,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:00,625 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:05:00,626 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1717699109, now seen corresponding path program 1 times [2019-10-03 03:05:00,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:00,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:00,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:00,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:00,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:05:00,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-10-03 03:05:00,771 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [166], [169], [170], [172], [175], [180], [182], [203], [205], [1028], [1272], [1276], [1387], [1460], [1463], [1466], [1470], [1473], [1477], [1481], [1483], [1486], [1489], [1493], [2148], [2151], [2154], [2170], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [3479], [3482], [3486], [3488], [3491], [3494], [3498], [3502], [3505], [3508], [3511], [3513], [3542], [3561], [3563], [3582], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:05:00,777 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:05:00,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:05:00,857 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:05:01,152 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:05:01,152 INFO L272 AbstractInterpreter]: Visited 89 different actions 225 times. Merged at 28 different actions 124 times. Widened at 5 different actions 5 times. Performed 1104 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-10-03 03:05:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:01,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:05:01,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:01,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:05:01,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:01,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:05:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:01,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-03 03:05:01,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:05:01,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:05:02,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:05:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:05:02,480 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:05:02,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [5] total 21 [2019-10-03 03:05:02,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:02,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:05:02,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:05:02,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:05:02,484 INFO L87 Difference]: Start difference. First operand 252655 states and 325352 transitions. Second operand 10 states. [2019-10-03 03:05:03,508 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:05:04,171 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-03 03:05:04,782 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:05:05,336 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-10-03 03:05:05,560 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:05:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:09,749 INFO L93 Difference]: Finished difference Result 541975 states and 690531 transitions. [2019-10-03 03:05:09,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 03:05:09,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-03 03:05:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:10,569 INFO L225 Difference]: With dead ends: 541975 [2019-10-03 03:05:10,569 INFO L226 Difference]: Without dead ends: 541975 [2019-10-03 03:05:10,569 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 167 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:05:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541975 states. [2019-10-03 03:05:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541975 to 285118. [2019-10-03 03:05:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285118 states. [2019-10-03 03:05:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285118 states to 285118 states and 365875 transitions. [2019-10-03 03:05:19,564 INFO L78 Accepts]: Start accepts. Automaton has 285118 states and 365875 transitions. Word has length 94 [2019-10-03 03:05:19,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:19,565 INFO L475 AbstractCegarLoop]: Abstraction has 285118 states and 365875 transitions. [2019-10-03 03:05:19,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:05:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 285118 states and 365875 transitions. [2019-10-03 03:05:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:05:19,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:19,576 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:05:19,576 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:19,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash 982202329, now seen corresponding path program 1 times [2019-10-03 03:05:19,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:19,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:19,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:19,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:19,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:05:19,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:19,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:05:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:05:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:05:19,860 INFO L87 Difference]: Start difference. First operand 285118 states and 365875 transitions. Second operand 12 states. [2019-10-03 03:05:24,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:24,568 INFO L93 Difference]: Finished difference Result 608211 states and 778404 transitions. [2019-10-03 03:05:24,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 03:05:24,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-10-03 03:05:24,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:25,330 INFO L225 Difference]: With dead ends: 608211 [2019-10-03 03:05:25,330 INFO L226 Difference]: Without dead ends: 608211 [2019-10-03 03:05:25,330 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 03:05:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608211 states. [2019-10-03 03:05:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608211 to 292508. [2019-10-03 03:05:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292508 states. [2019-10-03 03:05:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292508 states to 292508 states and 375381 transitions. [2019-10-03 03:05:37,203 INFO L78 Accepts]: Start accepts. Automaton has 292508 states and 375381 transitions. Word has length 95 [2019-10-03 03:05:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:37,204 INFO L475 AbstractCegarLoop]: Abstraction has 292508 states and 375381 transitions. [2019-10-03 03:05:37,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:05:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 292508 states and 375381 transitions. [2019-10-03 03:05:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:05:37,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:37,215 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:05:37,215 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:37,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2084722691, now seen corresponding path program 1 times [2019-10-03 03:05:37,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:37,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:37,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:37,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:37,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:37,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:37,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:05:37,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-10-03 03:05:37,322 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [185], [201], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2227], [2230], [2233], [2241], [2243], [3274], [3278], [3282], [3301], [3303], [3708], [3722], [3724], [3728], [4353], [4613], [4617], [4620], [4623], [4626], [4629], [4632], [4636], [4639], [4643], [4646], [4650], [4682], [4685], [4689], [4692], [4696], [4698], [4701], [4704], [4708], [4712], [4716], [4799], [4801], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:05:37,325 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:05:37,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:05:37,389 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:05:37,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:05:37,606 INFO L272 AbstractInterpreter]: Visited 90 different actions 215 times. Merged at 30 different actions 114 times. Widened at 5 different actions 8 times. Performed 1078 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1078 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 7 different actions. Largest state had 253 variables. [2019-10-03 03:05:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:37,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:05:37,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:37,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:05:38,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:38,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:05:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:38,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 03:05:38,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:05:38,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:05:39,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:05:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:05:39,451 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:05:39,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [5] total 19 [2019-10-03 03:05:39,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:39,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:05:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:05:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:05:39,452 INFO L87 Difference]: Start difference. First operand 292508 states and 375381 transitions. Second operand 9 states. [2019-10-03 03:05:40,122 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-03 03:05:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:41,861 INFO L93 Difference]: Finished difference Result 374833 states and 479245 transitions. [2019-10-03 03:05:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:05:41,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-10-03 03:05:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:42,330 INFO L225 Difference]: With dead ends: 374833 [2019-10-03 03:05:42,330 INFO L226 Difference]: Without dead ends: 374833 [2019-10-03 03:05:42,330 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 173 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:05:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374833 states. [2019-10-03 03:05:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374833 to 292498. [2019-10-03 03:05:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292498 states. [2019-10-03 03:05:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292498 states to 292498 states and 375152 transitions. [2019-10-03 03:05:49,879 INFO L78 Accepts]: Start accepts. Automaton has 292498 states and 375152 transitions. Word has length 95 [2019-10-03 03:05:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:49,880 INFO L475 AbstractCegarLoop]: Abstraction has 292498 states and 375152 transitions. [2019-10-03 03:05:49,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:05:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 292498 states and 375152 transitions. [2019-10-03 03:05:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:05:49,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:49,889 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:05:49,889 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:49,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:49,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1487914464, now seen corresponding path program 1 times [2019-10-03 03:05:49,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:49,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:49,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:49,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:49,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:49,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:49,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:05:49,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:49,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:05:49,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:05:49,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:05:49,955 INFO L87 Difference]: Start difference. First operand 292498 states and 375152 transitions. Second operand 3 states. [2019-10-03 03:05:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:51,497 INFO L93 Difference]: Finished difference Result 292500 states and 368377 transitions. [2019-10-03 03:05:51,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:05:51,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-10-03 03:05:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:51,839 INFO L225 Difference]: With dead ends: 292500 [2019-10-03 03:05:51,839 INFO L226 Difference]: Without dead ends: 292500 [2019-10-03 03:05:51,839 INFO L640 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-10-03 03:05:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292500 states. [2019-10-03 03:05:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292500 to 292395. [2019-10-03 03:05:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292395 states. [2019-10-03 03:05:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292395 states to 292395 states and 368261 transitions. [2019-10-03 03:05:56,660 INFO L78 Accepts]: Start accepts. Automaton has 292395 states and 368261 transitions. Word has length 95 [2019-10-03 03:05:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:56,661 INFO L475 AbstractCegarLoop]: Abstraction has 292395 states and 368261 transitions. [2019-10-03 03:05:56,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:05:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 292395 states and 368261 transitions. [2019-10-03 03:05:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:05:56,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:56,668 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:05:56,668 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:56,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:56,669 INFO L82 PathProgramCache]: Analyzing trace with hash -286705209, now seen corresponding path program 1 times [2019-10-03 03:05:56,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:56,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:56,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:56,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:56,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:05:56,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-10-03 03:05:56,785 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [203], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2182], [2198], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [2589], [2593], [2596], [2599], [2602], [2610], [2612], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3887], [3933], [3936], [3939], [3943], [3946], [3950], [3954], [3956], [3959], [3963], [3966], [3969], [3973], [4241], [4244], [4247], [4251], [4255], [4259], [4342], [4344], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:05:56,788 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:05:56,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:05:56,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:05:56,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:05:56,979 INFO L272 AbstractInterpreter]: Visited 90 different actions 213 times. Merged at 28 different actions 112 times. Widened at 5 different actions 5 times. 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 12 fixpoints after 6 different actions. Largest state had 253 variables. [2019-10-03 03:05:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:56,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:05:56,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:56,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:05:57,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:57,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:06:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:02,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 03:06:02,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:06:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:03,030 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:06:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:06:03,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:06:03,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-10-03 03:06:03,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:06:03,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:06:03,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:06:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:06:03,117 INFO L87 Difference]: Start difference. First operand 292395 states and 368261 transitions. Second operand 6 states. [2019-10-03 03:06:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:04,345 INFO L93 Difference]: Finished difference Result 454929 states and 565880 transitions. [2019-10-03 03:06:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 03:06:04,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 03:06:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:05,033 INFO L225 Difference]: With dead ends: 454929 [2019-10-03 03:06:05,034 INFO L226 Difference]: Without dead ends: 454929 [2019-10-03 03:06:05,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:06:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454929 states. [2019-10-03 03:06:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454929 to 361337. [2019-10-03 03:06:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361337 states. [2019-10-03 03:06:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361337 states to 361337 states and 453676 transitions. [2019-10-03 03:06:11,467 INFO L78 Accepts]: Start accepts. Automaton has 361337 states and 453676 transitions. Word has length 95 [2019-10-03 03:06:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:11,467 INFO L475 AbstractCegarLoop]: Abstraction has 361337 states and 453676 transitions. [2019-10-03 03:06:11,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:06:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 361337 states and 453676 transitions. [2019-10-03 03:06:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:06:11,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:11,476 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:06:11,476 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash -802766303, now seen corresponding path program 1 times [2019-10-03 03:06:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:11,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:11,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:11,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:11,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:06:11,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:11,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:06:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:06:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:06:11,554 INFO L87 Difference]: Start difference. First operand 361337 states and 453676 transitions. Second operand 3 states. [2019-10-03 03:06:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:12,217 INFO L93 Difference]: Finished difference Result 274672 states and 340294 transitions. [2019-10-03 03:06:12,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:06:12,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-03 03:06:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:12,596 INFO L225 Difference]: With dead ends: 274672 [2019-10-03 03:06:12,597 INFO L226 Difference]: Without dead ends: 274672 [2019-10-03 03:06:12,597 INFO L640 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-10-03 03:06:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274672 states. [2019-10-03 03:06:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274672 to 274308. [2019-10-03 03:06:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274308 states. [2019-10-03 03:06:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274308 states to 274308 states and 339911 transitions. [2019-10-03 03:06:20,561 INFO L78 Accepts]: Start accepts. Automaton has 274308 states and 339911 transitions. Word has length 96 [2019-10-03 03:06:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:20,561 INFO L475 AbstractCegarLoop]: Abstraction has 274308 states and 339911 transitions. [2019-10-03 03:06:20,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:06:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 274308 states and 339911 transitions. [2019-10-03 03:06:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:06:20,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:20,567 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:06:20,567 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:20,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1316813398, now seen corresponding path program 1 times [2019-10-03 03:06:20,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:20,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:20,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:20,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:20,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 03:06:20,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:20,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:06:20,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:20,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:06:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:06:20,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:06:20,621 INFO L87 Difference]: Start difference. First operand 274308 states and 339911 transitions. Second operand 4 states. [2019-10-03 03:06:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:22,963 INFO L93 Difference]: Finished difference Result 434879 states and 537144 transitions. [2019-10-03 03:06:22,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:06:22,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-03 03:06:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:23,563 INFO L225 Difference]: With dead ends: 434879 [2019-10-03 03:06:23,564 INFO L226 Difference]: Without dead ends: 434879 [2019-10-03 03:06:23,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:06:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434879 states. [2019-10-03 03:06:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434879 to 308937. [2019-10-03 03:06:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308937 states. [2019-10-03 03:06:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308937 states to 308937 states and 383407 transitions. [2019-10-03 03:06:32,614 INFO L78 Accepts]: Start accepts. Automaton has 308937 states and 383407 transitions. Word has length 97 [2019-10-03 03:06:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:32,614 INFO L475 AbstractCegarLoop]: Abstraction has 308937 states and 383407 transitions. [2019-10-03 03:06:32,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:06:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 308937 states and 383407 transitions. [2019-10-03 03:06:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:06:32,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:32,621 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:06:32,621 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1191866658, now seen corresponding path program 1 times [2019-10-03 03:06:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:32,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:32,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:32,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:32,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 03:06:32,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:32,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:06:32,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:32,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:06:32,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:06:32,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:06:32,702 INFO L87 Difference]: Start difference. First operand 308937 states and 383407 transitions. Second operand 5 states. [2019-10-03 03:06:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:34,000 INFO L93 Difference]: Finished difference Result 340940 states and 420825 transitions. [2019-10-03 03:06:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:06:34,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-03 03:06:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:34,499 INFO L225 Difference]: With dead ends: 340940 [2019-10-03 03:06:34,500 INFO L226 Difference]: Without dead ends: 340940 [2019-10-03 03:06:34,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:06:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340940 states. [2019-10-03 03:06:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340940 to 295729. [2019-10-03 03:06:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295729 states. [2019-10-03 03:06:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295729 states to 295729 states and 365567 transitions. [2019-10-03 03:06:44,187 INFO L78 Accepts]: Start accepts. Automaton has 295729 states and 365567 transitions. Word has length 97 [2019-10-03 03:06:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:44,187 INFO L475 AbstractCegarLoop]: Abstraction has 295729 states and 365567 transitions. [2019-10-03 03:06:44,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:06:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 295729 states and 365567 transitions. [2019-10-03 03:06:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 03:06:44,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:44,194 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:06:44,194 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash -186718423, now seen corresponding path program 1 times [2019-10-03 03:06:44,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:44,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:44,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:44,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:44,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:44,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:06:44,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:44,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:06:44,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:06:44,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:06:44,271 INFO L87 Difference]: Start difference. First operand 295729 states and 365567 transitions. Second operand 5 states. [2019-10-03 03:06:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:45,390 INFO L93 Difference]: Finished difference Result 297075 states and 362416 transitions. [2019-10-03 03:06:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:06:45,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-03 03:06:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:46,903 INFO L225 Difference]: With dead ends: 297075 [2019-10-03 03:06:46,903 INFO L226 Difference]: Without dead ends: 297075 [2019-10-03 03:06:46,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:06:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297075 states. [2019-10-03 03:06:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297075 to 273870. [2019-10-03 03:06:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273870 states. [2019-10-03 03:06:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273870 states to 273870 states and 333296 transitions. [2019-10-03 03:06:54,075 INFO L78 Accepts]: Start accepts. Automaton has 273870 states and 333296 transitions. Word has length 98 [2019-10-03 03:06:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:54,076 INFO L475 AbstractCegarLoop]: Abstraction has 273870 states and 333296 transitions. [2019-10-03 03:06:54,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:06:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 273870 states and 333296 transitions. [2019-10-03 03:06:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 03:06:54,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:54,082 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:06:54,082 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1378332097, now seen corresponding path program 1 times [2019-10-03 03:06:54,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:54,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:54,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:54,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:54,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:06:54,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:54,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:06:54,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:06:54,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:06:54,165 INFO L87 Difference]: Start difference. First operand 273870 states and 333296 transitions. Second operand 5 states. [2019-10-03 03:06:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:54,981 INFO L93 Difference]: Finished difference Result 327245 states and 397474 transitions. [2019-10-03 03:06:54,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:06:54,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-03 03:06:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:55,358 INFO L225 Difference]: With dead ends: 327245 [2019-10-03 03:06:55,358 INFO L226 Difference]: Without dead ends: 327245 [2019-10-03 03:06:55,358 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:06:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327245 states. [2019-10-03 03:07:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327245 to 297826. [2019-10-03 03:07:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297826 states. [2019-10-03 03:07:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297826 states to 297826 states and 361556 transitions. [2019-10-03 03:07:05,794 INFO L78 Accepts]: Start accepts. Automaton has 297826 states and 361556 transitions. Word has length 98 [2019-10-03 03:07:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:05,795 INFO L475 AbstractCegarLoop]: Abstraction has 297826 states and 361556 transitions. [2019-10-03 03:07:05,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:07:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 297826 states and 361556 transitions. [2019-10-03 03:07:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 03:07:05,803 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:05,803 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:07:05,803 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:05,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1537742470, now seen corresponding path program 1 times [2019-10-03 03:07:05,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:05,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:05,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:05,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:05,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 03:07:05,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:07:05,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:07:05,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:05,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:07:05,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:07:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:07:05,877 INFO L87 Difference]: Start difference. First operand 297826 states and 361556 transitions. Second operand 3 states. [2019-10-03 03:07:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:06,464 INFO L93 Difference]: Finished difference Result 275719 states and 332029 transitions. [2019-10-03 03:07:06,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:07:06,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-03 03:07:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:06,870 INFO L225 Difference]: With dead ends: 275719 [2019-10-03 03:07:06,870 INFO L226 Difference]: Without dead ends: 259097 [2019-10-03 03:07:06,871 INFO L640 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-10-03 03:07:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259097 states. [2019-10-03 03:07:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259097 to 186973. [2019-10-03 03:07:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186973 states. [2019-10-03 03:07:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186973 states to 186973 states and 226300 transitions. [2019-10-03 03:07:10,111 INFO L78 Accepts]: Start accepts. Automaton has 186973 states and 226300 transitions. Word has length 100 [2019-10-03 03:07:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:10,111 INFO L475 AbstractCegarLoop]: Abstraction has 186973 states and 226300 transitions. [2019-10-03 03:07:10,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:07:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 186973 states and 226300 transitions. [2019-10-03 03:07:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 03:07:10,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:10,117 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:07:10,117 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash 887178001, now seen corresponding path program 1 times [2019-10-03 03:07:10,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:10,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:10,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:10,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:10,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:10,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:07:10,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:07:10,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:10,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:07:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:07:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:07:10,175 INFO L87 Difference]: Start difference. First operand 186973 states and 226300 transitions. Second operand 3 states. [2019-10-03 03:07:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:10,766 INFO L93 Difference]: Finished difference Result 280071 states and 337098 transitions. [2019-10-03 03:07:10,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:07:10,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-03 03:07:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:11,178 INFO L225 Difference]: With dead ends: 280071 [2019-10-03 03:07:11,178 INFO L226 Difference]: Without dead ends: 280071 [2019-10-03 03:07:11,178 INFO L640 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-10-03 03:07:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280071 states. [2019-10-03 03:07:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280071 to 178087. [2019-10-03 03:07:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178087 states. [2019-10-03 03:07:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178087 states to 178087 states and 214150 transitions. [2019-10-03 03:07:19,441 INFO L78 Accepts]: Start accepts. Automaton has 178087 states and 214150 transitions. Word has length 101 [2019-10-03 03:07:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:19,441 INFO L475 AbstractCegarLoop]: Abstraction has 178087 states and 214150 transitions. [2019-10-03 03:07:19,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:07:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 178087 states and 214150 transitions. [2019-10-03 03:07:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 03:07:19,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:19,448 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:07:19,448 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1476573405, now seen corresponding path program 1 times [2019-10-03 03:07:19,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:19,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:19,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:19,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:07:19,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:07:19,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:07:19,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:19,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:07:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:07:19,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:07:19,603 INFO L87 Difference]: Start difference. First operand 178087 states and 214150 transitions. Second operand 9 states. [2019-10-03 03:07:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:21,347 INFO L93 Difference]: Finished difference Result 257507 states and 308427 transitions. [2019-10-03 03:07:21,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:07:21,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-10-03 03:07:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:21,669 INFO L225 Difference]: With dead ends: 257507 [2019-10-03 03:07:21,669 INFO L226 Difference]: Without dead ends: 257507 [2019-10-03 03:07:21,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:07:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257507 states. [2019-10-03 03:07:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257507 to 178087. [2019-10-03 03:07:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178087 states. [2019-10-03 03:07:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178087 states to 178087 states and 214148 transitions. [2019-10-03 03:07:23,758 INFO L78 Accepts]: Start accepts. Automaton has 178087 states and 214148 transitions. Word has length 103 [2019-10-03 03:07:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:23,759 INFO L475 AbstractCegarLoop]: Abstraction has 178087 states and 214148 transitions. [2019-10-03 03:07:23,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:07:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 178087 states and 214148 transitions. [2019-10-03 03:07:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 03:07:23,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:23,767 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:07:23,768 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1536461249, now seen corresponding path program 1 times [2019-10-03 03:07:23,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:23,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:23,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:23,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:23,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:23,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:07:23,973 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-10-03 03:07:23,973 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [185], [201], [205], [2148], [2151], [2154], [2157], [2162], [2165], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2220], [2222], [2224], [2227], [2230], [2233], [2241], [2243], [2266], [2269], [2272], [2275], [2283], [2285], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3744], [3747], [3750], [3753], [3756], [3760], [3763], [3767], [3770], [3774], [3806], [3809], [3813], [3816], [3819], [3822], [3827], [3830], [3833], [3836], [3840], [3844], [3848], [3851], [3854], [3857], [3865], [3869], [4986], [4987], [4991], [4992], [4993] [2019-10-03 03:07:23,977 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:07:23,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:07:24,022 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:07:24,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:07:24,386 INFO L272 AbstractInterpreter]: Visited 99 different actions 430 times. Merged at 38 different actions 302 times. Widened at 15 different actions 50 times. Performed 1607 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 13 different actions. Largest state had 255 variables. [2019-10-03 03:07:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:24,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:07:24,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:24,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:07:24,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:24,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:07:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:25,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 03:07:25,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:07:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:25,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:07:25,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:25,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:25,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:25,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:26,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:07:26,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 26 [2019-10-03 03:07:26,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:07:26,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:07:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:07:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:07:26,927 INFO L87 Difference]: Start difference. First operand 178087 states and 214148 transitions. Second operand 19 states. [2019-10-03 03:07:27,340 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-03 03:07:27,646 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-03 03:07:28,023 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-03 03:07:28,472 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:07:28,714 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-03 03:07:29,200 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-10-03 03:07:29,568 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:07:29,793 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-10-03 03:07:31,438 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-03 03:07:31,769 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-03 03:07:32,237 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-03 03:07:32,538 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-03 03:07:32,956 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-10-03 03:07:33,110 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-10-03 03:07:33,783 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-03 03:07:35,839 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-03 03:07:36,198 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-03 03:07:36,538 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-10-03 03:07:36,910 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-10-03 03:07:37,059 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:07:37,248 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-03 03:07:37,480 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-03 03:07:37,773 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-03 03:07:38,024 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-10-03 03:07:38,335 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-03 03:07:38,699 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:07:39,006 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-10-03 03:07:39,189 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-03 03:07:39,418 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:07:39,706 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:07:40,012 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-10-03 03:07:40,495 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:07:40,830 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:07:41,493 WARN L191 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:07:42,188 WARN L191 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:07:42,650 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:07:43,011 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:07:43,410 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:07:44,178 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-03 03:07:44,514 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:07:44,872 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:07:45,086 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:07:45,469 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-03 03:07:45,843 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:07:46,346 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-03 03:07:46,625 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-10-03 03:07:47,042 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:07:47,460 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:07:47,865 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:07:48,346 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:07:48,869 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:07:49,057 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:07:49,269 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-03 03:07:49,651 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-03 03:07:49,934 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:07:50,107 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:07:50,484 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-03 03:07:50,821 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:07:51,186 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-03 03:07:51,414 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:07:51,768 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:07:52,287 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:07:52,675 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:07:53,018 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:07:53,440 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:07:53,784 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:07:54,102 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:07:54,432 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:07:54,875 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:07:55,659 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:07:56,194 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-03 03:07:56,521 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:07:56,889 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:07:57,474 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:07:57,838 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:07:58,136 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:07:58,626 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:07:59,548 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:08:00,107 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:08:00,834 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-10-03 03:08:01,341 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-10-03 03:08:01,619 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:08:02,191 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-03 03:08:02,582 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-10-03 03:08:02,947 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:08:03,432 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:08:03,952 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-03 03:08:04,488 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-03 03:08:04,878 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:08:05,469 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-10-03 03:08:06,041 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:08:06,806 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:08:07,080 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-10-03 03:08:07,655 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-03 03:08:08,210 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-10-03 03:08:08,784 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-03 03:08:09,033 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:08:09,414 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:08:09,753 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-10-03 03:08:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:10,524 INFO L93 Difference]: Finished difference Result 367343 states and 436049 transitions. [2019-10-03 03:08:10,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-10-03 03:08:10,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 104 [2019-10-03 03:08:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:10,525 INFO L225 Difference]: With dead ends: 367343 [2019-10-03 03:08:10,525 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 03:08:10,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 228 SyntacticMatches, 16 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5295 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=3496, Invalid=12760, Unknown=0, NotChecked=0, Total=16256 [2019-10-03 03:08:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 03:08:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 03:08:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 03:08:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 03:08:10,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2019-10-03 03:08:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:10,530 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 03:08:10,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:08:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 03:08:10,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 03:08:10,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:08:10 BoogieIcfgContainer [2019-10-03 03:08:10,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:08:10,537 INFO L168 Benchmark]: Toolchain (without parser) took 371272.20 ms. Allocated memory was 132.1 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 80.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-10-03 03:08:10,538 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-03 03:08:10,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1485.80 ms. Allocated memory was 132.1 MB in the beginning and 217.6 MB in the end (delta: 85.5 MB). Free memory was 80.2 MB in the beginning and 122.6 MB in the end (delta: -42.4 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-10-03 03:08:10,539 INFO L168 Benchmark]: Boogie Preprocessor took 260.67 ms. Allocated memory is still 217.6 MB. Free memory was 122.6 MB in the beginning and 108.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-10-03 03:08:10,539 INFO L168 Benchmark]: RCFGBuilder took 3662.26 ms. Allocated memory was 217.6 MB in the beginning and 359.1 MB in the end (delta: 141.6 MB). Free memory was 108.9 MB in the beginning and 219.9 MB in the end (delta: -111.0 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2019-10-03 03:08:10,540 INFO L168 Benchmark]: TraceAbstraction took 365857.88 ms. Allocated memory was 359.1 MB in the beginning and 4.1 GB in the end (delta: 3.7 GB). Free memory was 219.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-10-03 03:08:10,543 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1485.80 ms. Allocated memory was 132.1 MB in the beginning and 217.6 MB in the end (delta: 85.5 MB). Free memory was 80.2 MB in the beginning and 122.6 MB in the end (delta: -42.4 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 260.67 ms. Allocated memory is still 217.6 MB. Free memory was 122.6 MB in the beginning and 108.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3662.26 ms. Allocated memory was 217.6 MB in the beginning and 359.1 MB in the end (delta: 141.6 MB). Free memory was 108.9 MB in the beginning and 219.9 MB in the end (delta: -111.0 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 365857.88 ms. Allocated memory was 359.1 MB in the beginning and 4.1 GB in the end (delta: 3.7 GB). Free memory was 219.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3441]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1316]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 370]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 719]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5726]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1850]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1259 locations, 6 error locations. SAFE Result, 365.7s OverallTime, 48 OverallIterations, 2 TraceHistogramMax, 165.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28545 SDtfs, 99544 SDslu, 79834 SDs, 0 SdLazy, 50486 SolverSat, 3057 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 57.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 1018 SyntacticMatches, 40 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8311 ImplicationChecksByTransitivity, 56.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361337occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 174.2s AutomataMinimizationTime, 48 MinimizatonAttempts, 3614433 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 6.6s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 4223 NumberOfCodeBlocks, 4223 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4647 ConstructedInterpolants, 132 QuantifiedInterpolants, 3584841 SizeOfPredicates, 44 NumberOfNonLiveVariables, 6770 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 58 InterpolantComputations, 47 PerfectInterpolantSequences, 202/248 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...