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_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:10:22,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:10:22,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:10:22,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:10:22,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:10:22,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:10:22,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:10:22,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:10:22,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:10:22,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:10:22,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:10:22,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:10:22,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:10:22,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:10:22,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:10:22,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:10:22,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:10:22,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:10:22,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:10:22,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:10:22,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:10:22,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:10:22,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:10:22,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:10:22,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:10:22,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:10:22,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:10:22,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:10:22,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:10:22,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:10:22,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:10:22,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:10:22,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:10:22,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:10:22,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:10:22,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:10:22,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:10:22,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:10:22,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:10:22,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:10:22,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:10:22,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:10:22,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:10:22,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:10:22,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:10:22,398 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:10:22,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:10:22,399 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:10:22,399 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:10:22,400 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:10:22,400 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:10:22,400 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:10:22,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:10:22,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:10:22,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:10:22,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:10:22,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:10:22,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:10:22,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:10:22,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:10:22,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:10:22,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:10:22,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:10:22,403 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:10:22,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:10:22,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:10:22,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:10:22,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:10:22,404 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:10:22,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:10:22,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:10:22,405 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:10:22,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:10:22,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:10:22,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:10:22,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:10:22,460 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:10:22,462 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:10:22,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a464f0d39/348c5c8725f740738e778e4bdc4597ce/FLAGe48ea0ffb [2019-09-10 06:10:23,076 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:10:23,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:10:23,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a464f0d39/348c5c8725f740738e778e4bdc4597ce/FLAGe48ea0ffb [2019-09-10 06:10:23,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a464f0d39/348c5c8725f740738e778e4bdc4597ce [2019-09-10 06:10:23,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:10:23,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:10:23,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:10:23,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:10:23,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:10:23,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:10:23" (1/1) ... [2019-09-10 06:10:23,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:23, skipping insertion in model container [2019-09-10 06:10:23,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:10:23" (1/1) ... [2019-09-10 06:10:23,430 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:10:23,492 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:10:23,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:10:23,894 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:10:23,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:10:24,001 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:10:24,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24 WrapperNode [2019-09-10 06:10:24,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:10:24,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:10:24,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:10:24,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:10:24,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (1/1) ... [2019-09-10 06:10:24,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (1/1) ... [2019-09-10 06:10:24,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (1/1) ... [2019-09-10 06:10:24,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (1/1) ... [2019-09-10 06:10:24,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (1/1) ... [2019-09-10 06:10:24,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (1/1) ... [2019-09-10 06:10:24,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (1/1) ... [2019-09-10 06:10:24,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:10:24,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:10:24,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:10:24,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:10:24,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:10:24,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:10:24,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:10:24,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:10:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:10:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:10:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:10:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:10:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:10:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:10:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:10:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:10:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:10:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:10:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:10:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:10:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:10:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:10:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:10:24,919 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:10:24,920 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:10:24,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:10:24 BoogieIcfgContainer [2019-09-10 06:10:24,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:10:24,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:10:24,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:10:24,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:10:24,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:10:23" (1/3) ... [2019-09-10 06:10:24,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a142f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:10:24, skipping insertion in model container [2019-09-10 06:10:24,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:10:24" (2/3) ... [2019-09-10 06:10:24,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a142f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:10:24, skipping insertion in model container [2019-09-10 06:10:24,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:10:24" (3/3) ... [2019-09-10 06:10:24,935 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 06:10:24,946 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:10:24,969 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:10:24,987 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:10:25,022 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:10:25,022 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:10:25,022 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:10:25,022 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:10:25,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:10:25,023 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:10:25,023 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:10:25,023 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:10:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-10 06:10:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:10:25,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:25,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:25,092 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash 8502252, now seen corresponding path program 1 times [2019-09-10 06:10:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:25,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:25,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:25,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:25,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:25,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:25,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:25,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:25,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:25,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:25,572 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-10 06:10:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:25,756 INFO L93 Difference]: Finished difference Result 213 states and 354 transitions. [2019-09-10 06:10:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:25,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:10:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:25,785 INFO L225 Difference]: With dead ends: 213 [2019-09-10 06:10:25,785 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 06:10:25,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:25,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 06:10:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-09-10 06:10:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-10 06:10:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 317 transitions. [2019-09-10 06:10:25,852 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 317 transitions. Word has length 61 [2019-09-10 06:10:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:25,852 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 317 transitions. [2019-09-10 06:10:25,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 317 transitions. [2019-09-10 06:10:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:10:25,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:25,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:25,857 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash -851487175, now seen corresponding path program 1 times [2019-09-10 06:10:25,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:25,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:25,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:25,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:25,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:25,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:25,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:25,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:25,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:25,998 INFO L87 Difference]: Start difference. First operand 203 states and 317 transitions. Second operand 3 states. [2019-09-10 06:10:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:26,051 INFO L93 Difference]: Finished difference Result 334 states and 530 transitions. [2019-09-10 06:10:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:26,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:10:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:26,055 INFO L225 Difference]: With dead ends: 334 [2019-09-10 06:10:26,055 INFO L226 Difference]: Without dead ends: 334 [2019-09-10 06:10:26,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-10 06:10:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-10 06:10:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-10 06:10:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 529 transitions. [2019-09-10 06:10:26,087 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 529 transitions. Word has length 63 [2019-09-10 06:10:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:26,087 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 529 transitions. [2019-09-10 06:10:26,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 529 transitions. [2019-09-10 06:10:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:10:26,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:26,091 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:26,092 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 812724513, now seen corresponding path program 1 times [2019-09-10 06:10:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:26,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:26,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:26,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:26,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:26,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:26,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:26,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:26,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:26,200 INFO L87 Difference]: Start difference. First operand 332 states and 529 transitions. Second operand 3 states. [2019-09-10 06:10:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:26,236 INFO L93 Difference]: Finished difference Result 462 states and 740 transitions. [2019-09-10 06:10:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:26,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 06:10:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:26,244 INFO L225 Difference]: With dead ends: 462 [2019-09-10 06:10:26,245 INFO L226 Difference]: Without dead ends: 462 [2019-09-10 06:10:26,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-10 06:10:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2019-09-10 06:10:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-10 06:10:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 739 transitions. [2019-09-10 06:10:26,306 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 739 transitions. Word has length 65 [2019-09-10 06:10:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:26,306 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 739 transitions. [2019-09-10 06:10:26,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 739 transitions. [2019-09-10 06:10:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:10:26,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:26,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:26,318 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:26,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1750058316, now seen corresponding path program 1 times [2019-09-10 06:10:26,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:26,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:26,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:26,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:26,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:26,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:26,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:26,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:26,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:26,465 INFO L87 Difference]: Start difference. First operand 460 states and 739 transitions. Second operand 3 states. [2019-09-10 06:10:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:26,496 INFO L93 Difference]: Finished difference Result 797 states and 1282 transitions. [2019-09-10 06:10:26,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:26,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 06:10:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:26,502 INFO L225 Difference]: With dead ends: 797 [2019-09-10 06:10:26,502 INFO L226 Difference]: Without dead ends: 797 [2019-09-10 06:10:26,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-10 06:10:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 795. [2019-09-10 06:10:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-10 06:10:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1281 transitions. [2019-09-10 06:10:26,531 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1281 transitions. Word has length 65 [2019-09-10 06:10:26,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:26,534 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1281 transitions. [2019-09-10 06:10:26,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1281 transitions. [2019-09-10 06:10:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:10:26,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:26,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:26,547 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:26,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1895724377, now seen corresponding path program 1 times [2019-09-10 06:10:26,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:26,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:26,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:26,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:26,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:26,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:10:26,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:26,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:10:26,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:10:26,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:26,738 INFO L87 Difference]: Start difference. First operand 795 states and 1281 transitions. Second operand 5 states. [2019-09-10 06:10:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:26,899 INFO L93 Difference]: Finished difference Result 2019 states and 3301 transitions. [2019-09-10 06:10:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:26,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-10 06:10:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:26,911 INFO L225 Difference]: With dead ends: 2019 [2019-09-10 06:10:26,912 INFO L226 Difference]: Without dead ends: 2019 [2019-09-10 06:10:26,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-09-10 06:10:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1761. [2019-09-10 06:10:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-09-10 06:10:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2868 transitions. [2019-09-10 06:10:26,967 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2868 transitions. Word has length 67 [2019-09-10 06:10:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:26,969 INFO L475 AbstractCegarLoop]: Abstraction has 1761 states and 2868 transitions. [2019-09-10 06:10:26,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:10:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2868 transitions. [2019-09-10 06:10:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:10:26,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:26,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:26,971 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1423696929, now seen corresponding path program 1 times [2019-09-10 06:10:26,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:26,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:26,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:27,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:27,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:10:27,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:27,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:10:27,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:10:27,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:10:27,130 INFO L87 Difference]: Start difference. First operand 1761 states and 2868 transitions. Second operand 6 states. [2019-09-10 06:10:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:27,383 INFO L93 Difference]: Finished difference Result 5000 states and 8151 transitions. [2019-09-10 06:10:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:10:27,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-10 06:10:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:27,412 INFO L225 Difference]: With dead ends: 5000 [2019-09-10 06:10:27,412 INFO L226 Difference]: Without dead ends: 5000 [2019-09-10 06:10:27,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2019-09-10 06:10:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 4931. [2019-09-10 06:10:27,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4931 states. [2019-09-10 06:10:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4931 states to 4931 states and 8050 transitions. [2019-09-10 06:10:27,552 INFO L78 Accepts]: Start accepts. Automaton has 4931 states and 8050 transitions. Word has length 68 [2019-09-10 06:10:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:27,552 INFO L475 AbstractCegarLoop]: Abstraction has 4931 states and 8050 transitions. [2019-09-10 06:10:27,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:10:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 8050 transitions. [2019-09-10 06:10:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:10:27,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:27,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:27,559 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1771341997, now seen corresponding path program 1 times [2019-09-10 06:10:27,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:27,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:27,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:27,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:27,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:27,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:27,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:27,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:27,649 INFO L87 Difference]: Start difference. First operand 4931 states and 8050 transitions. Second operand 3 states. [2019-09-10 06:10:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:27,748 INFO L93 Difference]: Finished difference Result 6705 states and 10898 transitions. [2019-09-10 06:10:27,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:27,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:10:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:27,782 INFO L225 Difference]: With dead ends: 6705 [2019-09-10 06:10:27,782 INFO L226 Difference]: Without dead ends: 6705 [2019-09-10 06:10:27,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2019-09-10 06:10:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6703. [2019-09-10 06:10:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6703 states. [2019-09-10 06:10:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6703 states to 6703 states and 10897 transitions. [2019-09-10 06:10:27,975 INFO L78 Accepts]: Start accepts. Automaton has 6703 states and 10897 transitions. Word has length 68 [2019-09-10 06:10:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:27,976 INFO L475 AbstractCegarLoop]: Abstraction has 6703 states and 10897 transitions. [2019-09-10 06:10:27,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6703 states and 10897 transitions. [2019-09-10 06:10:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:10:27,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:27,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:27,978 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 334558445, now seen corresponding path program 1 times [2019-09-10 06:10:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:27,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:27,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:28,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:28,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:28,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:28,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:28,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:28,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:28,041 INFO L87 Difference]: Start difference. First operand 6703 states and 10897 transitions. Second operand 3 states. [2019-09-10 06:10:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:28,110 INFO L93 Difference]: Finished difference Result 9919 states and 16100 transitions. [2019-09-10 06:10:28,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:28,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:10:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:28,183 INFO L225 Difference]: With dead ends: 9919 [2019-09-10 06:10:28,183 INFO L226 Difference]: Without dead ends: 9919 [2019-09-10 06:10:28,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9919 states. [2019-09-10 06:10:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9919 to 9917. [2019-09-10 06:10:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9917 states. [2019-09-10 06:10:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9917 states to 9917 states and 16099 transitions. [2019-09-10 06:10:28,512 INFO L78 Accepts]: Start accepts. Automaton has 9917 states and 16099 transitions. Word has length 68 [2019-09-10 06:10:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:28,512 INFO L475 AbstractCegarLoop]: Abstraction has 9917 states and 16099 transitions. [2019-09-10 06:10:28,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 9917 states and 16099 transitions. [2019-09-10 06:10:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:10:28,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:28,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:28,520 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:28,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1241984288, now seen corresponding path program 1 times [2019-09-10 06:10:28,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:28,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:28,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:28,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:28,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:28,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:28,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:28,666 INFO L87 Difference]: Start difference. First operand 9917 states and 16099 transitions. Second operand 4 states. [2019-09-10 06:10:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:28,815 INFO L93 Difference]: Finished difference Result 15484 states and 25083 transitions. [2019-09-10 06:10:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:28,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-10 06:10:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:28,860 INFO L225 Difference]: With dead ends: 15484 [2019-09-10 06:10:28,860 INFO L226 Difference]: Without dead ends: 15484 [2019-09-10 06:10:28,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15484 states. [2019-09-10 06:10:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15484 to 15417. [2019-09-10 06:10:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2019-09-10 06:10:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 24955 transitions. [2019-09-10 06:10:29,977 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 24955 transitions. Word has length 69 [2019-09-10 06:10:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:29,977 INFO L475 AbstractCegarLoop]: Abstraction has 15417 states and 24955 transitions. [2019-09-10 06:10:29,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 24955 transitions. [2019-09-10 06:10:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:10:29,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:29,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:29,979 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash 100698310, now seen corresponding path program 1 times [2019-09-10 06:10:29,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:29,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:29,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:30,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:30,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:30,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:30,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:30,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:30,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:30,057 INFO L87 Difference]: Start difference. First operand 15417 states and 24955 transitions. Second operand 4 states. [2019-09-10 06:10:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:30,301 INFO L93 Difference]: Finished difference Result 30207 states and 48922 transitions. [2019-09-10 06:10:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:30,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-09-10 06:10:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:30,399 INFO L225 Difference]: With dead ends: 30207 [2019-09-10 06:10:30,399 INFO L226 Difference]: Without dead ends: 30207 [2019-09-10 06:10:30,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30207 states. [2019-09-10 06:10:30,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30207 to 22725. [2019-09-10 06:10:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-09-10 06:10:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 36691 transitions. [2019-09-10 06:10:30,990 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 36691 transitions. Word has length 70 [2019-09-10 06:10:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:30,990 INFO L475 AbstractCegarLoop]: Abstraction has 22725 states and 36691 transitions. [2019-09-10 06:10:30,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 36691 transitions. [2019-09-10 06:10:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:10:30,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:30,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:30,992 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:30,992 INFO L82 PathProgramCache]: Analyzing trace with hash 792159510, now seen corresponding path program 1 times [2019-09-10 06:10:30,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:30,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:30,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:30,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:30,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:31,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:31,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:10:31,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:31,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:10:31,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:10:31,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:31,148 INFO L87 Difference]: Start difference. First operand 22725 states and 36691 transitions. Second operand 5 states. [2019-09-10 06:10:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:31,320 INFO L93 Difference]: Finished difference Result 24433 states and 39371 transitions. [2019-09-10 06:10:31,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:31,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 06:10:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:31,378 INFO L225 Difference]: With dead ends: 24433 [2019-09-10 06:10:31,379 INFO L226 Difference]: Without dead ends: 24433 [2019-09-10 06:10:31,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24433 states. [2019-09-10 06:10:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24433 to 22725. [2019-09-10 06:10:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-09-10 06:10:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 36556 transitions. [2019-09-10 06:10:31,906 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 36556 transitions. Word has length 72 [2019-09-10 06:10:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:31,907 INFO L475 AbstractCegarLoop]: Abstraction has 22725 states and 36556 transitions. [2019-09-10 06:10:31,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:10:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 36556 transitions. [2019-09-10 06:10:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:10:31,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:31,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:31,908 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash 624122737, now seen corresponding path program 1 times [2019-09-10 06:10:31,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:31,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:31,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:32,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:32,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:10:32,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:32,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:10:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:10:32,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:32,059 INFO L87 Difference]: Start difference. First operand 22725 states and 36556 transitions. Second operand 5 states. [2019-09-10 06:10:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:32,294 INFO L93 Difference]: Finished difference Result 41388 states and 66191 transitions. [2019-09-10 06:10:32,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:32,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:10:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:32,404 INFO L225 Difference]: With dead ends: 41388 [2019-09-10 06:10:32,404 INFO L226 Difference]: Without dead ends: 41388 [2019-09-10 06:10:32,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:10:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41388 states. [2019-09-10 06:10:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41388 to 41386. [2019-09-10 06:10:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41386 states. [2019-09-10 06:10:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41386 states to 41386 states and 66190 transitions. [2019-09-10 06:10:33,269 INFO L78 Accepts]: Start accepts. Automaton has 41386 states and 66190 transitions. Word has length 75 [2019-09-10 06:10:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:33,270 INFO L475 AbstractCegarLoop]: Abstraction has 41386 states and 66190 transitions. [2019-09-10 06:10:33,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:10:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 41386 states and 66190 transitions. [2019-09-10 06:10:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:10:33,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:33,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:33,271 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:33,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2128940941, now seen corresponding path program 1 times [2019-09-10 06:10:33,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:33,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:33,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:33,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:33,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:33,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:10:33,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:33,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:10:33,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:10:33,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:33,411 INFO L87 Difference]: Start difference. First operand 41386 states and 66190 transitions. Second operand 5 states. [2019-09-10 06:10:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:33,650 INFO L93 Difference]: Finished difference Result 72834 states and 115276 transitions. [2019-09-10 06:10:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:10:33,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 06:10:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:33,774 INFO L225 Difference]: With dead ends: 72834 [2019-09-10 06:10:33,774 INFO L226 Difference]: Without dead ends: 72834 [2019-09-10 06:10:33,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:10:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72834 states. [2019-09-10 06:10:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72834 to 42462. [2019-09-10 06:10:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42462 states. [2019-09-10 06:10:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42462 states to 42462 states and 67257 transitions. [2019-09-10 06:10:35,795 INFO L78 Accepts]: Start accepts. Automaton has 42462 states and 67257 transitions. Word has length 76 [2019-09-10 06:10:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:35,796 INFO L475 AbstractCegarLoop]: Abstraction has 42462 states and 67257 transitions. [2019-09-10 06:10:35,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:10:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 42462 states and 67257 transitions. [2019-09-10 06:10:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:10:35,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:35,800 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:35,800 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash -294350133, now seen corresponding path program 1 times [2019-09-10 06:10:35,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:35,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:35,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:35,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:35,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:10:36,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:36,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:36,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:36,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:36,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:36,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:36,168 INFO L87 Difference]: Start difference. First operand 42462 states and 67257 transitions. Second operand 4 states. [2019-09-10 06:10:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:36,511 INFO L93 Difference]: Finished difference Result 69547 states and 110373 transitions. [2019-09-10 06:10:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:36,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 06:10:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:36,641 INFO L225 Difference]: With dead ends: 69547 [2019-09-10 06:10:36,641 INFO L226 Difference]: Without dead ends: 69547 [2019-09-10 06:10:36,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69547 states. [2019-09-10 06:10:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69547 to 61175. [2019-09-10 06:10:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61175 states. [2019-09-10 06:10:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61175 states to 61175 states and 97106 transitions. [2019-09-10 06:10:38,229 INFO L78 Accepts]: Start accepts. Automaton has 61175 states and 97106 transitions. Word has length 97 [2019-09-10 06:10:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:38,229 INFO L475 AbstractCegarLoop]: Abstraction has 61175 states and 97106 transitions. [2019-09-10 06:10:38,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 61175 states and 97106 transitions. [2019-09-10 06:10:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:10:38,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:38,232 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:38,232 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash -266072244, now seen corresponding path program 1 times [2019-09-10 06:10:38,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:38,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:38,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:38,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:38,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:38,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:38,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:38,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:38,335 INFO L87 Difference]: Start difference. First operand 61175 states and 97106 transitions. Second operand 3 states. [2019-09-10 06:10:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:38,500 INFO L93 Difference]: Finished difference Result 52676 states and 83625 transitions. [2019-09-10 06:10:38,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:38,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:10:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:38,606 INFO L225 Difference]: With dead ends: 52676 [2019-09-10 06:10:38,607 INFO L226 Difference]: Without dead ends: 52676 [2019-09-10 06:10:38,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52676 states. [2019-09-10 06:10:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52676 to 52670. [2019-09-10 06:10:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52670 states. [2019-09-10 06:10:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52670 states to 52670 states and 83620 transitions. [2019-09-10 06:10:40,568 INFO L78 Accepts]: Start accepts. Automaton has 52670 states and 83620 transitions. Word has length 97 [2019-09-10 06:10:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:40,569 INFO L475 AbstractCegarLoop]: Abstraction has 52670 states and 83620 transitions. [2019-09-10 06:10:40,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 52670 states and 83620 transitions. [2019-09-10 06:10:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:10:40,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:40,571 INFO L399 BasicCegarLoop]: trace histogram [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-09-10 06:10:40,571 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1440233355, now seen corresponding path program 1 times [2019-09-10 06:10:40,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:40,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:40,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:40,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:40,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:10:40,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:40,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:40,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:40,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:40,747 INFO L87 Difference]: Start difference. First operand 52670 states and 83620 transitions. Second operand 4 states. [2019-09-10 06:10:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:41,135 INFO L93 Difference]: Finished difference Result 88403 states and 140685 transitions. [2019-09-10 06:10:41,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:41,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 06:10:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:41,312 INFO L225 Difference]: With dead ends: 88403 [2019-09-10 06:10:41,312 INFO L226 Difference]: Without dead ends: 88403 [2019-09-10 06:10:41,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88403 states. [2019-09-10 06:10:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88403 to 77817. [2019-09-10 06:10:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77817 states. [2019-09-10 06:10:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77817 states to 77817 states and 123837 transitions. [2019-09-10 06:10:42,929 INFO L78 Accepts]: Start accepts. Automaton has 77817 states and 123837 transitions. Word has length 97 [2019-09-10 06:10:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:42,929 INFO L475 AbstractCegarLoop]: Abstraction has 77817 states and 123837 transitions. [2019-09-10 06:10:42,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 77817 states and 123837 transitions. [2019-09-10 06:10:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:10:42,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:42,932 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:42,932 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:42,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1991425558, now seen corresponding path program 1 times [2019-09-10 06:10:42,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:42,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:42,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:42,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:42,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:10:43,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:43,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:10:43,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:43,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:10:43,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:10:43,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:43,037 INFO L87 Difference]: Start difference. First operand 77817 states and 123837 transitions. Second operand 5 states. [2019-09-10 06:10:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:43,389 INFO L93 Difference]: Finished difference Result 104046 states and 164905 transitions. [2019-09-10 06:10:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:10:43,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 06:10:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:43,512 INFO L225 Difference]: With dead ends: 104046 [2019-09-10 06:10:43,513 INFO L226 Difference]: Without dead ends: 104046 [2019-09-10 06:10:43,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104046 states. [2019-09-10 06:10:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104046 to 102313. [2019-09-10 06:10:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102313 states. [2019-09-10 06:10:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102313 states to 102313 states and 162324 transitions. [2019-09-10 06:10:46,030 INFO L78 Accepts]: Start accepts. Automaton has 102313 states and 162324 transitions. Word has length 97 [2019-09-10 06:10:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:46,030 INFO L475 AbstractCegarLoop]: Abstraction has 102313 states and 162324 transitions. [2019-09-10 06:10:46,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:10:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 102313 states and 162324 transitions. [2019-09-10 06:10:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:10:46,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:46,032 INFO L399 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, 1, 1, 1] [2019-09-10 06:10:46,032 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1914840343, now seen corresponding path program 1 times [2019-09-10 06:10:46,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:46,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:10:46,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:46,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:46,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:46,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:46,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:46,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:46,102 INFO L87 Difference]: Start difference. First operand 102313 states and 162324 transitions. Second operand 3 states. [2019-09-10 06:10:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:46,490 INFO L93 Difference]: Finished difference Result 186124 states and 294914 transitions. [2019-09-10 06:10:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:46,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:10:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:46,721 INFO L225 Difference]: With dead ends: 186124 [2019-09-10 06:10:46,721 INFO L226 Difference]: Without dead ends: 186124 [2019-09-10 06:10:46,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186124 states. [2019-09-10 06:10:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186124 to 185809. [2019-09-10 06:10:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185809 states. [2019-09-10 06:10:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185809 states to 185809 states and 294600 transitions. [2019-09-10 06:10:51,506 INFO L78 Accepts]: Start accepts. Automaton has 185809 states and 294600 transitions. Word has length 98 [2019-09-10 06:10:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:51,507 INFO L475 AbstractCegarLoop]: Abstraction has 185809 states and 294600 transitions. [2019-09-10 06:10:51,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:10:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 185809 states and 294600 transitions. [2019-09-10 06:10:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:10:51,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:51,508 INFO L399 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, 1, 1, 1, 1] [2019-09-10 06:10:51,509 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:51,509 INFO L82 PathProgramCache]: Analyzing trace with hash 587107172, now seen corresponding path program 1 times [2019-09-10 06:10:51,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:51,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:51,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:51,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:51,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:51,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:51,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:10:51,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:51,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:10:51,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:10:51,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:51,578 INFO L87 Difference]: Start difference. First operand 185809 states and 294600 transitions. Second operand 3 states. [2019-09-10 06:10:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:56,635 INFO L93 Difference]: Finished difference Result 361114 states and 568278 transitions. [2019-09-10 06:10:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:10:56,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:10:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:57,122 INFO L225 Difference]: With dead ends: 361114 [2019-09-10 06:10:57,123 INFO L226 Difference]: Without dead ends: 361114 [2019-09-10 06:10:57,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:10:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361114 states. [2019-09-10 06:11:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361114 to 361112. [2019-09-10 06:11:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361112 states. [2019-09-10 06:11:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361112 states to 361112 states and 568277 transitions. [2019-09-10 06:11:01,263 INFO L78 Accepts]: Start accepts. Automaton has 361112 states and 568277 transitions. Word has length 99 [2019-09-10 06:11:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:01,264 INFO L475 AbstractCegarLoop]: Abstraction has 361112 states and 568277 transitions. [2019-09-10 06:11:01,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 361112 states and 568277 transitions. [2019-09-10 06:11:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:11:01,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:01,267 INFO L399 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, 1, 1, 1, 1] [2019-09-10 06:11:01,267 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:01,267 INFO L82 PathProgramCache]: Analyzing trace with hash -133241042, now seen corresponding path program 1 times [2019-09-10 06:11:01,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:01,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:01,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:01,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:01,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:01,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:01,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:01,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:01,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:01,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:01,338 INFO L87 Difference]: Start difference. First operand 361112 states and 568277 transitions. Second operand 3 states. [2019-09-10 06:11:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:09,870 INFO L93 Difference]: Finished difference Result 699361 states and 1091460 transitions. [2019-09-10 06:11:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:09,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:11:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:11,103 INFO L225 Difference]: With dead ends: 699361 [2019-09-10 06:11:11,104 INFO L226 Difference]: Without dead ends: 699361 [2019-09-10 06:11:11,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699361 states. [2019-09-10 06:11:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699361 to 699359. [2019-09-10 06:11:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699359 states. [2019-09-10 06:11:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699359 states to 699359 states and 1091459 transitions. [2019-09-10 06:11:29,686 INFO L78 Accepts]: Start accepts. Automaton has 699359 states and 1091459 transitions. Word has length 99 [2019-09-10 06:11:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:29,687 INFO L475 AbstractCegarLoop]: Abstraction has 699359 states and 1091459 transitions. [2019-09-10 06:11:29,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:11:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 699359 states and 1091459 transitions. [2019-09-10 06:11:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:11:29,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:29,692 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:11:29,692 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash 999057199, now seen corresponding path program 1 times [2019-09-10 06:11:29,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:29,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:29,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:11:29,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:29,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:29,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:29,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:29,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:29,762 INFO L87 Difference]: Start difference. First operand 699359 states and 1091459 transitions. Second operand 3 states. [2019-09-10 06:11:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:33,861 INFO L93 Difference]: Finished difference Result 699491 states and 1083329 transitions. [2019-09-10 06:11:33,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:33,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:11:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:45,212 INFO L225 Difference]: With dead ends: 699491 [2019-09-10 06:11:45,212 INFO L226 Difference]: Without dead ends: 699491 [2019-09-10 06:11:45,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699491 states. [2019-09-10 06:11:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699491 to 699489. [2019-09-10 06:11:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699489 states. [2019-09-10 06:12:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699489 states to 699489 states and 1083328 transitions. [2019-09-10 06:12:04,752 INFO L78 Accepts]: Start accepts. Automaton has 699489 states and 1083328 transitions. Word has length 102 [2019-09-10 06:12:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:04,752 INFO L475 AbstractCegarLoop]: Abstraction has 699489 states and 1083328 transitions. [2019-09-10 06:12:04,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 699489 states and 1083328 transitions. [2019-09-10 06:12:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:12:04,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:04,756 INFO L399 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, 1, 1, 1, 1] [2019-09-10 06:12:04,756 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1384335120, now seen corresponding path program 1 times [2019-09-10 06:12:04,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:04,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:04,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:04,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:04,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:12:04,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:04,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:04,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:04,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:04,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:04,967 INFO L87 Difference]: Start difference. First operand 699489 states and 1083328 transitions. Second operand 4 states. [2019-09-10 06:12:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:16,979 INFO L93 Difference]: Finished difference Result 1262519 states and 1947627 transitions. [2019-09-10 06:12:16,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:12:16,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:12:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:19,543 INFO L225 Difference]: With dead ends: 1262519 [2019-09-10 06:12:19,544 INFO L226 Difference]: Without dead ends: 1262519 [2019-09-10 06:12:19,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262519 states. [2019-09-10 06:12:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262519 to 1098279. [2019-09-10 06:12:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098279 states. [2019-09-10 06:13:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098279 states to 1098279 states and 1694865 transitions. [2019-09-10 06:13:09,420 INFO L78 Accepts]: Start accepts. Automaton has 1098279 states and 1694865 transitions. Word has length 102 [2019-09-10 06:13:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:09,420 INFO L475 AbstractCegarLoop]: Abstraction has 1098279 states and 1694865 transitions. [2019-09-10 06:13:09,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1098279 states and 1694865 transitions. [2019-09-10 06:13:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:13:09,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:09,423 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:09,423 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:09,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1738365354, now seen corresponding path program 1 times [2019-09-10 06:13:09,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:09,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:09,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:09,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:09,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:09,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:09,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:09,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:09,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:09,532 INFO L87 Difference]: Start difference. First operand 1098279 states and 1694865 transitions. Second operand 3 states. [2019-09-10 06:13:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:12,064 INFO L93 Difference]: Finished difference Result 497269 states and 761327 transitions. [2019-09-10 06:13:12,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:12,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:13:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:12,742 INFO L225 Difference]: With dead ends: 497269 [2019-09-10 06:13:12,742 INFO L226 Difference]: Without dead ends: 497269 [2019-09-10 06:13:12,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497269 states. [2019-09-10 06:13:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497269 to 497267. [2019-09-10 06:13:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497267 states. [2019-09-10 06:13:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497267 states to 497267 states and 761326 transitions. [2019-09-10 06:13:27,182 INFO L78 Accepts]: Start accepts. Automaton has 497267 states and 761326 transitions. Word has length 102 [2019-09-10 06:13:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:27,182 INFO L475 AbstractCegarLoop]: Abstraction has 497267 states and 761326 transitions. [2019-09-10 06:13:27,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 497267 states and 761326 transitions. [2019-09-10 06:13:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:13:27,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:27,186 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:27,186 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:27,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:27,188 INFO L82 PathProgramCache]: Analyzing trace with hash 764344457, now seen corresponding path program 1 times [2019-09-10 06:13:27,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:27,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:27,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:27,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:27,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:13:27,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:13:27,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:13:27,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 06:13:27,321 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [143], [147], [169], [173], [195], [197], [200], [203], [206], [209], [212], [216], [224], [226], [229], [230], [232], [241], [244], [248], [253], [255], [258], [272], [276], [280], [282], [285], [310], [318], [326], [332], [336], [340], [342], [345], [370], [378], [386], [392], [396], [400], [402], [405], [430], [438], [446], [558], [559], [563], [564], [565] [2019-09-10 06:13:27,379 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:13:27,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:13:27,597 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:13:28,169 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:13:28,172 INFO L272 AbstractInterpreter]: Visited 95 different actions 527 times. Merged at 49 different actions 377 times. Widened at 25 different actions 63 times. Performed 1611 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1611 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 17 different actions. Largest state had 162 variables. [2019-09-10 06:13:28,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:28,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:13:28,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:13:28,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:13:28,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:28,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:13:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:28,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:13:28,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:13:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:13:28,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:13:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:13:28,587 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:13:28,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:13:28,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:28,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:28,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:28,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:13:28,591 INFO L87 Difference]: Start difference. First operand 497267 states and 761326 transitions. Second operand 4 states. [2019-09-10 06:13:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:30,882 INFO L93 Difference]: Finished difference Result 421587 states and 640732 transitions. [2019-09-10 06:13:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:30,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:13:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:39,930 INFO L225 Difference]: With dead ends: 421587 [2019-09-10 06:13:39,930 INFO L226 Difference]: Without dead ends: 421587 [2019-09-10 06:13:39,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:13:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421587 states. [2019-09-10 06:13:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421587 to 421585. [2019-09-10 06:13:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421585 states. [2019-09-10 06:13:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421585 states to 421585 states and 640731 transitions. [2019-09-10 06:13:47,121 INFO L78 Accepts]: Start accepts. Automaton has 421585 states and 640731 transitions. Word has length 102 [2019-09-10 06:13:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:47,121 INFO L475 AbstractCegarLoop]: Abstraction has 421585 states and 640731 transitions. [2019-09-10 06:13:47,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 421585 states and 640731 transitions. [2019-09-10 06:13:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:13:47,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:47,126 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:47,127 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:47,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1298340587, now seen corresponding path program 1 times [2019-09-10 06:13:47,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:47,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:47,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:13:47,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:47,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:47,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:47,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:47,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:47,185 INFO L87 Difference]: Start difference. First operand 421585 states and 640731 transitions. Second operand 3 states. [2019-09-10 06:13:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:56,309 INFO L93 Difference]: Finished difference Result 843017 states and 1281259 transitions. [2019-09-10 06:13:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:56,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 06:13:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:58,048 INFO L225 Difference]: With dead ends: 843017 [2019-09-10 06:13:58,048 INFO L226 Difference]: Without dead ends: 843017 [2019-09-10 06:13:58,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843017 states. [2019-09-10 06:14:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843017 to 421585. [2019-09-10 06:14:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421585 states. [2019-09-10 06:14:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421585 states to 421585 states and 640730 transitions. [2019-09-10 06:14:08,216 INFO L78 Accepts]: Start accepts. Automaton has 421585 states and 640730 transitions. Word has length 103 [2019-09-10 06:14:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:08,216 INFO L475 AbstractCegarLoop]: Abstraction has 421585 states and 640730 transitions. [2019-09-10 06:14:08,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 421585 states and 640730 transitions. [2019-09-10 06:14:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:14:08,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:08,219 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:08,219 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash -309202614, now seen corresponding path program 1 times [2019-09-10 06:14:08,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:08,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:08,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:08,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:08,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:14:08,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:08,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:14:08,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:08,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:08,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:08,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:14:08,327 INFO L87 Difference]: Start difference. First operand 421585 states and 640730 transitions. Second operand 4 states. [2019-09-10 06:14:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:09,339 INFO L93 Difference]: Finished difference Result 421658 states and 640810 transitions. [2019-09-10 06:14:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:09,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:14:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:09,957 INFO L225 Difference]: With dead ends: 421658 [2019-09-10 06:14:09,957 INFO L226 Difference]: Without dead ends: 421472 [2019-09-10 06:14:09,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:14:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421472 states. [2019-09-10 06:14:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421472 to 421471. [2019-09-10 06:14:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421471 states. [2019-09-10 06:14:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421471 states to 421471 states and 640584 transitions. [2019-09-10 06:14:25,192 INFO L78 Accepts]: Start accepts. Automaton has 421471 states and 640584 transitions. Word has length 104 [2019-09-10 06:14:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:25,193 INFO L475 AbstractCegarLoop]: Abstraction has 421471 states and 640584 transitions. [2019-09-10 06:14:25,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 421471 states and 640584 transitions. [2019-09-10 06:14:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:14:25,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:25,195 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:25,195 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:25,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash -312359030, now seen corresponding path program 1 times [2019-09-10 06:14:25,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:25,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:25,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:25,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:25,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:14:25,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:14:25,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:14:25,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 06:14:25,318 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [143], [147], [169], [173], [195], [197], [200], [203], [206], [209], [212], [216], [224], [226], [229], [230], [232], [241], [244], [248], [253], [255], [258], [272], [276], [280], [282], [285], [310], [318], [326], [332], [336], [340], [342], [345], [370], [378], [386], [392], [396], [400], [402], [405], [430], [438], [446], [518], [521], [527], [558], [559], [563], [564], [565] [2019-09-10 06:14:25,323 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:14:25,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:14:25,355 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:14:25,651 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:14:25,652 INFO L272 AbstractInterpreter]: Visited 97 different actions 553 times. Merged at 49 different actions 398 times. Widened at 25 different actions 64 times. Performed 1690 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1690 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 15 different actions. Largest state had 162 variables. [2019-09-10 06:14:25,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:25,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:14:25,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:14:25,653 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) [2019-09-10 06:14:25,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:25,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:14:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:25,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:14:25,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:14:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:14:25,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:14:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:14:25,878 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:14:25,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:14:25,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:25,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:25,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:14:25,880 INFO L87 Difference]: Start difference. First operand 421471 states and 640584 transitions. Second operand 4 states. [2019-09-10 06:14:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:33,034 INFO L93 Difference]: Finished difference Result 421651 states and 640786 transitions. [2019-09-10 06:14:33,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:14:33,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:14:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:33,650 INFO L225 Difference]: With dead ends: 421651 [2019-09-10 06:14:33,650 INFO L226 Difference]: Without dead ends: 421478 [2019-09-10 06:14:33,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:14:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421478 states. [2019-09-10 06:14:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421478 to 421412. [2019-09-10 06:14:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421412 states. [2019-09-10 06:14:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421412 states to 421412 states and 640500 transitions. [2019-09-10 06:14:38,392 INFO L78 Accepts]: Start accepts. Automaton has 421412 states and 640500 transitions. Word has length 104 [2019-09-10 06:14:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:38,393 INFO L475 AbstractCegarLoop]: Abstraction has 421412 states and 640500 transitions. [2019-09-10 06:14:38,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:14:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 421412 states and 640500 transitions. [2019-09-10 06:14:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 06:14:38,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:38,395 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:38,395 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 16007500, now seen corresponding path program 1 times [2019-09-10 06:14:38,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:38,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:38,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:38,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:38,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:14:38,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:38,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:14:38,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:38,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:14:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:14:38,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:38,444 INFO L87 Difference]: Start difference. First operand 421412 states and 640500 transitions. Second operand 3 states. [2019-09-10 06:14:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:41,931 INFO L93 Difference]: Finished difference Result 842714 states and 1280856 transitions. [2019-09-10 06:14:41,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:14:41,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 06:14:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:43,320 INFO L225 Difference]: With dead ends: 842714 [2019-09-10 06:14:43,320 INFO L226 Difference]: Without dead ends: 842714 [2019-09-10 06:14:43,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:14:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842714 states. [2019-09-10 06:14:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842714 to 421414. [2019-09-10 06:14:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421414 states. [2019-09-10 06:14:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421414 states to 421414 states and 640501 transitions. [2019-09-10 06:14:59,424 INFO L78 Accepts]: Start accepts. Automaton has 421414 states and 640501 transitions. Word has length 105 [2019-09-10 06:14:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:59,425 INFO L475 AbstractCegarLoop]: Abstraction has 421414 states and 640501 transitions. [2019-09-10 06:14:59,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:14:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 421414 states and 640501 transitions. [2019-09-10 06:14:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:14:59,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:59,426 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:14:59,426 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2062496971, now seen corresponding path program 1 times [2019-09-10 06:14:59,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:59,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:59,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:59,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:59,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:14:59,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:59,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:14:59,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:59,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:14:59,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:14:59,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:14:59,547 INFO L87 Difference]: Start difference. First operand 421414 states and 640501 transitions. Second operand 4 states. [2019-09-10 06:15:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:00,501 INFO L93 Difference]: Finished difference Result 380860 states and 578824 transitions. [2019-09-10 06:15:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:00,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:15:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:02,751 INFO L225 Difference]: With dead ends: 380860 [2019-09-10 06:15:02,752 INFO L226 Difference]: Without dead ends: 380806 [2019-09-10 06:15:02,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:15:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380806 states. [2019-09-10 06:15:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380806 to 380802. [2019-09-10 06:15:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380802 states. [2019-09-10 06:15:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380802 states to 380802 states and 578765 transitions. [2019-09-10 06:15:13,228 INFO L78 Accepts]: Start accepts. Automaton has 380802 states and 578765 transitions. Word has length 106 [2019-09-10 06:15:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:13,229 INFO L475 AbstractCegarLoop]: Abstraction has 380802 states and 578765 transitions. [2019-09-10 06:15:13,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 380802 states and 578765 transitions. [2019-09-10 06:15:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:15:13,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:13,230 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:13,231 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:13,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1376356777, now seen corresponding path program 1 times [2019-09-10 06:15:13,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:13,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:13,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:13,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:13,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:15:13,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:13,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:15:13,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:13,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:15:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:15:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:15:13,316 INFO L87 Difference]: Start difference. First operand 380802 states and 578765 transitions. Second operand 5 states. [2019-09-10 06:15:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:14,355 INFO L93 Difference]: Finished difference Result 380802 states and 570888 transitions. [2019-09-10 06:15:14,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:15:14,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 06:15:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:14,995 INFO L225 Difference]: With dead ends: 380802 [2019-09-10 06:15:14,995 INFO L226 Difference]: Without dead ends: 380802 [2019-09-10 06:15:14,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:15:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380802 states. [2019-09-10 06:15:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380802 to 380802. [2019-09-10 06:15:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380802 states. [2019-09-10 06:15:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380802 states to 380802 states and 570888 transitions. [2019-09-10 06:15:25,752 INFO L78 Accepts]: Start accepts. Automaton has 380802 states and 570888 transitions. Word has length 106 [2019-09-10 06:15:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:25,752 INFO L475 AbstractCegarLoop]: Abstraction has 380802 states and 570888 transitions. [2019-09-10 06:15:25,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:15:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 380802 states and 570888 transitions. [2019-09-10 06:15:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:15:25,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:25,754 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:25,754 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 780961892, now seen corresponding path program 1 times [2019-09-10 06:15:25,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:25,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:25,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:25,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:25,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:15:25,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:15:25,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:15:25,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 06:15:25,872 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [124], [143], [147], [169], [173], [195], [197], [200], [203], [206], [209], [212], [216], [224], [226], [229], [230], [232], [241], [244], [248], [253], [255], [258], [272], [276], [280], [282], [285], [310], [318], [326], [332], [336], [340], [342], [345], [348], [351], [354], [356], [370], [378], [392], [396], [398], [402], [405], [430], [438], [446], [558], [559], [563], [564], [565] [2019-09-10 06:15:25,883 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:15:25,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:15:25,926 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:15:26,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:15:26,442 INFO L272 AbstractInterpreter]: Visited 99 different actions 735 times. Merged at 53 different actions 567 times. Widened at 27 different actions 146 times. Performed 2250 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2250 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 20 different actions. Largest state had 163 variables. [2019-09-10 06:15:26,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:26,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:15:26,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:15:26,443 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) [2019-09-10 06:15:26,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:26,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:15:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:26,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:15:26,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:15:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:15:26,642 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:15:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:15:26,689 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:15:26,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:15:26,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:26,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:26,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:15:26,690 INFO L87 Difference]: Start difference. First operand 380802 states and 570888 transitions. Second operand 4 states. [2019-09-10 06:15:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:28,591 INFO L93 Difference]: Finished difference Result 380804 states and 570887 transitions. [2019-09-10 06:15:28,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:28,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:15:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:29,126 INFO L225 Difference]: With dead ends: 380804 [2019-09-10 06:15:29,126 INFO L226 Difference]: Without dead ends: 380804 [2019-09-10 06:15:29,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:15:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380804 states. [2019-09-10 06:15:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380804 to 380739. [2019-09-10 06:15:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380739 states. [2019-09-10 06:15:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380739 states to 380739 states and 570812 transitions. [2019-09-10 06:15:35,436 INFO L78 Accepts]: Start accepts. Automaton has 380739 states and 570812 transitions. Word has length 106 [2019-09-10 06:15:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:35,436 INFO L475 AbstractCegarLoop]: Abstraction has 380739 states and 570812 transitions. [2019-09-10 06:15:35,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 380739 states and 570812 transitions. [2019-09-10 06:15:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:15:35,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:35,438 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:35,438 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1464729779, now seen corresponding path program 1 times [2019-09-10 06:15:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:35,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:35,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:35,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:35,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:15:35,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:15:35,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:15:35,553 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 06:15:35,553 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [131], [134], [143], [147], [169], [173], [195], [197], [200], [203], [206], [209], [212], [216], [224], [226], [229], [230], [232], [241], [244], [248], [253], [255], [258], [272], [276], [280], [282], [285], [288], [291], [294], [296], [310], [318], [332], [336], [340], [342], [345], [370], [378], [386], [392], [400], [402], [405], [430], [438], [446], [518], [521], [524], [558], [559], [563], [564], [565] [2019-09-10 06:15:35,555 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:15:35,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:15:35,586 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:15:35,923 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:15:35,923 INFO L272 AbstractInterpreter]: Visited 101 different actions 541 times. Merged at 53 different actions 391 times. Widened at 25 different actions 83 times. Performed 1752 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1752 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 18 different actions. Largest state had 163 variables. [2019-09-10 06:15:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:35,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:15:35,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:15:35,924 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) [2019-09-10 06:15:35,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:35,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:15:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:36,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:15:36,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:15:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:15:36,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:15:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:15:36,185 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:15:36,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:15:36,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:36,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:36,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:15:36,188 INFO L87 Difference]: Start difference. First operand 380739 states and 570812 transitions. Second operand 4 states. [2019-09-10 06:15:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:43,078 INFO L93 Difference]: Finished difference Result 622453 states and 926277 transitions. [2019-09-10 06:15:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:43,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:15:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:44,184 INFO L225 Difference]: With dead ends: 622453 [2019-09-10 06:15:44,184 INFO L226 Difference]: Without dead ends: 622453 [2019-09-10 06:15:44,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:15:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622453 states. [2019-09-10 06:15:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622453 to 622451. [2019-09-10 06:15:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622451 states. [2019-09-10 06:15:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622451 states to 622451 states and 926276 transitions. [2019-09-10 06:15:52,720 INFO L78 Accepts]: Start accepts. Automaton has 622451 states and 926276 transitions. Word has length 108 [2019-09-10 06:15:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:52,720 INFO L475 AbstractCegarLoop]: Abstraction has 622451 states and 926276 transitions. [2019-09-10 06:15:52,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 622451 states and 926276 transitions. [2019-09-10 06:15:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:15:52,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:52,722 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:15:52,722 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1338880706, now seen corresponding path program 1 times [2019-09-10 06:15:52,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:52,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:52,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:15:52,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:52,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:52,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:52,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:52,780 INFO L87 Difference]: Start difference. First operand 622451 states and 926276 transitions. Second operand 3 states. [2019-09-10 06:16:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:02,450 INFO L93 Difference]: Finished difference Result 980644 states and 1439903 transitions. [2019-09-10 06:16:02,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:16:02,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:16:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:04,944 INFO L225 Difference]: With dead ends: 980644 [2019-09-10 06:16:04,945 INFO L226 Difference]: Without dead ends: 980644 [2019-09-10 06:16:04,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:16:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980644 states. [2019-09-10 06:16:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980644 to 980642. [2019-09-10 06:16:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980642 states. [2019-09-10 06:16:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980642 states to 980642 states and 1439902 transitions. [2019-09-10 06:16:33,928 INFO L78 Accepts]: Start accepts. Automaton has 980642 states and 1439902 transitions. Word has length 110 [2019-09-10 06:16:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:33,928 INFO L475 AbstractCegarLoop]: Abstraction has 980642 states and 1439902 transitions. [2019-09-10 06:16:33,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:16:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 980642 states and 1439902 transitions. [2019-09-10 06:16:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:16:33,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:33,931 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:16:33,931 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:33,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:33,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1548303647, now seen corresponding path program 1 times [2019-09-10 06:16:33,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:33,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:33,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:33,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:33,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:16:34,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:16:34,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:16:34,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:16:34,122 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [121], [131], [134], [143], [147], [169], [173], [183], [195], [197], [200], [203], [206], [209], [212], [216], [224], [226], [229], [230], [232], [241], [244], [248], [253], [255], [258], [272], [274], [280], [282], [285], [288], [291], [294], [296], [310], [318], [332], [336], [340], [342], [345], [360], [363], [366], [368], [370], [386], [392], [400], [402], [405], [430], [438], [446], [518], [521], [524], [558], [559], [563], [564], [565] [2019-09-10 06:16:34,126 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:16:34,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:16:34,165 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:16:34,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:16:34,565 INFO L272 AbstractInterpreter]: Visited 105 different actions 586 times. Merged at 57 different actions 429 times. Widened at 25 different actions 85 times. Performed 1905 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1905 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 18 different actions. Largest state had 164 variables. [2019-09-10 06:16:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:34,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:16:34,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:16:34,566 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-09-10 06:16:34,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:34,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:16:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:34,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:16:34,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:16:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:16:34,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:16:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:16:34,809 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:16:34,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 06:16:34,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:34,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:34,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:16:34,815 INFO L87 Difference]: Start difference. First operand 980642 states and 1439902 transitions. Second operand 4 states. [2019-09-10 06:16:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:41,588 INFO L93 Difference]: Finished difference Result 1564863 states and 2269714 transitions. [2019-09-10 06:16:41,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:41,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 06:16:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:45,670 INFO L225 Difference]: With dead ends: 1564863 [2019-09-10 06:16:45,670 INFO L226 Difference]: Without dead ends: 1564863 [2019-09-10 06:16:45,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:16:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564863 states. [2019-09-10 06:17:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564863 to 1564855. [2019-09-10 06:17:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564855 states.