./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 129b0578c0c64625cef50fbcfd5d128651ff3275 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:50:14,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:50:14,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:50:14,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:50:14,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:50:14,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:50:14,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:50:14,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:50:14,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:50:14,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:50:14,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:50:14,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:50:14,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:50:14,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:50:14,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:50:14,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:50:14,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:50:14,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:50:14,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:50:14,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:50:14,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:50:14,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:50:14,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:50:14,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:50:14,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:50:14,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:50:14,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:50:14,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:50:14,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:50:14,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:50:14,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:50:14,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:50:14,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:50:14,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:50:14,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:50:14,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:50:14,071 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 04:50:14,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:50:14,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:50:14,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:50:14,083 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:50:14,083 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:50:14,083 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:50:14,083 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 04:50:14,083 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:50:14,083 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 04:50:14,083 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 04:50:14,084 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:50:14,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:50:14,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:50:14,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:50:14,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:50:14,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:50:14,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:50:14,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:50:14,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:50:14,085 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:50:14,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:50:14,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:50:14,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:50:14,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:50:14,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:50:14,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:50:14,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:50:14,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:50:14,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:50:14,087 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:50:14,087 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 04:50:14,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:50:14,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:50:14,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 04:50:14,087 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-11-10 04:50:14,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:50:14,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:50:14,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:50:14,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:50:14,120 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:50:14,120 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:50:14,157 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/data/b97ac5208/675b91b0db3e486b99a74a517298fd7e/FLAGe5ff3c522 [2018-11-10 04:50:14,480 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:50:14,480 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:50:14,485 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/data/b97ac5208/675b91b0db3e486b99a74a517298fd7e/FLAGe5ff3c522 [2018-11-10 04:50:14,493 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/data/b97ac5208/675b91b0db3e486b99a74a517298fd7e [2018-11-10 04:50:14,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:50:14,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:50:14,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:50:14,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:50:14,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:50:14,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce791db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14, skipping insertion in model container [2018-11-10 04:50:14,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:50:14,522 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:50:14,622 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:50:14,624 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:50:14,642 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:50:14,650 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:50:14,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14 WrapperNode [2018-11-10 04:50:14,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:50:14,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:50:14,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:50:14,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:50:14,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:50:14,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:50:14,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:50:14,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:50:14,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... [2018-11-10 04:50:14,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:50:14,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:50:14,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:50:14,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:50:14,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/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 [2018-11-10 04:50:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:50:14,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:50:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:50:14,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:50:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:50:14,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:50:15,015 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:50:15,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:50:15 BoogieIcfgContainer [2018-11-10 04:50:15,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:50:15,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:50:15,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:50:15,020 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:50:15,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:50:14" (1/3) ... [2018-11-10 04:50:15,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191159b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:50:15, skipping insertion in model container [2018-11-10 04:50:15,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:50:14" (2/3) ... [2018-11-10 04:50:15,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191159b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:50:15, skipping insertion in model container [2018-11-10 04:50:15,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:50:15" (3/3) ... [2018-11-10 04:50:15,023 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:50:15,031 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:50:15,037 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:50:15,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:50:15,071 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:50:15,072 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:50:15,072 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:50:15,072 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:50:15,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:50:15,072 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:50:15,072 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:50:15,072 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:50:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-10 04:50:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:50:15,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,090 INFO L375 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] [2018-11-10 04:50:15,092 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash -26794943, now seen corresponding path program 1 times [2018-11-10 04:50:15,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,247 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-11-10 04:50:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,299 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2018-11-10 04:50:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 04:50:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,307 INFO L225 Difference]: With dead ends: 119 [2018-11-10 04:50:15,307 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 04:50:15,310 INFO L605 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 [2018-11-10 04:50:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 04:50:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2018-11-10 04:50:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 04:50:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2018-11-10 04:50:15,335 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2018-11-10 04:50:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,336 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2018-11-10 04:50:15,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2018-11-10 04:50:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:50:15,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,337 INFO L375 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] [2018-11-10 04:50:15,337 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2020939649, now seen corresponding path program 1 times [2018-11-10 04:50:15,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,387 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand 3 states. [2018-11-10 04:50:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,412 INFO L93 Difference]: Finished difference Result 170 states and 315 transitions. [2018-11-10 04:50:15,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 04:50:15,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,413 INFO L225 Difference]: With dead ends: 170 [2018-11-10 04:50:15,413 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 04:50:15,414 INFO L605 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 [2018-11-10 04:50:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 04:50:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-10 04:50:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 04:50:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 187 transitions. [2018-11-10 04:50:15,420 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 187 transitions. Word has length 26 [2018-11-10 04:50:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,421 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 187 transitions. [2018-11-10 04:50:15,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 187 transitions. [2018-11-10 04:50:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:50:15,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,421 INFO L375 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] [2018-11-10 04:50:15,422 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash -830431472, now seen corresponding path program 1 times [2018-11-10 04:50:15,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,455 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,456 INFO L87 Difference]: Start difference. First operand 102 states and 187 transitions. Second operand 3 states. [2018-11-10 04:50:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,478 INFO L93 Difference]: Finished difference Result 157 states and 283 transitions. [2018-11-10 04:50:15,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 04:50:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,481 INFO L225 Difference]: With dead ends: 157 [2018-11-10 04:50:15,481 INFO L226 Difference]: Without dead ends: 108 [2018-11-10 04:50:15,481 INFO L605 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 [2018-11-10 04:50:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-10 04:50:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-10 04:50:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 04:50:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 190 transitions. [2018-11-10 04:50:15,489 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 190 transitions. Word has length 27 [2018-11-10 04:50:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,489 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 190 transitions. [2018-11-10 04:50:15,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 190 transitions. [2018-11-10 04:50:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:50:15,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,491 INFO L375 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] [2018-11-10 04:50:15,491 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1775592082, now seen corresponding path program 1 times [2018-11-10 04:50:15,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,540 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,541 INFO L87 Difference]: Start difference. First operand 106 states and 190 transitions. Second operand 3 states. [2018-11-10 04:50:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,559 INFO L93 Difference]: Finished difference Result 201 states and 365 transitions. [2018-11-10 04:50:15,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 04:50:15,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,560 INFO L225 Difference]: With dead ends: 201 [2018-11-10 04:50:15,561 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 04:50:15,561 INFO L605 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 [2018-11-10 04:50:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 04:50:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 139. [2018-11-10 04:50:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 04:50:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 251 transitions. [2018-11-10 04:50:15,574 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 251 transitions. Word has length 27 [2018-11-10 04:50:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,574 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 251 transitions. [2018-11-10 04:50:15,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 251 transitions. [2018-11-10 04:50:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:50:15,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,575 INFO L375 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] [2018-11-10 04:50:15,575 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,576 INFO L82 PathProgramCache]: Analyzing trace with hash -218552624, now seen corresponding path program 1 times [2018-11-10 04:50:15,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,606 INFO L87 Difference]: Start difference. First operand 139 states and 251 transitions. Second operand 3 states. [2018-11-10 04:50:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,625 INFO L93 Difference]: Finished difference Result 331 states and 605 transitions. [2018-11-10 04:50:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 04:50:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,627 INFO L225 Difference]: With dead ends: 331 [2018-11-10 04:50:15,627 INFO L226 Difference]: Without dead ends: 201 [2018-11-10 04:50:15,628 INFO L605 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 [2018-11-10 04:50:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-10 04:50:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-11-10 04:50:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-10 04:50:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 359 transitions. [2018-11-10 04:50:15,637 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 359 transitions. Word has length 27 [2018-11-10 04:50:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,637 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 359 transitions. [2018-11-10 04:50:15,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 359 transitions. [2018-11-10 04:50:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:50:15,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,638 INFO L375 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] [2018-11-10 04:50:15,638 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash -791008204, now seen corresponding path program 1 times [2018-11-10 04:50:15,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,677 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,677 INFO L87 Difference]: Start difference. First operand 199 states and 359 transitions. Second operand 3 states. [2018-11-10 04:50:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,691 INFO L93 Difference]: Finished difference Result 298 states and 536 transitions. [2018-11-10 04:50:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 04:50:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,693 INFO L225 Difference]: With dead ends: 298 [2018-11-10 04:50:15,693 INFO L226 Difference]: Without dead ends: 203 [2018-11-10 04:50:15,694 INFO L605 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 [2018-11-10 04:50:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-10 04:50:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-10 04:50:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 04:50:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 359 transitions. [2018-11-10 04:50:15,703 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 359 transitions. Word has length 28 [2018-11-10 04:50:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,703 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 359 transitions. [2018-11-10 04:50:15,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 359 transitions. [2018-11-10 04:50:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:50:15,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,705 INFO L375 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] [2018-11-10 04:50:15,705 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1815015350, now seen corresponding path program 1 times [2018-11-10 04:50:15,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,731 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,732 INFO L87 Difference]: Start difference. First operand 201 states and 359 transitions. Second operand 3 states. [2018-11-10 04:50:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,750 INFO L93 Difference]: Finished difference Result 381 states and 689 transitions. [2018-11-10 04:50:15,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 04:50:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,752 INFO L225 Difference]: With dead ends: 381 [2018-11-10 04:50:15,752 INFO L226 Difference]: Without dead ends: 379 [2018-11-10 04:50:15,752 INFO L605 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 [2018-11-10 04:50:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-10 04:50:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 269. [2018-11-10 04:50:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-10 04:50:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 479 transitions. [2018-11-10 04:50:15,759 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 479 transitions. Word has length 28 [2018-11-10 04:50:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,759 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 479 transitions. [2018-11-10 04:50:15,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 479 transitions. [2018-11-10 04:50:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:50:15,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,760 INFO L375 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] [2018-11-10 04:50:15,761 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash -179129356, now seen corresponding path program 1 times [2018-11-10 04:50:15,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,783 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,784 INFO L87 Difference]: Start difference. First operand 269 states and 479 transitions. Second operand 3 states. [2018-11-10 04:50:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,812 INFO L93 Difference]: Finished difference Result 645 states and 1157 transitions. [2018-11-10 04:50:15,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 04:50:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,813 INFO L225 Difference]: With dead ends: 645 [2018-11-10 04:50:15,813 INFO L226 Difference]: Without dead ends: 387 [2018-11-10 04:50:15,814 INFO L605 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 [2018-11-10 04:50:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-10 04:50:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2018-11-10 04:50:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-10 04:50:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 683 transitions. [2018-11-10 04:50:15,826 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 683 transitions. Word has length 28 [2018-11-10 04:50:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,826 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 683 transitions. [2018-11-10 04:50:15,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 683 transitions. [2018-11-10 04:50:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 04:50:15,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,827 INFO L375 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] [2018-11-10 04:50:15,828 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash 431113445, now seen corresponding path program 1 times [2018-11-10 04:50:15,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,859 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,860 INFO L87 Difference]: Start difference. First operand 385 states and 683 transitions. Second operand 3 states. [2018-11-10 04:50:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,872 INFO L93 Difference]: Finished difference Result 577 states and 1021 transitions. [2018-11-10 04:50:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 04:50:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,873 INFO L225 Difference]: With dead ends: 577 [2018-11-10 04:50:15,874 INFO L226 Difference]: Without dead ends: 391 [2018-11-10 04:50:15,874 INFO L605 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 [2018-11-10 04:50:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-11-10 04:50:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2018-11-10 04:50:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-10 04:50:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 683 transitions. [2018-11-10 04:50:15,882 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 683 transitions. Word has length 29 [2018-11-10 04:50:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,883 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 683 transitions. [2018-11-10 04:50:15,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 683 transitions. [2018-11-10 04:50:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 04:50:15,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,884 INFO L375 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] [2018-11-10 04:50:15,884 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1257830297, now seen corresponding path program 1 times [2018-11-10 04:50:15,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,915 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,916 INFO L87 Difference]: Start difference. First operand 389 states and 683 transitions. Second operand 3 states. [2018-11-10 04:50:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,934 INFO L93 Difference]: Finished difference Result 733 states and 1305 transitions. [2018-11-10 04:50:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 04:50:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,937 INFO L225 Difference]: With dead ends: 733 [2018-11-10 04:50:15,937 INFO L226 Difference]: Without dead ends: 731 [2018-11-10 04:50:15,937 INFO L605 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 [2018-11-10 04:50:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-11-10 04:50:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 529. [2018-11-10 04:50:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-10 04:50:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 919 transitions. [2018-11-10 04:50:15,949 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 919 transitions. Word has length 29 [2018-11-10 04:50:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:15,949 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 919 transitions. [2018-11-10 04:50:15,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 919 transitions. [2018-11-10 04:50:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 04:50:15,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:15,950 INFO L375 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] [2018-11-10 04:50:15,950 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:15,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1042992293, now seen corresponding path program 1 times [2018-11-10 04:50:15,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:15,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:15,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:15,952 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:15,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:15,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:15,975 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:15,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:15,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:15,976 INFO L87 Difference]: Start difference. First operand 529 states and 919 transitions. Second operand 3 states. [2018-11-10 04:50:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:15,995 INFO L93 Difference]: Finished difference Result 1269 states and 2217 transitions. [2018-11-10 04:50:15,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:15,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 04:50:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:15,997 INFO L225 Difference]: With dead ends: 1269 [2018-11-10 04:50:15,997 INFO L226 Difference]: Without dead ends: 755 [2018-11-10 04:50:15,998 INFO L605 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 [2018-11-10 04:50:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-10 04:50:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 753. [2018-11-10 04:50:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-10 04:50:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1303 transitions. [2018-11-10 04:50:16,014 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1303 transitions. Word has length 29 [2018-11-10 04:50:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,014 INFO L481 AbstractCegarLoop]: Abstraction has 753 states and 1303 transitions. [2018-11-10 04:50:16,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1303 transitions. [2018-11-10 04:50:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:50:16,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,015 INFO L375 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] [2018-11-10 04:50:16,015 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,016 INFO L82 PathProgramCache]: Analyzing trace with hash -337820759, now seen corresponding path program 1 times [2018-11-10 04:50:16,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,052 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,052 INFO L87 Difference]: Start difference. First operand 753 states and 1303 transitions. Second operand 3 states. [2018-11-10 04:50:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:16,068 INFO L93 Difference]: Finished difference Result 1129 states and 1949 transitions. [2018-11-10 04:50:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:16,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 04:50:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:16,070 INFO L225 Difference]: With dead ends: 1129 [2018-11-10 04:50:16,070 INFO L226 Difference]: Without dead ends: 763 [2018-11-10 04:50:16,071 INFO L605 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 [2018-11-10 04:50:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-11-10 04:50:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 761. [2018-11-10 04:50:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-10 04:50:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1303 transitions. [2018-11-10 04:50:16,084 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1303 transitions. Word has length 30 [2018-11-10 04:50:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,085 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 1303 transitions. [2018-11-10 04:50:16,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1303 transitions. [2018-11-10 04:50:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:50:16,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,086 INFO L375 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] [2018-11-10 04:50:16,086 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2026764501, now seen corresponding path program 1 times [2018-11-10 04:50:16,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,088 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,109 INFO L87 Difference]: Start difference. First operand 761 states and 1303 transitions. Second operand 3 states. [2018-11-10 04:50:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:16,132 INFO L93 Difference]: Finished difference Result 2221 states and 3801 transitions. [2018-11-10 04:50:16,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:16,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 04:50:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:16,135 INFO L225 Difference]: With dead ends: 2221 [2018-11-10 04:50:16,135 INFO L226 Difference]: Without dead ends: 1483 [2018-11-10 04:50:16,137 INFO L605 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 [2018-11-10 04:50:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-11-10 04:50:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1481. [2018-11-10 04:50:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-10 04:50:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2503 transitions. [2018-11-10 04:50:16,162 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2503 transitions. Word has length 30 [2018-11-10 04:50:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,162 INFO L481 AbstractCegarLoop]: Abstraction has 1481 states and 2503 transitions. [2018-11-10 04:50:16,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2503 transitions. [2018-11-10 04:50:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:50:16,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,164 INFO L375 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] [2018-11-10 04:50:16,164 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash -32619795, now seen corresponding path program 1 times [2018-11-10 04:50:16,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,165 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,183 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,184 INFO L87 Difference]: Start difference. First operand 1481 states and 2503 transitions. Second operand 3 states. [2018-11-10 04:50:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:16,208 INFO L93 Difference]: Finished difference Result 1853 states and 3193 transitions. [2018-11-10 04:50:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:16,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 04:50:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:16,212 INFO L225 Difference]: With dead ends: 1853 [2018-11-10 04:50:16,212 INFO L226 Difference]: Without dead ends: 1851 [2018-11-10 04:50:16,213 INFO L605 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 [2018-11-10 04:50:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2018-11-10 04:50:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1481. [2018-11-10 04:50:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-10 04:50:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2487 transitions. [2018-11-10 04:50:16,239 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2487 transitions. Word has length 30 [2018-11-10 04:50:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,239 INFO L481 AbstractCegarLoop]: Abstraction has 1481 states and 2487 transitions. [2018-11-10 04:50:16,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2487 transitions. [2018-11-10 04:50:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 04:50:16,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,241 INFO L375 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] [2018-11-10 04:50:16,241 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1595023034, now seen corresponding path program 1 times [2018-11-10 04:50:16,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,263 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,264 INFO L87 Difference]: Start difference. First operand 1481 states and 2487 transitions. Second operand 3 states. [2018-11-10 04:50:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:16,288 INFO L93 Difference]: Finished difference Result 2749 states and 4697 transitions. [2018-11-10 04:50:16,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:16,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 04:50:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:16,293 INFO L225 Difference]: With dead ends: 2749 [2018-11-10 04:50:16,293 INFO L226 Difference]: Without dead ends: 2747 [2018-11-10 04:50:16,294 INFO L605 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 [2018-11-10 04:50:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-11-10 04:50:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2073. [2018-11-10 04:50:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2018-11-10 04:50:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3415 transitions. [2018-11-10 04:50:16,327 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3415 transitions. Word has length 31 [2018-11-10 04:50:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,327 INFO L481 AbstractCegarLoop]: Abstraction has 2073 states and 3415 transitions. [2018-11-10 04:50:16,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3415 transitions. [2018-11-10 04:50:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 04:50:16,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,329 INFO L375 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] [2018-11-10 04:50:16,329 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash -399121672, now seen corresponding path program 1 times [2018-11-10 04:50:16,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,331 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,364 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,364 INFO L87 Difference]: Start difference. First operand 2073 states and 3415 transitions. Second operand 3 states. [2018-11-10 04:50:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:16,403 INFO L93 Difference]: Finished difference Result 4957 states and 8217 transitions. [2018-11-10 04:50:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:16,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 04:50:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:16,409 INFO L225 Difference]: With dead ends: 4957 [2018-11-10 04:50:16,409 INFO L226 Difference]: Without dead ends: 2907 [2018-11-10 04:50:16,411 INFO L605 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 [2018-11-10 04:50:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-11-10 04:50:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2905. [2018-11-10 04:50:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2018-11-10 04:50:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4775 transitions. [2018-11-10 04:50:16,483 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4775 transitions. Word has length 31 [2018-11-10 04:50:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,483 INFO L481 AbstractCegarLoop]: Abstraction has 2905 states and 4775 transitions. [2018-11-10 04:50:16,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4775 transitions. [2018-11-10 04:50:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 04:50:16,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,485 INFO L375 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] [2018-11-10 04:50:16,485 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2093680032, now seen corresponding path program 1 times [2018-11-10 04:50:16,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,503 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,504 INFO L87 Difference]: Start difference. First operand 2905 states and 4775 transitions. Second operand 3 states. [2018-11-10 04:50:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:16,544 INFO L93 Difference]: Finished difference Result 4381 states and 7193 transitions. [2018-11-10 04:50:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:16,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 04:50:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:16,550 INFO L225 Difference]: With dead ends: 4381 [2018-11-10 04:50:16,550 INFO L226 Difference]: Without dead ends: 2955 [2018-11-10 04:50:16,552 INFO L605 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 [2018-11-10 04:50:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2018-11-10 04:50:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2018-11-10 04:50:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2018-11-10 04:50:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4807 transitions. [2018-11-10 04:50:16,596 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4807 transitions. Word has length 32 [2018-11-10 04:50:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,596 INFO L481 AbstractCegarLoop]: Abstraction has 2953 states and 4807 transitions. [2018-11-10 04:50:16,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4807 transitions. [2018-11-10 04:50:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 04:50:16,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,598 INFO L375 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] [2018-11-10 04:50:16,599 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash 512343522, now seen corresponding path program 1 times [2018-11-10 04:50:16,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,619 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,619 INFO L87 Difference]: Start difference. First operand 2953 states and 4807 transitions. Second operand 3 states. [2018-11-10 04:50:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:16,679 INFO L93 Difference]: Finished difference Result 5389 states and 8937 transitions. [2018-11-10 04:50:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:16,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 04:50:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:16,688 INFO L225 Difference]: With dead ends: 5389 [2018-11-10 04:50:16,688 INFO L226 Difference]: Without dead ends: 5387 [2018-11-10 04:50:16,690 INFO L605 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 [2018-11-10 04:50:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-10 04:50:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 4169. [2018-11-10 04:50:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2018-11-10 04:50:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 6631 transitions. [2018-11-10 04:50:16,750 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 6631 transitions. Word has length 32 [2018-11-10 04:50:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,750 INFO L481 AbstractCegarLoop]: Abstraction has 4169 states and 6631 transitions. [2018-11-10 04:50:16,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 6631 transitions. [2018-11-10 04:50:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 04:50:16,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,753 INFO L375 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] [2018-11-10 04:50:16,753 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1481801184, now seen corresponding path program 1 times [2018-11-10 04:50:16,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,771 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,771 INFO L87 Difference]: Start difference. First operand 4169 states and 6631 transitions. Second operand 3 states. [2018-11-10 04:50:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:16,840 INFO L93 Difference]: Finished difference Result 9869 states and 15785 transitions. [2018-11-10 04:50:16,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:16,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 04:50:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:16,855 INFO L225 Difference]: With dead ends: 9869 [2018-11-10 04:50:16,855 INFO L226 Difference]: Without dead ends: 5771 [2018-11-10 04:50:16,861 INFO L605 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 [2018-11-10 04:50:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2018-11-10 04:50:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5769. [2018-11-10 04:50:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-10 04:50:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 9159 transitions. [2018-11-10 04:50:16,946 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 9159 transitions. Word has length 32 [2018-11-10 04:50:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:16,946 INFO L481 AbstractCegarLoop]: Abstraction has 5769 states and 9159 transitions. [2018-11-10 04:50:16,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 9159 transitions. [2018-11-10 04:50:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 04:50:16,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:16,949 INFO L375 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] [2018-11-10 04:50:16,949 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:16,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:16,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1297006195, now seen corresponding path program 1 times [2018-11-10 04:50:16,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:16,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:16,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:16,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:16,975 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:16,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:16,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:16,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:16,976 INFO L87 Difference]: Start difference. First operand 5769 states and 9159 transitions. Second operand 3 states. [2018-11-10 04:50:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:17,033 INFO L93 Difference]: Finished difference Result 8653 states and 13705 transitions. [2018-11-10 04:50:17,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:17,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 04:50:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:17,041 INFO L225 Difference]: With dead ends: 8653 [2018-11-10 04:50:17,041 INFO L226 Difference]: Without dead ends: 5835 [2018-11-10 04:50:17,045 INFO L605 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 [2018-11-10 04:50:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2018-11-10 04:50:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5833. [2018-11-10 04:50:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5833 states. [2018-11-10 04:50:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 9159 transitions. [2018-11-10 04:50:17,128 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 9159 transitions. Word has length 33 [2018-11-10 04:50:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:17,128 INFO L481 AbstractCegarLoop]: Abstraction has 5833 states and 9159 transitions. [2018-11-10 04:50:17,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 9159 transitions. [2018-11-10 04:50:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 04:50:17,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:17,131 INFO L375 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] [2018-11-10 04:50:17,131 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:17,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1309017359, now seen corresponding path program 1 times [2018-11-10 04:50:17,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:17,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:17,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:17,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:17,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:17,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:17,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:17,151 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:17,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:17,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:17,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:17,151 INFO L87 Difference]: Start difference. First operand 5833 states and 9159 transitions. Second operand 3 states. [2018-11-10 04:50:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:17,252 INFO L93 Difference]: Finished difference Result 10509 states and 16841 transitions. [2018-11-10 04:50:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:17,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 04:50:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:17,266 INFO L225 Difference]: With dead ends: 10509 [2018-11-10 04:50:17,266 INFO L226 Difference]: Without dead ends: 10507 [2018-11-10 04:50:17,269 INFO L605 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 [2018-11-10 04:50:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2018-11-10 04:50:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 8329. [2018-11-10 04:50:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-11-10 04:50:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 12743 transitions. [2018-11-10 04:50:17,450 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 12743 transitions. Word has length 33 [2018-11-10 04:50:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:17,450 INFO L481 AbstractCegarLoop]: Abstraction has 8329 states and 12743 transitions. [2018-11-10 04:50:17,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 12743 transitions. [2018-11-10 04:50:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 04:50:17,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:17,458 INFO L375 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] [2018-11-10 04:50:17,458 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:17,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash -685127347, now seen corresponding path program 1 times [2018-11-10 04:50:17,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:17,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:17,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:17,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:17,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:17,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:17,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:17,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:17,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:17,484 INFO L87 Difference]: Start difference. First operand 8329 states and 12743 transitions. Second operand 3 states. [2018-11-10 04:50:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:17,641 INFO L93 Difference]: Finished difference Result 19597 states and 30153 transitions. [2018-11-10 04:50:17,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:17,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 04:50:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:17,660 INFO L225 Difference]: With dead ends: 19597 [2018-11-10 04:50:17,660 INFO L226 Difference]: Without dead ends: 11403 [2018-11-10 04:50:17,672 INFO L605 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 [2018-11-10 04:50:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11403 states. [2018-11-10 04:50:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11403 to 11401. [2018-11-10 04:50:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2018-11-10 04:50:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 17415 transitions. [2018-11-10 04:50:17,899 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 17415 transitions. Word has length 33 [2018-11-10 04:50:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:17,899 INFO L481 AbstractCegarLoop]: Abstraction has 11401 states and 17415 transitions. [2018-11-10 04:50:17,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 17415 transitions. [2018-11-10 04:50:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 04:50:17,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:17,907 INFO L375 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] [2018-11-10 04:50:17,907 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:17,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:17,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1925046613, now seen corresponding path program 1 times [2018-11-10 04:50:17,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:17,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:17,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:17,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:17,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:17,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:17,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:17,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:17,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:17,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:17,924 INFO L87 Difference]: Start difference. First operand 11401 states and 17415 transitions. Second operand 3 states. [2018-11-10 04:50:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:18,053 INFO L93 Difference]: Finished difference Result 17101 states and 26057 transitions. [2018-11-10 04:50:18,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:18,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 04:50:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:18,069 INFO L225 Difference]: With dead ends: 17101 [2018-11-10 04:50:18,070 INFO L226 Difference]: Without dead ends: 11531 [2018-11-10 04:50:18,078 INFO L605 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 [2018-11-10 04:50:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11531 states. [2018-11-10 04:50:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11531 to 11529. [2018-11-10 04:50:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-11-10 04:50:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17415 transitions. [2018-11-10 04:50:18,300 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17415 transitions. Word has length 34 [2018-11-10 04:50:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:18,301 INFO L481 AbstractCegarLoop]: Abstraction has 11529 states and 17415 transitions. [2018-11-10 04:50:18,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17415 transitions. [2018-11-10 04:50:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 04:50:18,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:18,310 INFO L375 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] [2018-11-10 04:50:18,310 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:18,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash 236102871, now seen corresponding path program 1 times [2018-11-10 04:50:18,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:18,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:18,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:18,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:18,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:18,328 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:18,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:18,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:18,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:18,328 INFO L87 Difference]: Start difference. First operand 11529 states and 17415 transitions. Second operand 3 states. [2018-11-10 04:50:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:18,603 INFO L93 Difference]: Finished difference Result 20493 states and 31625 transitions. [2018-11-10 04:50:18,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:18,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 04:50:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:18,630 INFO L225 Difference]: With dead ends: 20493 [2018-11-10 04:50:18,630 INFO L226 Difference]: Without dead ends: 20491 [2018-11-10 04:50:18,633 INFO L605 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 [2018-11-10 04:50:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2018-11-10 04:50:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 16649. [2018-11-10 04:50:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-11-10 04:50:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 24455 transitions. [2018-11-10 04:50:18,913 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 24455 transitions. Word has length 34 [2018-11-10 04:50:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:18,913 INFO L481 AbstractCegarLoop]: Abstraction has 16649 states and 24455 transitions. [2018-11-10 04:50:18,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 24455 transitions. [2018-11-10 04:50:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 04:50:18,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:18,928 INFO L375 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] [2018-11-10 04:50:18,928 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:18,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1758041835, now seen corresponding path program 1 times [2018-11-10 04:50:18,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:18,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:18,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:18,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:18,951 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:18,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:18,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:18,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:18,952 INFO L87 Difference]: Start difference. First operand 16649 states and 24455 transitions. Second operand 3 states. [2018-11-10 04:50:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:19,196 INFO L93 Difference]: Finished difference Result 38925 states and 57481 transitions. [2018-11-10 04:50:19,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:19,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 04:50:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:19,229 INFO L225 Difference]: With dead ends: 38925 [2018-11-10 04:50:19,229 INFO L226 Difference]: Without dead ends: 22539 [2018-11-10 04:50:19,250 INFO L605 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 [2018-11-10 04:50:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22539 states. [2018-11-10 04:50:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22539 to 22537. [2018-11-10 04:50:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22537 states. [2018-11-10 04:50:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 33031 transitions. [2018-11-10 04:50:19,686 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 33031 transitions. Word has length 34 [2018-11-10 04:50:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:19,686 INFO L481 AbstractCegarLoop]: Abstraction has 22537 states and 33031 transitions. [2018-11-10 04:50:19,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 33031 transitions. [2018-11-10 04:50:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 04:50:19,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:19,702 INFO L375 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] [2018-11-10 04:50:19,703 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:19,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1270531102, now seen corresponding path program 1 times [2018-11-10 04:50:19,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:19,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:19,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:19,704 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:19,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:19,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:19,721 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:19,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:19,721 INFO L87 Difference]: Start difference. First operand 22537 states and 33031 transitions. Second operand 3 states. [2018-11-10 04:50:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:19,948 INFO L93 Difference]: Finished difference Result 33805 states and 49417 transitions. [2018-11-10 04:50:19,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:19,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 04:50:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:19,975 INFO L225 Difference]: With dead ends: 33805 [2018-11-10 04:50:19,975 INFO L226 Difference]: Without dead ends: 22795 [2018-11-10 04:50:19,989 INFO L605 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 [2018-11-10 04:50:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22795 states. [2018-11-10 04:50:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22795 to 22793. [2018-11-10 04:50:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22793 states. [2018-11-10 04:50:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22793 states to 22793 states and 33031 transitions. [2018-11-10 04:50:20,297 INFO L78 Accepts]: Start accepts. Automaton has 22793 states and 33031 transitions. Word has length 35 [2018-11-10 04:50:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:20,297 INFO L481 AbstractCegarLoop]: Abstraction has 22793 states and 33031 transitions. [2018-11-10 04:50:20,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 22793 states and 33031 transitions. [2018-11-10 04:50:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 04:50:20,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:20,308 INFO L375 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] [2018-11-10 04:50:20,308 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:20,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:20,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1335492452, now seen corresponding path program 1 times [2018-11-10 04:50:20,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:20,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:20,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:20,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:20,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:20,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:20,323 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:20,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:20,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:20,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:20,324 INFO L87 Difference]: Start difference. First operand 22793 states and 33031 transitions. Second operand 3 states. [2018-11-10 04:50:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:20,651 INFO L93 Difference]: Finished difference Result 39949 states and 59145 transitions. [2018-11-10 04:50:20,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:20,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 04:50:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:20,763 INFO L225 Difference]: With dead ends: 39949 [2018-11-10 04:50:20,763 INFO L226 Difference]: Without dead ends: 39947 [2018-11-10 04:50:20,766 INFO L605 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 [2018-11-10 04:50:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39947 states. [2018-11-10 04:50:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39947 to 33289. [2018-11-10 04:50:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33289 states. [2018-11-10 04:50:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33289 states to 33289 states and 46855 transitions. [2018-11-10 04:50:21,126 INFO L78 Accepts]: Start accepts. Automaton has 33289 states and 46855 transitions. Word has length 35 [2018-11-10 04:50:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:21,126 INFO L481 AbstractCegarLoop]: Abstraction has 33289 states and 46855 transitions. [2018-11-10 04:50:21,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 33289 states and 46855 transitions. [2018-11-10 04:50:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 04:50:21,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:21,139 INFO L375 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] [2018-11-10 04:50:21,139 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:21,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash -658652254, now seen corresponding path program 1 times [2018-11-10 04:50:21,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:21,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:21,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:21,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:21,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:21,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:21,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:21,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:21,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:21,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:21,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:21,170 INFO L87 Difference]: Start difference. First operand 33289 states and 46855 transitions. Second operand 3 states. [2018-11-10 04:50:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:21,498 INFO L93 Difference]: Finished difference Result 77325 states and 109321 transitions. [2018-11-10 04:50:21,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:21,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 04:50:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:21,531 INFO L225 Difference]: With dead ends: 77325 [2018-11-10 04:50:21,531 INFO L226 Difference]: Without dead ends: 44555 [2018-11-10 04:50:21,554 INFO L605 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 [2018-11-10 04:50:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44555 states. [2018-11-10 04:50:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44555 to 44553. [2018-11-10 04:50:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44553 states. [2018-11-10 04:50:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44553 states to 44553 states and 62471 transitions. [2018-11-10 04:50:22,201 INFO L78 Accepts]: Start accepts. Automaton has 44553 states and 62471 transitions. Word has length 35 [2018-11-10 04:50:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:22,201 INFO L481 AbstractCegarLoop]: Abstraction has 44553 states and 62471 transitions. [2018-11-10 04:50:22,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 44553 states and 62471 transitions. [2018-11-10 04:50:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:50:22,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:22,216 INFO L375 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] [2018-11-10 04:50:22,216 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:22,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1549192118, now seen corresponding path program 1 times [2018-11-10 04:50:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:22,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:22,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:22,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:22,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:22,243 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:22,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:22,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:22,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:22,243 INFO L87 Difference]: Start difference. First operand 44553 states and 62471 transitions. Second operand 3 states. [2018-11-10 04:50:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:22,576 INFO L93 Difference]: Finished difference Result 66829 states and 93449 transitions. [2018-11-10 04:50:22,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:22,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 04:50:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:22,622 INFO L225 Difference]: With dead ends: 66829 [2018-11-10 04:50:22,622 INFO L226 Difference]: Without dead ends: 45067 [2018-11-10 04:50:22,648 INFO L605 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 [2018-11-10 04:50:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45067 states. [2018-11-10 04:50:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45067 to 45065. [2018-11-10 04:50:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45065 states. [2018-11-10 04:50:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45065 states to 45065 states and 62471 transitions. [2018-11-10 04:50:23,619 INFO L78 Accepts]: Start accepts. Automaton has 45065 states and 62471 transitions. Word has length 36 [2018-11-10 04:50:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:23,619 INFO L481 AbstractCegarLoop]: Abstraction has 45065 states and 62471 transitions. [2018-11-10 04:50:23,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45065 states and 62471 transitions. [2018-11-10 04:50:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:50:23,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:23,632 INFO L375 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] [2018-11-10 04:50:23,632 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:23,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1056831436, now seen corresponding path program 1 times [2018-11-10 04:50:23,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:23,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:23,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:23,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:23,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:23,659 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:23,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:23,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:23,660 INFO L87 Difference]: Start difference. First operand 45065 states and 62471 transitions. Second operand 3 states. [2018-11-10 04:50:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:24,152 INFO L93 Difference]: Finished difference Result 77837 states and 110089 transitions. [2018-11-10 04:50:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:24,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 04:50:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:24,205 INFO L225 Difference]: With dead ends: 77837 [2018-11-10 04:50:24,205 INFO L226 Difference]: Without dead ends: 77835 [2018-11-10 04:50:24,218 INFO L605 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 [2018-11-10 04:50:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77835 states. [2018-11-10 04:50:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77835 to 66569. [2018-11-10 04:50:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66569 states. [2018-11-10 04:50:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66569 states to 66569 states and 89607 transitions. [2018-11-10 04:50:25,050 INFO L78 Accepts]: Start accepts. Automaton has 66569 states and 89607 transitions. Word has length 36 [2018-11-10 04:50:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:25,050 INFO L481 AbstractCegarLoop]: Abstraction has 66569 states and 89607 transitions. [2018-11-10 04:50:25,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 66569 states and 89607 transitions. [2018-11-10 04:50:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:50:25,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:25,074 INFO L375 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] [2018-11-10 04:50:25,074 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:25,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:25,075 INFO L82 PathProgramCache]: Analyzing trace with hash -937313270, now seen corresponding path program 1 times [2018-11-10 04:50:25,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:25,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:25,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:25,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:25,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:25,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:25,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:25,104 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:25,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:25,104 INFO L87 Difference]: Start difference. First operand 66569 states and 89607 transitions. Second operand 3 states. [2018-11-10 04:50:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:25,731 INFO L93 Difference]: Finished difference Result 153613 states and 207369 transitions. [2018-11-10 04:50:25,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:25,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 04:50:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:25,794 INFO L225 Difference]: With dead ends: 153613 [2018-11-10 04:50:25,794 INFO L226 Difference]: Without dead ends: 88075 [2018-11-10 04:50:25,838 INFO L605 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 [2018-11-10 04:50:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88075 states. [2018-11-10 04:50:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88075 to 88073. [2018-11-10 04:50:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88073 states. [2018-11-10 04:50:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88073 states to 88073 states and 117767 transitions. [2018-11-10 04:50:27,201 INFO L78 Accepts]: Start accepts. Automaton has 88073 states and 117767 transitions. Word has length 36 [2018-11-10 04:50:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:27,201 INFO L481 AbstractCegarLoop]: Abstraction has 88073 states and 117767 transitions. [2018-11-10 04:50:27,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 88073 states and 117767 transitions. [2018-11-10 04:50:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 04:50:27,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:27,228 INFO L375 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] [2018-11-10 04:50:27,228 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:27,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1597748681, now seen corresponding path program 1 times [2018-11-10 04:50:27,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:27,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:27,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:27,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:27,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:27,259 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:27,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:27,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:27,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:27,260 INFO L87 Difference]: Start difference. First operand 88073 states and 117767 transitions. Second operand 3 states. [2018-11-10 04:50:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:27,913 INFO L93 Difference]: Finished difference Result 132109 states and 176137 transitions. [2018-11-10 04:50:27,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:27,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 04:50:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:27,978 INFO L225 Difference]: With dead ends: 132109 [2018-11-10 04:50:27,978 INFO L226 Difference]: Without dead ends: 89099 [2018-11-10 04:50:28,007 INFO L605 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 [2018-11-10 04:50:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89099 states. [2018-11-10 04:50:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89099 to 89097. [2018-11-10 04:50:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89097 states. [2018-11-10 04:50:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89097 states to 89097 states and 117767 transitions. [2018-11-10 04:50:29,355 INFO L78 Accepts]: Start accepts. Automaton has 89097 states and 117767 transitions. Word has length 37 [2018-11-10 04:50:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:29,356 INFO L481 AbstractCegarLoop]: Abstraction has 89097 states and 117767 transitions. [2018-11-10 04:50:29,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 89097 states and 117767 transitions. [2018-11-10 04:50:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 04:50:29,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:29,382 INFO L375 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] [2018-11-10 04:50:29,382 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:29,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1008274873, now seen corresponding path program 1 times [2018-11-10 04:50:29,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:29,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:29,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:29,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:29,383 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:29,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:29,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:29,416 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:29,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:29,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:29,416 INFO L87 Difference]: Start difference. First operand 89097 states and 117767 transitions. Second operand 3 states. [2018-11-10 04:50:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:30,419 INFO L93 Difference]: Finished difference Result 151565 states and 203785 transitions. [2018-11-10 04:50:30,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:30,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 04:50:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:30,549 INFO L225 Difference]: With dead ends: 151565 [2018-11-10 04:50:30,549 INFO L226 Difference]: Without dead ends: 151563 [2018-11-10 04:50:30,579 INFO L605 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 [2018-11-10 04:50:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-11-10 04:50:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 133129. [2018-11-10 04:50:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133129 states. [2018-11-10 04:50:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133129 states to 133129 states and 171015 transitions. [2018-11-10 04:50:33,178 INFO L78 Accepts]: Start accepts. Automaton has 133129 states and 171015 transitions. Word has length 37 [2018-11-10 04:50:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:33,178 INFO L481 AbstractCegarLoop]: Abstraction has 133129 states and 171015 transitions. [2018-11-10 04:50:33,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 133129 states and 171015 transitions. [2018-11-10 04:50:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 04:50:33,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:33,232 INFO L375 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] [2018-11-10 04:50:33,232 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:33,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash -985869833, now seen corresponding path program 1 times [2018-11-10 04:50:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:33,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:33,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:33,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:33,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:33,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:33,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:33,259 INFO L87 Difference]: Start difference. First operand 133129 states and 171015 transitions. Second operand 3 states. [2018-11-10 04:50:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:34,828 INFO L93 Difference]: Finished difference Result 305165 states and 392201 transitions. [2018-11-10 04:50:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:34,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 04:50:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:34,949 INFO L225 Difference]: With dead ends: 305165 [2018-11-10 04:50:34,949 INFO L226 Difference]: Without dead ends: 174091 [2018-11-10 04:50:35,012 INFO L605 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 [2018-11-10 04:50:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174091 states. [2018-11-10 04:50:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174091 to 174089. [2018-11-10 04:50:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174089 states. [2018-11-10 04:50:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174089 states to 174089 states and 221191 transitions. [2018-11-10 04:50:37,540 INFO L78 Accepts]: Start accepts. Automaton has 174089 states and 221191 transitions. Word has length 37 [2018-11-10 04:50:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:37,541 INFO L481 AbstractCegarLoop]: Abstraction has 174089 states and 221191 transitions. [2018-11-10 04:50:37,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 174089 states and 221191 transitions. [2018-11-10 04:50:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 04:50:37,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:37,599 INFO L375 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] [2018-11-10 04:50:37,599 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:37,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:37,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1191965503, now seen corresponding path program 1 times [2018-11-10 04:50:37,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:37,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:37,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:37,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:37,631 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:37,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:37,632 INFO L87 Difference]: Start difference. First operand 174089 states and 221191 transitions. Second operand 3 states. [2018-11-10 04:50:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:38,948 INFO L93 Difference]: Finished difference Result 261133 states and 330761 transitions. [2018-11-10 04:50:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:38,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 04:50:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:39,096 INFO L225 Difference]: With dead ends: 261133 [2018-11-10 04:50:39,096 INFO L226 Difference]: Without dead ends: 176139 [2018-11-10 04:50:39,162 INFO L605 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 [2018-11-10 04:50:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176139 states. [2018-11-10 04:50:41,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176139 to 176137. [2018-11-10 04:50:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176137 states. [2018-11-10 04:50:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176137 states to 176137 states and 221191 transitions. [2018-11-10 04:50:41,648 INFO L78 Accepts]: Start accepts. Automaton has 176137 states and 221191 transitions. Word has length 38 [2018-11-10 04:50:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:41,648 INFO L481 AbstractCegarLoop]: Abstraction has 176137 states and 221191 transitions. [2018-11-10 04:50:41,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 176137 states and 221191 transitions. [2018-11-10 04:50:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 04:50:41,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:41,706 INFO L375 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] [2018-11-10 04:50:41,707 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:41,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash -496978239, now seen corresponding path program 1 times [2018-11-10 04:50:41,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:41,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:41,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:41,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:41,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:41,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:41,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:41,735 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:41,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:41,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:41,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:41,735 INFO L87 Difference]: Start difference. First operand 176137 states and 221191 transitions. Second operand 3 states. [2018-11-10 04:50:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:44,310 INFO L93 Difference]: Finished difference Result 516109 states and 638985 transitions. [2018-11-10 04:50:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:44,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 04:50:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:44,601 INFO L225 Difference]: With dead ends: 516109 [2018-11-10 04:50:44,602 INFO L226 Difference]: Without dead ends: 344075 [2018-11-10 04:50:44,726 INFO L605 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 [2018-11-10 04:50:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344075 states. [2018-11-10 04:50:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344075 to 344073. [2018-11-10 04:50:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344073 states. [2018-11-10 04:50:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344073 states to 344073 states and 417799 transitions. [2018-11-10 04:50:52,751 INFO L78 Accepts]: Start accepts. Automaton has 344073 states and 417799 transitions. Word has length 38 [2018-11-10 04:50:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:50:52,752 INFO L481 AbstractCegarLoop]: Abstraction has 344073 states and 417799 transitions. [2018-11-10 04:50:52,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:50:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 344073 states and 417799 transitions. [2018-11-10 04:50:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 04:50:52,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:50:52,870 INFO L375 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] [2018-11-10 04:50:52,870 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:50:52,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:50:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1497166467, now seen corresponding path program 1 times [2018-11-10 04:50:52,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:50:52,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:52,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:50:52,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:50:52,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:50:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:50:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:50:52,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:50:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:50:52,903 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:50:52,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:50:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:50:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:50:52,903 INFO L87 Difference]: Start difference. First operand 344073 states and 417799 transitions. Second operand 3 states. [2018-11-10 04:50:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:50:56,378 INFO L93 Difference]: Finished difference Result 372749 states and 462857 transitions. [2018-11-10 04:50:56,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:50:56,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 04:50:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:50:56,654 INFO L225 Difference]: With dead ends: 372749 [2018-11-10 04:50:56,655 INFO L226 Difference]: Without dead ends: 372747 [2018-11-10 04:50:56,693 INFO L605 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 [2018-11-10 04:50:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372747 states. [2018-11-10 04:51:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372747 to 344073. [2018-11-10 04:51:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344073 states. [2018-11-10 04:51:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344073 states to 344073 states and 413703 transitions. [2018-11-10 04:51:01,294 INFO L78 Accepts]: Start accepts. Automaton has 344073 states and 413703 transitions. Word has length 38 [2018-11-10 04:51:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:51:01,294 INFO L481 AbstractCegarLoop]: Abstraction has 344073 states and 413703 transitions. [2018-11-10 04:51:01,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:51:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 344073 states and 413703 transitions. [2018-11-10 04:51:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 04:51:01,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:51:01,425 INFO L375 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] [2018-11-10 04:51:01,425 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:51:01,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:51:01,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1773759628, now seen corresponding path program 1 times [2018-11-10 04:51:01,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:51:01,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:51:01,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:51:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:51:01,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:51:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:01,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:51:01,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:51:01,460 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:51:01,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:51:01,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:51:01,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:51:01,460 INFO L87 Difference]: Start difference. First operand 344073 states and 413703 transitions. Second operand 3 states. [2018-11-10 04:51:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:51:06,452 INFO L93 Difference]: Finished difference Result 569357 states and 688137 transitions. [2018-11-10 04:51:06,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:51:06,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-10 04:51:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:51:06,881 INFO L225 Difference]: With dead ends: 569357 [2018-11-10 04:51:06,881 INFO L226 Difference]: Without dead ends: 569355 [2018-11-10 04:51:06,942 INFO L605 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 [2018-11-10 04:51:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569355 states. [2018-11-10 04:51:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569355 to 528393. [2018-11-10 04:51:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528393 states. [2018-11-10 04:51:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528393 states to 528393 states and 622599 transitions. [2018-11-10 04:51:16,069 INFO L78 Accepts]: Start accepts. Automaton has 528393 states and 622599 transitions. Word has length 39 [2018-11-10 04:51:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:51:16,069 INFO L481 AbstractCegarLoop]: Abstraction has 528393 states and 622599 transitions. [2018-11-10 04:51:16,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:51:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 528393 states and 622599 transitions. [2018-11-10 04:51:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 04:51:16,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:51:16,333 INFO L375 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] [2018-11-10 04:51:16,333 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:51:16,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:51:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash -220385078, now seen corresponding path program 1 times [2018-11-10 04:51:16,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:51:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:51:16,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:51:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:51:16,335 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:51:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:16,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:51:16,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:51:16,371 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:51:16,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:51:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:51:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:51:16,372 INFO L87 Difference]: Start difference. First operand 528393 states and 622599 transitions. Second operand 3 states. [2018-11-10 04:51:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:51:23,237 INFO L93 Difference]: Finished difference Result 1200141 states and 1409033 transitions. [2018-11-10 04:51:23,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:51:23,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-10 04:51:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:51:23,728 INFO L225 Difference]: With dead ends: 1200141 [2018-11-10 04:51:23,728 INFO L226 Difference]: Without dead ends: 675851 [2018-11-10 04:51:23,969 INFO L605 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 [2018-11-10 04:51:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675851 states. [2018-11-10 04:51:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675851 to 675849. [2018-11-10 04:51:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675849 states. [2018-11-10 04:51:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675849 states to 675849 states and 778247 transitions. [2018-11-10 04:51:38,453 INFO L78 Accepts]: Start accepts. Automaton has 675849 states and 778247 transitions. Word has length 39 [2018-11-10 04:51:38,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:51:38,453 INFO L481 AbstractCegarLoop]: Abstraction has 675849 states and 778247 transitions. [2018-11-10 04:51:38,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:51:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 675849 states and 778247 transitions. [2018-11-10 04:51:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 04:51:38,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:51:38,737 INFO L375 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] [2018-11-10 04:51:38,737 INFO L424 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:51:38,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:51:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash -847810186, now seen corresponding path program 1 times [2018-11-10 04:51:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:51:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:51:38,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:51:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:51:38,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:51:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:38,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:51:38,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:51:38,755 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:51:38,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:51:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:51:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:51:38,755 INFO L87 Difference]: Start difference. First operand 675849 states and 778247 transitions. Second operand 3 states. [2018-11-10 04:51:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:51:45,462 INFO L93 Difference]: Finished difference Result 1019917 states and 1175561 transitions. [2018-11-10 04:51:45,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:51:45,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 04:51:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:51:46,013 INFO L225 Difference]: With dead ends: 1019917 [2018-11-10 04:51:46,013 INFO L226 Difference]: Without dead ends: 688139 [2018-11-10 04:51:46,202 INFO L605 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 [2018-11-10 04:51:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688139 states. [2018-11-10 04:52:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688139 to 688137. [2018-11-10 04:52:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688137 states. [2018-11-10 04:52:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688137 states to 688137 states and 786439 transitions. [2018-11-10 04:52:03,026 INFO L78 Accepts]: Start accepts. Automaton has 688137 states and 786439 transitions. Word has length 40 [2018-11-10 04:52:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:52:03,027 INFO L481 AbstractCegarLoop]: Abstraction has 688137 states and 786439 transitions. [2018-11-10 04:52:03,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:52:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 688137 states and 786439 transitions. [2018-11-10 04:52:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 04:52:03,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:52:03,665 INFO L375 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] [2018-11-10 04:52:03,665 INFO L424 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:52:03,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1758213368, now seen corresponding path program 1 times [2018-11-10 04:52:03,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:52:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:03,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:52:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:03,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:52:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:52:03,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:52:03,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:52:03,699 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:52:03,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:52:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:52:03,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:52:03,700 INFO L87 Difference]: Start difference. First operand 688137 states and 786439 transitions. Second operand 3 states. [2018-11-10 04:52:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:52:14,094 INFO L93 Difference]: Finished difference Result 1114123 states and 1261576 transitions. [2018-11-10 04:52:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:52:14,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 04:52:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:52:14,980 INFO L225 Difference]: With dead ends: 1114123 [2018-11-10 04:52:14,980 INFO L226 Difference]: Without dead ends: 1114121 [2018-11-10 04:52:15,093 INFO L605 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 [2018-11-10 04:52:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114121 states. [2018-11-10 04:52:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114121 to 1064969. [2018-11-10 04:52:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064969 states. [2018-11-10 04:52:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064969 states to 1064969 states and 1196039 transitions. [2018-11-10 04:52:28,385 INFO L78 Accepts]: Start accepts. Automaton has 1064969 states and 1196039 transitions. Word has length 40 [2018-11-10 04:52:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:52:28,385 INFO L481 AbstractCegarLoop]: Abstraction has 1064969 states and 1196039 transitions. [2018-11-10 04:52:28,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:52:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1064969 states and 1196039 transitions. [2018-11-10 04:52:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 04:52:29,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:52:29,769 INFO L375 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] [2018-11-10 04:52:29,769 INFO L424 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:52:29,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash -235931338, now seen corresponding path program 1 times [2018-11-10 04:52:29,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:52:29,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:29,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:52:29,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:29,770 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:52:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:52:29,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:52:29,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:52:29,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:52:29,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:52:29,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:52:29,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:52:29,801 INFO L87 Difference]: Start difference. First operand 1064969 states and 1196039 transitions. Second operand 3 states. [2018-11-10 04:52:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:52:48,455 INFO L93 Difference]: Finished difference Result 2392073 states and 2654215 transitions. [2018-11-10 04:52:48,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:52:48,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 04:52:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:52:48,455 INFO L225 Difference]: With dead ends: 2392073 [2018-11-10 04:52:48,455 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:52:49,536 INFO L605 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 [2018-11-10 04:52:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:52:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:52:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:52:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:52:49,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-10 04:52:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:52:49,536 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:52:49,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:52:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:52:49,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:52:49,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 04:52:49,593 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 04:52:49,594 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-11-10 04:52:49,594 INFO L425 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L428 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L421 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,595 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L428 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 04:52:49,596 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 04:52:49,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:52:49 BoogieIcfgContainer [2018-11-10 04:52:49,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:52:49,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:52:49,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:52:49,604 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:52:49,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:50:15" (3/4) ... [2018-11-10 04:52:49,608 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:52:49,614 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:52:49,614 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:52:49,619 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 04:52:49,619 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 04:52:49,620 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 04:52:49,668 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_629bc12d-03ba-4d3e-a1d1-5cc0c896944a/bin-2019/utaipan/witness.graphml [2018-11-10 04:52:49,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:52:49,670 INFO L168 Benchmark]: Toolchain (without parser) took 155173.28 ms. Allocated memory was 1.0 GB in the beginning and 7.7 GB in the end (delta: 6.7 GB). Free memory was 954.8 MB in the beginning and 4.2 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-11-10 04:52:49,671 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:52:49,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.67 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 940.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:49,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.57 ms. Allocated memory is still 1.0 GB. Free memory is still 940.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:52:49,671 INFO L168 Benchmark]: Boogie Preprocessor took 22.48 ms. Allocated memory is still 1.0 GB. Free memory was 940.4 MB in the beginning and 937.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:49,672 INFO L168 Benchmark]: RCFGBuilder took 325.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:49,672 INFO L168 Benchmark]: TraceAbstraction took 154587.33 ms. Allocated memory was 1.2 GB in the beginning and 7.7 GB in the end (delta: 6.5 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-11-10 04:52:49,672 INFO L168 Benchmark]: Witness Printer took 64.37 ms. Allocated memory is still 7.7 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 296.7 kB). Peak memory consumption was 296.7 kB. Max. memory is 11.5 GB. [2018-11-10 04:52:49,673 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.67 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 940.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.57 ms. Allocated memory is still 1.0 GB. Free memory is still 940.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.48 ms. Allocated memory is still 1.0 GB. Free memory was 940.4 MB in the beginning and 937.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 154587.33 ms. Allocated memory was 1.2 GB in the beginning and 7.7 GB in the end (delta: 6.5 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 64.37 ms. Allocated memory is still 7.7 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 296.7 kB). Peak memory consumption was 296.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 60 locations, 1 error locations. SAFE Result, 154.5s OverallTime, 42 OverallIterations, 1 TraceHistogramMax, 68.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5286 SDtfs, 2640 SDslu, 3629 SDs, 0 SdLazy, 223 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064969occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 81.6s AutomataMinimizationTime, 42 MinimizatonAttempts, 163885 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1347 ConstructedInterpolants, 0 QuantifiedInterpolants, 91126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...