./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/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_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/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-635dfa2 [2018-12-03 05:48:05,041 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:48:05,042 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:48:05,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:48:05,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:48:05,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:48:05,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:48:05,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:48:05,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:48:05,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:48:05,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:48:05,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:48:05,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:48:05,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:48:05,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:48:05,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:48:05,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:48:05,058 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:48:05,060 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:48:05,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:48:05,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:48:05,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:48:05,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:48:05,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:48:05,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:48:05,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:48:05,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:48:05,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:48:05,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:48:05,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:48:05,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:48:05,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:48:05,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:48:05,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:48:05,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:48:05,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:48:05,070 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 05:48:05,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:48:05,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:48:05,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:48:05,081 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:48:05,081 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:48:05,081 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:48:05,081 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:48:05,081 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:48:05,082 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:48:05,082 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:48:05,082 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:48:05,082 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:48:05,082 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:48:05,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:48:05,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:48:05,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:48:05,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:48:05,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:48:05,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:48:05,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:48:05,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:48:05,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:48:05,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:48:05,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:48:05,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:48:05,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:48:05,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:48:05,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:48:05,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:48:05,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:48:05,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:48:05,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:48:05,085 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:48:05,085 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:48:05,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:48:05,085 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:48:05,085 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_fafa1a91-441b-4e8e-b0be-17517af3cfa9/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-12-03 05:48:05,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:48:05,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:48:05,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:48:05,116 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:48:05,116 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:48:05,117 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-03 05:48:05,156 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/data/e5eb3feb9/a28fd3b4e34c4955b77f3ed6ded39690/FLAGccb87bf7d [2018-12-03 05:48:05,601 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:48:05,602 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-03 05:48:05,606 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/data/e5eb3feb9/a28fd3b4e34c4955b77f3ed6ded39690/FLAGccb87bf7d [2018-12-03 05:48:05,615 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/data/e5eb3feb9/a28fd3b4e34c4955b77f3ed6ded39690 [2018-12-03 05:48:05,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:48:05,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:48:05,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:48:05,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:48:05,620 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:48:05,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05, skipping insertion in model container [2018-12-03 05:48:05,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:48:05,639 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:48:05,733 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:48:05,735 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:48:05,754 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:48:05,762 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:48:05,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05 WrapperNode [2018-12-03 05:48:05,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:48:05,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:48:05,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:48:05,763 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:48:05,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:48:05,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:48:05,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:48:05,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:48:05,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... [2018-12-03 05:48:05,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:48:05,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:48:05,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:48:05,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:48:05,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/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-12-03 05:48:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 05:48:05,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 05:48:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:48:05,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:48:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 05:48:05,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 05:48:06,041 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:48:06,041 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 05:48:06,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:48:06 BoogieIcfgContainer [2018-12-03 05:48:06,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:48:06,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:48:06,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:48:06,044 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:48:06,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:48:05" (1/3) ... [2018-12-03 05:48:06,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7614c415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:48:06, skipping insertion in model container [2018-12-03 05:48:06,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:48:05" (2/3) ... [2018-12-03 05:48:06,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7614c415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:48:06, skipping insertion in model container [2018-12-03 05:48:06,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:48:06" (3/3) ... [2018-12-03 05:48:06,046 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-03 05:48:06,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:48:06,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 05:48:06,064 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 05:48:06,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:48:06,083 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:48:06,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:48:06,083 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:48:06,083 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:48:06,083 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:48:06,083 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:48:06,083 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:48:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-03 05:48:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 05:48:06,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,097 INFO L402 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] [2018-12-03 05:48:06,098 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2018-12-03 05:48:06,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,219 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-12-03 05:48:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,248 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2018-12-03 05:48:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-03 05:48:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,256 INFO L225 Difference]: With dead ends: 117 [2018-12-03 05:48:06,256 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 05:48:06,258 INFO L631 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-12-03 05:48:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 05:48:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-12-03 05:48:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 05:48:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2018-12-03 05:48:06,285 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2018-12-03 05:48:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,286 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2018-12-03 05:48:06,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2018-12-03 05:48:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 05:48:06,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,287 INFO L402 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] [2018-12-03 05:48:06,287 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2018-12-03 05:48:06,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,340 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2018-12-03 05:48:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,355 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2018-12-03 05:48:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-03 05:48:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,356 INFO L225 Difference]: With dead ends: 167 [2018-12-03 05:48:06,357 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 05:48:06,357 INFO L631 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-12-03 05:48:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 05:48:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-12-03 05:48:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 05:48:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2018-12-03 05:48:06,363 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2018-12-03 05:48:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,363 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2018-12-03 05:48:06,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2018-12-03 05:48:06,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 05:48:06,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,364 INFO L402 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-12-03 05:48:06,364 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,364 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2018-12-03 05:48:06,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,390 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2018-12-03 05:48:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,401 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2018-12-03 05:48:06,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 05:48:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,402 INFO L225 Difference]: With dead ends: 153 [2018-12-03 05:48:06,402 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 05:48:06,402 INFO L631 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-12-03 05:48:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 05:48:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-03 05:48:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 05:48:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2018-12-03 05:48:06,407 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2018-12-03 05:48:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,407 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2018-12-03 05:48:06,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2018-12-03 05:48:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 05:48:06,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,408 INFO L402 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-12-03 05:48:06,408 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2018-12-03 05:48:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,437 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2018-12-03 05:48:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,452 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2018-12-03 05:48:06,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 05:48:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,453 INFO L225 Difference]: With dead ends: 196 [2018-12-03 05:48:06,453 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 05:48:06,453 INFO L631 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-12-03 05:48:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 05:48:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-12-03 05:48:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 05:48:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2018-12-03 05:48:06,459 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2018-12-03 05:48:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,459 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2018-12-03 05:48:06,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2018-12-03 05:48:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 05:48:06,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,459 INFO L402 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-12-03 05:48:06,460 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2018-12-03 05:48:06,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,483 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2018-12-03 05:48:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,495 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2018-12-03 05:48:06,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 05:48:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,496 INFO L225 Difference]: With dead ends: 324 [2018-12-03 05:48:06,496 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 05:48:06,497 INFO L631 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-12-03 05:48:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 05:48:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-12-03 05:48:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 05:48:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2018-12-03 05:48:06,506 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2018-12-03 05:48:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,506 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2018-12-03 05:48:06,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2018-12-03 05:48:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 05:48:06,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,507 INFO L402 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-12-03 05:48:06,507 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2018-12-03 05:48:06,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,531 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2018-12-03 05:48:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,541 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2018-12-03 05:48:06,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-03 05:48:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,542 INFO L225 Difference]: With dead ends: 291 [2018-12-03 05:48:06,542 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 05:48:06,543 INFO L631 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-12-03 05:48:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 05:48:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-12-03 05:48:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 05:48:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2018-12-03 05:48:06,552 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2018-12-03 05:48:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,552 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2018-12-03 05:48:06,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2018-12-03 05:48:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 05:48:06,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,553 INFO L402 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-12-03 05:48:06,553 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2018-12-03 05:48:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,574 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2018-12-03 05:48:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,587 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2018-12-03 05:48:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-03 05:48:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,589 INFO L225 Difference]: With dead ends: 372 [2018-12-03 05:48:06,589 INFO L226 Difference]: Without dead ends: 370 [2018-12-03 05:48:06,589 INFO L631 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-12-03 05:48:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-12-03 05:48:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-12-03 05:48:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-03 05:48:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2018-12-03 05:48:06,598 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2018-12-03 05:48:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,598 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2018-12-03 05:48:06,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2018-12-03 05:48:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 05:48:06,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,599 INFO L402 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-12-03 05:48:06,600 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2018-12-03 05:48:06,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,618 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2018-12-03 05:48:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,633 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2018-12-03 05:48:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-03 05:48:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,634 INFO L225 Difference]: With dead ends: 632 [2018-12-03 05:48:06,634 INFO L226 Difference]: Without dead ends: 378 [2018-12-03 05:48:06,635 INFO L631 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-12-03 05:48:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-03 05:48:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-12-03 05:48:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-03 05:48:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2018-12-03 05:48:06,644 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2018-12-03 05:48:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,645 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2018-12-03 05:48:06,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2018-12-03 05:48:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 05:48:06,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,646 INFO L402 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-12-03 05:48:06,646 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2018-12-03 05:48:06,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,663 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2018-12-03 05:48:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,674 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2018-12-03 05:48:06,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 05:48:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,676 INFO L225 Difference]: With dead ends: 564 [2018-12-03 05:48:06,676 INFO L226 Difference]: Without dead ends: 382 [2018-12-03 05:48:06,677 INFO L631 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-12-03 05:48:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-03 05:48:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-12-03 05:48:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-03 05:48:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2018-12-03 05:48:06,684 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2018-12-03 05:48:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,685 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2018-12-03 05:48:06,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2018-12-03 05:48:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 05:48:06,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,686 INFO L402 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-12-03 05:48:06,686 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,686 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2018-12-03 05:48:06,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,707 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2018-12-03 05:48:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,722 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2018-12-03 05:48:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 05:48:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,724 INFO L225 Difference]: With dead ends: 716 [2018-12-03 05:48:06,724 INFO L226 Difference]: Without dead ends: 714 [2018-12-03 05:48:06,725 INFO L631 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-12-03 05:48:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-03 05:48:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2018-12-03 05:48:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 05:48:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2018-12-03 05:48:06,738 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2018-12-03 05:48:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,738 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2018-12-03 05:48:06,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2018-12-03 05:48:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 05:48:06,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,740 INFO L402 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-12-03 05:48:06,740 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2018-12-03 05:48:06,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,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-12-03 05:48:06,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,756 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2018-12-03 05:48:06,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,771 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2018-12-03 05:48:06,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 05:48:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,773 INFO L225 Difference]: With dead ends: 1244 [2018-12-03 05:48:06,773 INFO L226 Difference]: Without dead ends: 738 [2018-12-03 05:48:06,774 INFO L631 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-12-03 05:48:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-03 05:48:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-12-03 05:48:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-03 05:48:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2018-12-03 05:48:06,786 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2018-12-03 05:48:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,787 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2018-12-03 05:48:06,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2018-12-03 05:48:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 05:48:06,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,787 INFO L402 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-12-03 05:48:06,788 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2018-12-03 05:48:06,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,800 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2018-12-03 05:48:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,821 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2018-12-03 05:48:06,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-03 05:48:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,824 INFO L225 Difference]: With dead ends: 1104 [2018-12-03 05:48:06,824 INFO L226 Difference]: Without dead ends: 746 [2018-12-03 05:48:06,825 INFO L631 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-12-03 05:48:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-03 05:48:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-12-03 05:48:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-03 05:48:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2018-12-03 05:48:06,847 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2018-12-03 05:48:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,847 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2018-12-03 05:48:06,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2018-12-03 05:48:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 05:48:06,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,848 INFO L402 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-12-03 05:48:06,849 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2018-12-03 05:48:06,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,868 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2018-12-03 05:48:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,895 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2018-12-03 05:48:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-03 05:48:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,899 INFO L225 Difference]: With dead ends: 1388 [2018-12-03 05:48:06,900 INFO L226 Difference]: Without dead ends: 1386 [2018-12-03 05:48:06,900 INFO L631 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-12-03 05:48:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-12-03 05:48:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2018-12-03 05:48:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-12-03 05:48:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2018-12-03 05:48:06,928 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2018-12-03 05:48:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:06,929 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2018-12-03 05:48:06,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2018-12-03 05:48:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 05:48:06,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:06,931 INFO L402 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-12-03 05:48:06,931 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:06,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2018-12-03 05:48:06,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:06,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:06,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:06,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:06,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:06,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:06,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:06,947 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2018-12-03 05:48:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:06,979 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2018-12-03 05:48:06,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:06,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-03 05:48:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:06,982 INFO L225 Difference]: With dead ends: 2460 [2018-12-03 05:48:06,982 INFO L226 Difference]: Without dead ends: 1450 [2018-12-03 05:48:06,984 INFO L631 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-12-03 05:48:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-12-03 05:48:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2018-12-03 05:48:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-12-03 05:48:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2018-12-03 05:48:07,010 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2018-12-03 05:48:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:07,010 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2018-12-03 05:48:07,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2018-12-03 05:48:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 05:48:07,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:07,011 INFO L402 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-12-03 05:48:07,011 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:07,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:07,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2018-12-03 05:48:07,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:07,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:07,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:07,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:07,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:07,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:07,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:07,031 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2018-12-03 05:48:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:07,059 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2018-12-03 05:48:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:07,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 05:48:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:07,064 INFO L225 Difference]: With dead ends: 2172 [2018-12-03 05:48:07,065 INFO L226 Difference]: Without dead ends: 1466 [2018-12-03 05:48:07,066 INFO L631 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-12-03 05:48:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-12-03 05:48:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2018-12-03 05:48:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-12-03 05:48:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2018-12-03 05:48:07,112 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2018-12-03 05:48:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:07,113 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2018-12-03 05:48:07,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2018-12-03 05:48:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 05:48:07,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:07,114 INFO L402 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-12-03 05:48:07,115 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:07,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2018-12-03 05:48:07,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:07,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:07,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:07,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:07,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:07,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:07,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:07,130 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2018-12-03 05:48:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:07,165 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2018-12-03 05:48:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:07,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 05:48:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:07,173 INFO L225 Difference]: With dead ends: 2700 [2018-12-03 05:48:07,173 INFO L226 Difference]: Without dead ends: 2698 [2018-12-03 05:48:07,174 INFO L631 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-12-03 05:48:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-12-03 05:48:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2018-12-03 05:48:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-12-03 05:48:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2018-12-03 05:48:07,222 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2018-12-03 05:48:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:07,223 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2018-12-03 05:48:07,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2018-12-03 05:48:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 05:48:07,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:07,225 INFO L402 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-12-03 05:48:07,225 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:07,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2018-12-03 05:48:07,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:07,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:07,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:07,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:07,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:07,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:07,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:07,242 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2018-12-03 05:48:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:07,295 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2018-12-03 05:48:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:07,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 05:48:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:07,303 INFO L225 Difference]: With dead ends: 4876 [2018-12-03 05:48:07,303 INFO L226 Difference]: Without dead ends: 2858 [2018-12-03 05:48:07,306 INFO L631 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-12-03 05:48:07,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-12-03 05:48:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2018-12-03 05:48:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-12-03 05:48:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2018-12-03 05:48:07,358 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2018-12-03 05:48:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:07,358 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2018-12-03 05:48:07,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2018-12-03 05:48:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 05:48:07,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:07,360 INFO L402 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-12-03 05:48:07,360 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:07,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:07,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2018-12-03 05:48:07,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:07,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:07,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:07,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:07,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:07,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:07,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:07,371 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2018-12-03 05:48:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:07,398 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2018-12-03 05:48:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:07,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 05:48:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:07,406 INFO L225 Difference]: With dead ends: 4284 [2018-12-03 05:48:07,406 INFO L226 Difference]: Without dead ends: 2890 [2018-12-03 05:48:07,409 INFO L631 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-12-03 05:48:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-12-03 05:48:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2018-12-03 05:48:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-12-03 05:48:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2018-12-03 05:48:07,450 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2018-12-03 05:48:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:07,450 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2018-12-03 05:48:07,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2018-12-03 05:48:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 05:48:07,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:07,452 INFO L402 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-12-03 05:48:07,452 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:07,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2018-12-03 05:48:07,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:07,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:07,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:07,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:07,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:07,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:07,465 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2018-12-03 05:48:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:07,505 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2018-12-03 05:48:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:07,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 05:48:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:07,515 INFO L225 Difference]: With dead ends: 5260 [2018-12-03 05:48:07,515 INFO L226 Difference]: Without dead ends: 5258 [2018-12-03 05:48:07,517 INFO L631 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-12-03 05:48:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-03 05:48:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2018-12-03 05:48:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-12-03 05:48:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2018-12-03 05:48:07,577 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2018-12-03 05:48:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:07,577 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2018-12-03 05:48:07,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2018-12-03 05:48:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 05:48:07,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:07,580 INFO L402 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-12-03 05:48:07,580 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:07,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2018-12-03 05:48:07,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:07,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:07,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:07,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:07,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:07,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:07,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:07,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:07,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:07,593 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2018-12-03 05:48:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:07,651 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2018-12-03 05:48:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:07,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-03 05:48:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:07,665 INFO L225 Difference]: With dead ends: 9676 [2018-12-03 05:48:07,666 INFO L226 Difference]: Without dead ends: 5642 [2018-12-03 05:48:07,670 INFO L631 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-12-03 05:48:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-12-03 05:48:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2018-12-03 05:48:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2018-12-03 05:48:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2018-12-03 05:48:07,757 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2018-12-03 05:48:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:07,757 INFO L480 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2018-12-03 05:48:07,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2018-12-03 05:48:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 05:48:07,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:07,760 INFO L402 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-12-03 05:48:07,760 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:07,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2018-12-03 05:48:07,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:07,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:07,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:07,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:07,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:07,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:07,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:07,778 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2018-12-03 05:48:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:07,824 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2018-12-03 05:48:07,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:07,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 05:48:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:07,831 INFO L225 Difference]: With dead ends: 8460 [2018-12-03 05:48:07,831 INFO L226 Difference]: Without dead ends: 5706 [2018-12-03 05:48:07,835 INFO L631 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-12-03 05:48:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2018-12-03 05:48:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2018-12-03 05:48:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-12-03 05:48:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2018-12-03 05:48:07,903 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2018-12-03 05:48:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:07,903 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2018-12-03 05:48:07,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2018-12-03 05:48:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 05:48:07,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:07,906 INFO L402 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-12-03 05:48:07,906 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:07,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2018-12-03 05:48:07,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:07,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:07,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-12-03 05:48:07,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:07,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:07,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:07,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:07,916 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2018-12-03 05:48:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:08,015 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2018-12-03 05:48:08,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:08,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 05:48:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:08,033 INFO L225 Difference]: With dead ends: 16716 [2018-12-03 05:48:08,033 INFO L226 Difference]: Without dead ends: 11146 [2018-12-03 05:48:08,042 INFO L631 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-12-03 05:48:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-12-03 05:48:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2018-12-03 05:48:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-03 05:48:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2018-12-03 05:48:08,186 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2018-12-03 05:48:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:08,186 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2018-12-03 05:48:08,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2018-12-03 05:48:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 05:48:08,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:08,192 INFO L402 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-12-03 05:48:08,193 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:08,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2018-12-03 05:48:08,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:08,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:08,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:08,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:08,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:08,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:08,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:08,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:08,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:08,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:08,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:08,204 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2018-12-03 05:48:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:08,331 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2018-12-03 05:48:08,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:08,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 05:48:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:08,352 INFO L225 Difference]: With dead ends: 13196 [2018-12-03 05:48:08,352 INFO L226 Difference]: Without dead ends: 13194 [2018-12-03 05:48:08,354 INFO L631 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-12-03 05:48:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2018-12-03 05:48:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2018-12-03 05:48:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-03 05:48:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2018-12-03 05:48:08,490 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2018-12-03 05:48:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:08,490 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2018-12-03 05:48:08,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2018-12-03 05:48:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 05:48:08,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:08,494 INFO L402 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-12-03 05:48:08,494 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:08,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2018-12-03 05:48:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:08,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:08,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:08,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:08,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:08,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:08,510 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2018-12-03 05:48:08,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:08,615 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2018-12-03 05:48:08,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:08,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-03 05:48:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:08,632 INFO L225 Difference]: With dead ends: 19852 [2018-12-03 05:48:08,632 INFO L226 Difference]: Without dead ends: 19850 [2018-12-03 05:48:08,636 INFO L631 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-12-03 05:48:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2018-12-03 05:48:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2018-12-03 05:48:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2018-12-03 05:48:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2018-12-03 05:48:08,812 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2018-12-03 05:48:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:08,813 INFO L480 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2018-12-03 05:48:08,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2018-12-03 05:48:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 05:48:08,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:08,819 INFO L402 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-12-03 05:48:08,819 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:08,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2018-12-03 05:48:08,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:08,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:08,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:08,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:08,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:08,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:08,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:08,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:08,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:08,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:08,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:08,834 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2018-12-03 05:48:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:08,974 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2018-12-03 05:48:08,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:08,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-03 05:48:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:08,992 INFO L225 Difference]: With dead ends: 38028 [2018-12-03 05:48:08,992 INFO L226 Difference]: Without dead ends: 21898 [2018-12-03 05:48:09,004 INFO L631 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-12-03 05:48:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2018-12-03 05:48:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2018-12-03 05:48:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2018-12-03 05:48:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2018-12-03 05:48:09,311 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2018-12-03 05:48:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:09,311 INFO L480 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2018-12-03 05:48:09,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2018-12-03 05:48:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 05:48:09,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:09,317 INFO L402 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-12-03 05:48:09,317 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:09,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2018-12-03 05:48:09,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:09,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:09,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:09,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-12-03 05:48:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:09,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:09,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:09,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:09,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:09,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:09,328 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2018-12-03 05:48:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:09,462 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2018-12-03 05:48:09,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:09,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 05:48:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:09,477 INFO L225 Difference]: With dead ends: 33036 [2018-12-03 05:48:09,477 INFO L226 Difference]: Without dead ends: 22282 [2018-12-03 05:48:09,485 INFO L631 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-12-03 05:48:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2018-12-03 05:48:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2018-12-03 05:48:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2018-12-03 05:48:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2018-12-03 05:48:09,713 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2018-12-03 05:48:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:09,713 INFO L480 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2018-12-03 05:48:09,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2018-12-03 05:48:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 05:48:09,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:09,720 INFO L402 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-12-03 05:48:09,720 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:09,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2018-12-03 05:48:09,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:09,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:09,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:09,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:09,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:09,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:09,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:09,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:09,737 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2018-12-03 05:48:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:09,987 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2018-12-03 05:48:09,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:09,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 05:48:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:10,006 INFO L225 Difference]: With dead ends: 38924 [2018-12-03 05:48:10,007 INFO L226 Difference]: Without dead ends: 38922 [2018-12-03 05:48:10,010 INFO L631 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-12-03 05:48:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2018-12-03 05:48:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2018-12-03 05:48:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2018-12-03 05:48:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2018-12-03 05:48:10,324 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2018-12-03 05:48:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:10,324 INFO L480 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2018-12-03 05:48:10,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2018-12-03 05:48:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 05:48:10,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:10,335 INFO L402 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-12-03 05:48:10,335 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:10,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:10,336 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2018-12-03 05:48:10,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:10,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:10,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:10,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:10,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:10,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:10,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:10,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:10,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:10,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:10,350 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2018-12-03 05:48:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:10,740 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2018-12-03 05:48:10,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:10,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 05:48:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:10,764 INFO L225 Difference]: With dead ends: 75788 [2018-12-03 05:48:10,764 INFO L226 Difference]: Without dead ends: 43530 [2018-12-03 05:48:10,780 INFO L631 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-12-03 05:48:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2018-12-03 05:48:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2018-12-03 05:48:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2018-12-03 05:48:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2018-12-03 05:48:11,210 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2018-12-03 05:48:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:11,210 INFO L480 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2018-12-03 05:48:11,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2018-12-03 05:48:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 05:48:11,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:11,221 INFO L402 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-12-03 05:48:11,221 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:11,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:11,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2018-12-03 05:48:11,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:11,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:11,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:11,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:11,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:11,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:11,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:11,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:11,241 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2018-12-03 05:48:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:11,573 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2018-12-03 05:48:11,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:11,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-03 05:48:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:11,605 INFO L225 Difference]: With dead ends: 65292 [2018-12-03 05:48:11,606 INFO L226 Difference]: Without dead ends: 44042 [2018-12-03 05:48:11,618 INFO L631 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-12-03 05:48:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2018-12-03 05:48:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2018-12-03 05:48:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2018-12-03 05:48:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2018-12-03 05:48:12,073 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2018-12-03 05:48:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:12,073 INFO L480 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2018-12-03 05:48:12,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2018-12-03 05:48:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 05:48:12,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:12,087 INFO L402 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-12-03 05:48:12,088 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:12,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2018-12-03 05:48:12,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:12,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:12,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:12,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:12,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:12,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:12,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:12,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:12,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:12,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:12,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:12,100 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2018-12-03 05:48:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:12,634 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2018-12-03 05:48:12,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:12,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-03 05:48:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:12,677 INFO L225 Difference]: With dead ends: 75788 [2018-12-03 05:48:12,677 INFO L226 Difference]: Without dead ends: 75786 [2018-12-03 05:48:12,683 INFO L631 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-12-03 05:48:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2018-12-03 05:48:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2018-12-03 05:48:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2018-12-03 05:48:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2018-12-03 05:48:13,308 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2018-12-03 05:48:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:13,308 INFO L480 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2018-12-03 05:48:13,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2018-12-03 05:48:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 05:48:13,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:13,331 INFO L402 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-12-03 05:48:13,331 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:13,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2018-12-03 05:48:13,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:13,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:13,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:13,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:13,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:13,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:13,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:13,341 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2018-12-03 05:48:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:13,994 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2018-12-03 05:48:13,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:13,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-03 05:48:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:14,055 INFO L225 Difference]: With dead ends: 150540 [2018-12-03 05:48:14,055 INFO L226 Difference]: Without dead ends: 86026 [2018-12-03 05:48:14,094 INFO L631 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-12-03 05:48:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2018-12-03 05:48:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2018-12-03 05:48:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2018-12-03 05:48:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2018-12-03 05:48:15,263 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2018-12-03 05:48:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:15,263 INFO L480 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2018-12-03 05:48:15,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2018-12-03 05:48:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 05:48:15,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:15,288 INFO L402 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-12-03 05:48:15,288 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:15,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2018-12-03 05:48:15,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:15,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:15,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:15,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:15,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:15,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:15,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:15,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:15,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:15,298 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2018-12-03 05:48:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:15,893 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2018-12-03 05:48:15,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:15,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 05:48:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:15,955 INFO L225 Difference]: With dead ends: 129036 [2018-12-03 05:48:15,956 INFO L226 Difference]: Without dead ends: 87050 [2018-12-03 05:48:15,985 INFO L631 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-12-03 05:48:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2018-12-03 05:48:17,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2018-12-03 05:48:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2018-12-03 05:48:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2018-12-03 05:48:17,114 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2018-12-03 05:48:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:17,115 INFO L480 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2018-12-03 05:48:17,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2018-12-03 05:48:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 05:48:17,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:17,140 INFO L402 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-12-03 05:48:17,140 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:17,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:17,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2018-12-03 05:48:17,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:17,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:17,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:17,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:17,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:17,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:17,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:17,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:17,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:17,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:17,162 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2018-12-03 05:48:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:18,163 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2018-12-03 05:48:18,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:18,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 05:48:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:18,274 INFO L225 Difference]: With dead ends: 147468 [2018-12-03 05:48:18,274 INFO L226 Difference]: Without dead ends: 147466 [2018-12-03 05:48:18,301 INFO L631 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-12-03 05:48:18,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-12-03 05:48:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2018-12-03 05:48:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2018-12-03 05:48:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2018-12-03 05:48:19,819 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2018-12-03 05:48:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:19,819 INFO L480 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2018-12-03 05:48:19,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2018-12-03 05:48:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 05:48:19,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:19,872 INFO L402 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-12-03 05:48:19,872 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:19,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2018-12-03 05:48:19,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:19,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:19,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:19,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:19,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:19,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:19,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:19,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:19,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:19,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:19,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:19,883 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2018-12-03 05:48:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:21,396 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2018-12-03 05:48:21,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:21,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 05:48:21,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:21,519 INFO L225 Difference]: With dead ends: 299020 [2018-12-03 05:48:21,519 INFO L226 Difference]: Without dead ends: 169994 [2018-12-03 05:48:21,580 INFO L631 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-12-03 05:48:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2018-12-03 05:48:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2018-12-03 05:48:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2018-12-03 05:48:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2018-12-03 05:48:23,569 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2018-12-03 05:48:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:23,569 INFO L480 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2018-12-03 05:48:23,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2018-12-03 05:48:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 05:48:23,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:23,623 INFO L402 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-12-03 05:48:23,623 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:23,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:23,623 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2018-12-03 05:48:23,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:23,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:23,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:23,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:23,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:23,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:23,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:23,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:23,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:23,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:23,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:23,633 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2018-12-03 05:48:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:25,074 INFO L93 Difference]: Finished difference Result 254988 states and 324616 transitions. [2018-12-03 05:48:25,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:25,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 05:48:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:25,201 INFO L225 Difference]: With dead ends: 254988 [2018-12-03 05:48:25,201 INFO L226 Difference]: Without dead ends: 172042 [2018-12-03 05:48:25,251 INFO L631 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-12-03 05:48:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2018-12-03 05:48:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2018-12-03 05:48:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2018-12-03 05:48:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2018-12-03 05:48:28,624 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2018-12-03 05:48:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:28,625 INFO L480 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2018-12-03 05:48:28,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2018-12-03 05:48:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 05:48:28,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:28,672 INFO L402 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-12-03 05:48:28,672 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:28,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2018-12-03 05:48:28,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:28,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:28,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:28,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:28,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:28,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:28,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:28,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:28,693 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2018-12-03 05:48:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:30,804 INFO L93 Difference]: Finished difference Result 286732 states and 366600 transitions. [2018-12-03 05:48:30,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:30,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 05:48:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:31,054 INFO L225 Difference]: With dead ends: 286732 [2018-12-03 05:48:31,054 INFO L226 Difference]: Without dead ends: 286730 [2018-12-03 05:48:31,115 INFO L631 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-12-03 05:48:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2018-12-03 05:48:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2018-12-03 05:48:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2018-12-03 05:48:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2018-12-03 05:48:33,916 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2018-12-03 05:48:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:33,916 INFO L480 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2018-12-03 05:48:33,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2018-12-03 05:48:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 05:48:34,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:34,022 INFO L402 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-12-03 05:48:34,022 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:34,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2018-12-03 05:48:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:34,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:34,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:34,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:34,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:34,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:34,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:34,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:34,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:34,047 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2018-12-03 05:48:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:37,009 INFO L93 Difference]: Finished difference Result 593932 states and 727048 transitions. [2018-12-03 05:48:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:37,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 05:48:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:37,266 INFO L225 Difference]: With dead ends: 593932 [2018-12-03 05:48:37,266 INFO L226 Difference]: Without dead ends: 335882 [2018-12-03 05:48:37,410 INFO L631 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-12-03 05:48:37,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2018-12-03 05:48:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2018-12-03 05:48:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2018-12-03 05:48:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2018-12-03 05:48:41,665 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2018-12-03 05:48:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:41,665 INFO L480 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2018-12-03 05:48:41,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2018-12-03 05:48:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 05:48:41,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:41,782 INFO L402 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-12-03 05:48:41,782 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:41,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:41,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2018-12-03 05:48:41,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:41,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:41,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:41,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:41,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:48:41,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:41,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:41,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:41,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:41,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:41,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:41,807 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2018-12-03 05:48:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:45,801 INFO L93 Difference]: Finished difference Result 503820 states and 606216 transitions. [2018-12-03 05:48:45,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:45,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 05:48:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:46,090 INFO L225 Difference]: With dead ends: 503820 [2018-12-03 05:48:46,090 INFO L226 Difference]: Without dead ends: 339978 [2018-12-03 05:48:46,183 INFO L631 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-12-03 05:48:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2018-12-03 05:48:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2018-12-03 05:48:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2018-12-03 05:48:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2018-12-03 05:48:50,348 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2018-12-03 05:48:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:48:50,348 INFO L480 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2018-12-03 05:48:50,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:48:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2018-12-03 05:48:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 05:48:50,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:48:50,468 INFO L402 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-12-03 05:48:50,468 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:48:50,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:48:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2018-12-03 05:48:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:48:50,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:50,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:48:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:48:50,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:48:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:48:50,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-12-03 05:48:50,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:48:50,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:48:50,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:48:50,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:48:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:48:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:48:50,484 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2018-12-03 05:48:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:48:55,501 INFO L93 Difference]: Finished difference Result 557068 states and 667656 transitions. [2018-12-03 05:48:55,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:48:55,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 05:48:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:48:55,983 INFO L225 Difference]: With dead ends: 557068 [2018-12-03 05:48:55,983 INFO L226 Difference]: Without dead ends: 557066 [2018-12-03 05:48:56,036 INFO L631 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-12-03 05:48:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2018-12-03 05:49:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2018-12-03 05:49:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2018-12-03 05:49:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2018-12-03 05:49:04,511 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2018-12-03 05:49:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:49:04,511 INFO L480 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2018-12-03 05:49:04,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:49:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2018-12-03 05:49:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 05:49:04,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:49:04,746 INFO L402 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-12-03 05:49:04,746 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:49:04,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:49:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2018-12-03 05:49:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:49:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:49:04,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:49:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:49:04,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:49:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:49:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:49:04,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:49:04,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:49:04,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:49:04,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:49:04,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:49:04,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:49:04,759 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2018-12-03 05:49:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:49:11,088 INFO L93 Difference]: Finished difference Result 1179660 states and 1363976 transitions. [2018-12-03 05:49:11,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:49:11,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 05:49:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:49:11,617 INFO L225 Difference]: With dead ends: 1179660 [2018-12-03 05:49:11,617 INFO L226 Difference]: Without dead ends: 663562 [2018-12-03 05:49:11,865 INFO L631 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-12-03 05:49:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2018-12-03 05:49:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2018-12-03 05:49:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2018-12-03 05:49:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2018-12-03 05:49:25,577 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2018-12-03 05:49:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:49:25,577 INFO L480 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2018-12-03 05:49:25,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:49:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2018-12-03 05:49:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 05:49:25,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:49:25,829 INFO L402 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-12-03 05:49:25,829 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:49:25,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:49:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2018-12-03 05:49:25,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:49:25,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:49:25,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:49:25,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:49:25,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:49:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:49:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:49:25,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:49:25,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:49:25,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:49:25,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:49:25,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:49:25,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:49:25,839 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2018-12-03 05:49:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:49:31,802 INFO L93 Difference]: Finished difference Result 995340 states and 1126408 transitions. [2018-12-03 05:49:31,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:49:31,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 05:49:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:49:32,416 INFO L225 Difference]: With dead ends: 995340 [2018-12-03 05:49:32,416 INFO L226 Difference]: Without dead ends: 671754 [2018-12-03 05:49:32,598 INFO L631 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-12-03 05:49:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2018-12-03 05:49:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2018-12-03 05:49:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2018-12-03 05:49:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2018-12-03 05:49:42,275 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2018-12-03 05:49:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:49:42,275 INFO L480 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2018-12-03 05:49:42,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:49:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2018-12-03 05:49:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 05:49:42,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:49:42,533 INFO L402 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-12-03 05:49:42,533 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:49:42,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:49:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2018-12-03 05:49:42,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:49:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:49:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:49:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:49:42,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:49:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:49:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:49:42,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:49:42,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:49:42,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:49:42,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:49:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:49:42,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:49:42,546 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2018-12-03 05:49:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:49:55,387 INFO L93 Difference]: Finished difference Result 1081354 states and 1204231 transitions. [2018-12-03 05:49:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:49:55,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 05:49:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:49:56,436 INFO L225 Difference]: With dead ends: 1081354 [2018-12-03 05:49:56,436 INFO L226 Difference]: Without dead ends: 1081352 [2018-12-03 05:49:56,525 INFO L631 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-12-03 05:49:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2018-12-03 05:50:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2018-12-03 05:50:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2018-12-03 05:50:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2018-12-03 05:50:08,388 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2018-12-03 05:50:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:50:08,388 INFO L480 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2018-12-03 05:50:08,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:50:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2018-12-03 05:50:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 05:50:08,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:50:08,834 INFO L402 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-12-03 05:50:08,834 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:50:08,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:50:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2018-12-03 05:50:08,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:50:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:50:08,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:50:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:50:08,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:50:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:50:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:50:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:50:08,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:50:08,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:50:08,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:50:08,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:50:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:50:08,847 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2018-12-03 05:50:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:50:25,298 INFO L93 Difference]: Finished difference Result 2342920 states and 2547718 transitions. [2018-12-03 05:50:25,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:50:25,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 05:50:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:50:25,299 INFO L225 Difference]: With dead ends: 2342920 [2018-12-03 05:50:25,299 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 05:50:25,931 INFO L631 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-12-03 05:50:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 05:50:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 05:50:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 05:50:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 05:50:25,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-03 05:50:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:50:25,931 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 05:50:25,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:50:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 05:50:25,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 05:50:25,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 05:50:25,986 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 05:50:25,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 05:50:25,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 05:50:25,986 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 05:50:25,986 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 05:50:25,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 05:50:25,986 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-12-03 05:50:25,986 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-03 05:50:25,986 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,986 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L451 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L444 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,987 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L451 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,988 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-03 05:50:25,989 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-12-03 05:50:25,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:50:25 BoogieIcfgContainer [2018-12-03 05:50:25,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 05:50:25,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 05:50:25,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 05:50:25,993 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 05:50:25,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:48:06" (3/4) ... [2018-12-03 05:50:25,996 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 05:50:26,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 05:50:26,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 05:50:26,003 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-03 05:50:26,003 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-03 05:50:26,004 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 05:50:26,045 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fafa1a91-441b-4e8e-b0be-17517af3cfa9/bin-2019/utaipan/witness.graphml [2018-12-03 05:50:26,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 05:50:26,046 INFO L168 Benchmark]: Toolchain (without parser) took 140428.76 ms. Allocated memory was 1.0 GB in the beginning and 8.3 GB in the end (delta: 7.3 GB). Free memory was 952.4 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-03 05:50:26,046 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:50:26,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.07 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-03 05:50:26,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.51 ms. Allocated memory is still 1.0 GB. Free memory was 941.6 MB in the beginning and 936.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 05:50:26,047 INFO L168 Benchmark]: Boogie Preprocessor took 48.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-03 05:50:26,047 INFO L168 Benchmark]: RCFGBuilder took 217.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:50:26,048 INFO L168 Benchmark]: TraceAbstraction took 139950.35 ms. Allocated memory was 1.1 GB in the beginning and 8.3 GB in the end (delta: 7.1 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-03 05:50:26,048 INFO L168 Benchmark]: Witness Printer took 52.35 ms. Allocated memory is still 8.3 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 620.7 kB). Peak memory consumption was 620.7 kB. Max. memory is 11.5 GB. [2018-12-03 05:50:26,049 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.07 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.51 ms. Allocated memory is still 1.0 GB. Free memory was 941.6 MB in the beginning and 936.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 217.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 139950.35 ms. Allocated memory was 1.1 GB in the beginning and 8.3 GB in the end (delta: 7.1 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 52.35 ms. Allocated memory is still 8.3 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 620.7 kB). Peak memory consumption was 620.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, 59 locations, 1 error locations. SAFE Result, 139.9s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 69.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5309 SDtfs, 2663 SDslu, 3669 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048584occurred in iteration=42, 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: 67.5s AutomataMinimizationTime, 43 MinimizatonAttempts, 131120 StatesRemovedByMinimization, 42 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.5s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 89720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...