./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11_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_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/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 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:08:39,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:08:39,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:08:39,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:08:39,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:08:39,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:08:39,033 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:08:39,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:08:39,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:08:39,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:08:39,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:08:39,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:08:39,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:08:39,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:08:39,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:08:39,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:08:39,038 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:08:39,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:08:39,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:08:39,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:08:39,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:08:39,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:08:39,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:08:39,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:08:39,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:08:39,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:08:39,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:08:39,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:08:39,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:08:39,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:08:39,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:08:39,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:08:39,045 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:08:39,045 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:08:39,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:08:39,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:08:39,046 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:08:39,053 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:08:39,053 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:08:39,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:08:39,054 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:08:39,054 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:08:39,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:08:39,055 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:08:39,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:08:39,056 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:08:39,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:08:39,057 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:08:39,057 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_2b83296e-805e-4724-8ee7-a4aa7028a79d/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-12-09 19:08:39,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:08:39,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:08:39,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:08:39,082 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:08:39,083 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:08:39,083 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:08:39,118 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/data/86544c6af/c4539e79e7f9499b9c2f4ba7d6d02239/FLAG3fe17d6fe [2018-12-09 19:08:39,477 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:08:39,478 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:08:39,483 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/data/86544c6af/c4539e79e7f9499b9c2f4ba7d6d02239/FLAG3fe17d6fe [2018-12-09 19:08:39,885 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/data/86544c6af/c4539e79e7f9499b9c2f4ba7d6d02239 [2018-12-09 19:08:39,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:08:39,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:08:39,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:08:39,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:08:39,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:08:39,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:08:39" (1/1) ... [2018-12-09 19:08:39,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ab3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:39, skipping insertion in model container [2018-12-09 19:08:39,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:08:39" (1/1) ... [2018-12-09 19:08:39,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:08:39,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:08:40,005 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:08:40,007 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:08:40,022 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:08:40,030 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:08:40,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40 WrapperNode [2018-12-09 19:08:40,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:08:40,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:08:40,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:08:40,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:08:40,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:08:40,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:08:40,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:08:40,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:08:40,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... [2018-12-09 19:08:40,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:08:40,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:08:40,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:08:40,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:08:40,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/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-09 19:08:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:08:40,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:08:40,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:08:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:08:40,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:08:40,278 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:08:40,278 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:08:40,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:40 BoogieIcfgContainer [2018-12-09 19:08:40,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:08:40,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:08:40,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:08:40,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:08:40,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:08:39" (1/3) ... [2018-12-09 19:08:40,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21afb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:08:40, skipping insertion in model container [2018-12-09 19:08:40,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:40" (2/3) ... [2018-12-09 19:08:40,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21afb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:08:40, skipping insertion in model container [2018-12-09 19:08:40,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:40" (3/3) ... [2018-12-09 19:08:40,283 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:08:40,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:08:40,293 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:08:40,302 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:08:40,320 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:08:40,322 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:08:40,322 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:08:40,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:08:40,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:08:40,322 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:08:40,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:08:40,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:08:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-09 19:08:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 19:08:40,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,337 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] [2018-12-09 19:08:40,339 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,342 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-12-09 19:08:40,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,447 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-09 19:08:40,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,461 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-09 19:08:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,489 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-12-09 19:08:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 19:08:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,496 INFO L225 Difference]: With dead ends: 93 [2018-12-09 19:08:40,496 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 19:08:40,498 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-09 19:08:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 19:08:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-12-09 19:08:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 19:08:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-12-09 19:08:40,522 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-12-09 19:08:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,522 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-12-09 19:08:40,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-12-09 19:08:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 19:08:40,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,523 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] [2018-12-09 19:08:40,523 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-12-09 19:08:40,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,549 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-09 19:08:40,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,551 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-12-09 19:08:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,569 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-12-09 19:08:40,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 19:08:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,571 INFO L225 Difference]: With dead ends: 127 [2018-12-09 19:08:40,571 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 19:08:40,571 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-09 19:08:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 19:08:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-09 19:08:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 19:08:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-12-09 19:08:40,576 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-12-09 19:08:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,577 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-12-09 19:08:40,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-12-09 19:08:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 19:08:40,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,577 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] [2018-12-09 19:08:40,578 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-12-09 19:08:40,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,600 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-09 19:08:40,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,601 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-12-09 19:08:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,612 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-12-09 19:08:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 19:08:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,613 INFO L225 Difference]: With dead ends: 117 [2018-12-09 19:08:40,613 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 19:08:40,614 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-09 19:08:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 19:08:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-12-09 19:08:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 19:08:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-12-09 19:08:40,619 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-12-09 19:08:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,619 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-12-09 19:08:40,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-12-09 19:08:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 19:08:40,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,620 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] [2018-12-09 19:08:40,620 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-12-09 19:08:40,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,637 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-09 19:08:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,638 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-12-09 19:08:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,649 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-12-09 19:08:40,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 19:08:40,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,650 INFO L225 Difference]: With dead ends: 148 [2018-12-09 19:08:40,650 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 19:08:40,650 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-09 19:08:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 19:08:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-12-09 19:08:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 19:08:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-12-09 19:08:40,655 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-12-09 19:08:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,655 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-12-09 19:08:40,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-12-09 19:08:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 19:08:40,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,656 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] [2018-12-09 19:08:40,657 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-12-09 19:08:40,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,672 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-09 19:08:40,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,673 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-12-09 19:08:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,692 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-12-09 19:08:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 19:08:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,693 INFO L225 Difference]: With dead ends: 244 [2018-12-09 19:08:40,693 INFO L226 Difference]: Without dead ends: 148 [2018-12-09 19:08:40,693 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-09 19:08:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-09 19:08:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-12-09 19:08:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 19:08:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-12-09 19:08:40,701 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-12-09 19:08:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,702 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-12-09 19:08:40,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-12-09 19:08:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:08:40,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,703 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] [2018-12-09 19:08:40,703 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-12-09 19:08:40,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,723 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-09 19:08:40,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,724 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-12-09 19:08:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,734 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-12-09 19:08:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:08:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,734 INFO L225 Difference]: With dead ends: 219 [2018-12-09 19:08:40,735 INFO L226 Difference]: Without dead ends: 150 [2018-12-09 19:08:40,735 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-09 19:08:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-09 19:08:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-12-09 19:08:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-09 19:08:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-12-09 19:08:40,742 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-12-09 19:08:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,742 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-12-09 19:08:40,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-12-09 19:08:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:08:40,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,743 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] [2018-12-09 19:08:40,744 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-12-09 19:08:40,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,763 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-09 19:08:40,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,765 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-12-09 19:08:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,774 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-12-09 19:08:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:08:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,776 INFO L225 Difference]: With dead ends: 276 [2018-12-09 19:08:40,776 INFO L226 Difference]: Without dead ends: 274 [2018-12-09 19:08:40,776 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-09 19:08:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-09 19:08:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-12-09 19:08:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-09 19:08:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-12-09 19:08:40,786 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-12-09 19:08:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,786 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-12-09 19:08:40,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-12-09 19:08:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:08:40,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,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] [2018-12-09 19:08:40,788 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-12-09 19:08:40,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,809 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-09 19:08:40,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,810 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-12-09 19:08:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,829 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-12-09 19:08:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:08:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,830 INFO L225 Difference]: With dead ends: 472 [2018-12-09 19:08:40,830 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 19:08:40,830 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-09 19:08:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 19:08:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-12-09 19:08:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-09 19:08:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-12-09 19:08:40,839 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-12-09 19:08:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,839 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-12-09 19:08:40,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-12-09 19:08:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:08:40,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,841 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] [2018-12-09 19:08:40,841 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-12-09 19:08:40,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,856 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-09 19:08:40,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,857 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-12-09 19:08:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,867 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-12-09 19:08:40,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 19:08:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,868 INFO L225 Difference]: With dead ends: 420 [2018-12-09 19:08:40,869 INFO L226 Difference]: Without dead ends: 286 [2018-12-09 19:08:40,869 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-09 19:08:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-09 19:08:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-12-09 19:08:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-12-09 19:08:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-12-09 19:08:40,874 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-12-09 19:08:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,875 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-12-09 19:08:40,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-12-09 19:08:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:08:40,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,876 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] [2018-12-09 19:08:40,876 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,876 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-12-09 19:08:40,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,891 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-09 19:08:40,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,893 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-12-09 19:08:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,906 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-12-09 19:08:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 19:08:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,908 INFO L225 Difference]: With dead ends: 524 [2018-12-09 19:08:40,908 INFO L226 Difference]: Without dead ends: 522 [2018-12-09 19:08:40,909 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-09 19:08:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-12-09 19:08:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-12-09 19:08:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-09 19:08:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-12-09 19:08:40,919 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-12-09 19:08:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,919 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-12-09 19:08:40,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-12-09 19:08:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:08:40,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,920 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] [2018-12-09 19:08:40,921 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,921 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-12-09 19:08:40,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,937 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-09 19:08:40,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,938 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-12-09 19:08:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:40,959 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-12-09 19:08:40,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:40,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 19:08:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:40,960 INFO L225 Difference]: With dead ends: 924 [2018-12-09 19:08:40,960 INFO L226 Difference]: Without dead ends: 546 [2018-12-09 19:08:40,961 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-09 19:08:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-12-09 19:08:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-12-09 19:08:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-09 19:08:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-12-09 19:08:40,972 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-12-09 19:08:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:40,973 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-12-09 19:08:40,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-12-09 19:08:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:08:40,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:40,974 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-09 19:08:40,974 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:40,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:40,974 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-12-09 19:08:40,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:40,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:40,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:40,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:40,989 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-09 19:08:40,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:40,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:40,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:40,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:40,990 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-12-09 19:08:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,004 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-12-09 19:08:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:08:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,006 INFO L225 Difference]: With dead ends: 816 [2018-12-09 19:08:41,006 INFO L226 Difference]: Without dead ends: 554 [2018-12-09 19:08:41,007 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-09 19:08:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-09 19:08:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-12-09 19:08:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-09 19:08:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-12-09 19:08:41,017 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-12-09 19:08:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,017 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-12-09 19:08:41,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-12-09 19:08:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:08:41,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,018 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-09 19:08:41,018 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-12-09 19:08:41,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,035 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-09 19:08:41,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,036 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-12-09 19:08:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,051 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-12-09 19:08:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:08:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,053 INFO L225 Difference]: With dead ends: 1004 [2018-12-09 19:08:41,053 INFO L226 Difference]: Without dead ends: 1002 [2018-12-09 19:08:41,053 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-09 19:08:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-12-09 19:08:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-12-09 19:08:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-09 19:08:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-12-09 19:08:41,067 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-12-09 19:08:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,067 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-12-09 19:08:41,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-12-09 19:08:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:08:41,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,068 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-09 19:08:41,068 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-12-09 19:08:41,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,080 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-09 19:08:41,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,081 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-12-09 19:08:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,099 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-12-09 19:08:41,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:08:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,101 INFO L225 Difference]: With dead ends: 1820 [2018-12-09 19:08:41,101 INFO L226 Difference]: Without dead ends: 1066 [2018-12-09 19:08:41,102 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-09 19:08:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-12-09 19:08:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-12-09 19:08:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-12-09 19:08:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-12-09 19:08:41,122 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-12-09 19:08:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,122 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-12-09 19:08:41,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-12-09 19:08:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:08:41,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,123 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-09 19:08:41,123 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,124 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-12-09 19:08:41,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,140 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-09 19:08:41,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,141 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-12-09 19:08:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,165 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-12-09 19:08:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:08:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,168 INFO L225 Difference]: With dead ends: 1596 [2018-12-09 19:08:41,168 INFO L226 Difference]: Without dead ends: 1082 [2018-12-09 19:08:41,169 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-09 19:08:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-12-09 19:08:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-12-09 19:08:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-12-09 19:08:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-12-09 19:08:41,194 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-12-09 19:08:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,194 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-12-09 19:08:41,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-12-09 19:08:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:08:41,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,195 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-09 19:08:41,195 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-12-09 19:08:41,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,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-09 19:08:41,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,206 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-12-09 19:08:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,246 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-12-09 19:08:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:08:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,252 INFO L225 Difference]: With dead ends: 1932 [2018-12-09 19:08:41,252 INFO L226 Difference]: Without dead ends: 1930 [2018-12-09 19:08:41,253 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-09 19:08:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-12-09 19:08:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-12-09 19:08:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-12-09 19:08:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-12-09 19:08:41,292 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-12-09 19:08:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,292 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-12-09 19:08:41,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-12-09 19:08:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:08:41,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,294 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-09 19:08:41,294 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-12-09 19:08:41,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,303 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-09 19:08:41,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,305 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-12-09 19:08:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,342 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-12-09 19:08:41,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:08:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,346 INFO L225 Difference]: With dead ends: 3596 [2018-12-09 19:08:41,346 INFO L226 Difference]: Without dead ends: 2090 [2018-12-09 19:08:41,348 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-09 19:08:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-12-09 19:08:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-12-09 19:08:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-12-09 19:08:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-12-09 19:08:41,387 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-12-09 19:08:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,387 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-12-09 19:08:41,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-12-09 19:08:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:08:41,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,389 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-09 19:08:41,389 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-12-09 19:08:41,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,400 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-09 19:08:41,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,401 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-12-09 19:08:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,447 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-12-09 19:08:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:08:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,453 INFO L225 Difference]: With dead ends: 3132 [2018-12-09 19:08:41,453 INFO L226 Difference]: Without dead ends: 2122 [2018-12-09 19:08:41,456 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-09 19:08:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-12-09 19:08:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-12-09 19:08:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-12-09 19:08:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-12-09 19:08:41,545 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-12-09 19:08:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,545 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-12-09 19:08:41,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-12-09 19:08:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:08:41,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,547 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-09 19:08:41,547 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-12-09 19:08:41,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,560 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-09 19:08:41,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,561 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-12-09 19:08:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,626 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-12-09 19:08:41,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:08:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,635 INFO L225 Difference]: With dead ends: 3724 [2018-12-09 19:08:41,635 INFO L226 Difference]: Without dead ends: 3722 [2018-12-09 19:08:41,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-09 19:08:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-12-09 19:08:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-12-09 19:08:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-12-09 19:08:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-12-09 19:08:41,683 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-12-09 19:08:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,684 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-12-09 19:08:41,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-12-09 19:08:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:08:41,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,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] [2018-12-09 19:08:41,686 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-12-09 19:08:41,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,697 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-09 19:08:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,698 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-12-09 19:08:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,767 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-12-09 19:08:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:08:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,778 INFO L225 Difference]: With dead ends: 7116 [2018-12-09 19:08:41,778 INFO L226 Difference]: Without dead ends: 4106 [2018-12-09 19:08:41,782 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-09 19:08:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-09 19:08:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-12-09 19:08:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-12-09 19:08:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-12-09 19:08:41,851 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-12-09 19:08:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:41,851 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-12-09 19:08:41,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-12-09 19:08:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:08:41,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:41,854 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-09 19:08:41,854 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:41,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-12-09 19:08:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:41,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:41,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:41,868 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-09 19:08:41,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:41,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:41,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:41,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:41,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:41,869 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-12-09 19:08:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:41,915 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-12-09 19:08:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:41,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:08:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:41,925 INFO L225 Difference]: With dead ends: 6156 [2018-12-09 19:08:41,926 INFO L226 Difference]: Without dead ends: 4170 [2018-12-09 19:08:41,929 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-09 19:08:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-12-09 19:08:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-12-09 19:08:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-12-09 19:08:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-12-09 19:08:42,014 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-12-09 19:08:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:42,014 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-12-09 19:08:42,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-12-09 19:08:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:08:42,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:42,017 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-09 19:08:42,017 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:42,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-12-09 19:08:42,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:42,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:42,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:42,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:42,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:42,026 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-09 19:08:42,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:42,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:42,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:42,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:42,027 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-12-09 19:08:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:42,136 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-12-09 19:08:42,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:42,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:08:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:42,149 INFO L225 Difference]: With dead ends: 12108 [2018-12-09 19:08:42,149 INFO L226 Difference]: Without dead ends: 8074 [2018-12-09 19:08:42,155 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-09 19:08:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-12-09 19:08:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-12-09 19:08:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-12-09 19:08:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-12-09 19:08:42,280 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-12-09 19:08:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:42,281 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-12-09 19:08:42,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-12-09 19:08:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:08:42,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:42,286 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-09 19:08:42,286 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:42,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:42,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-12-09 19:08:42,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:42,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:42,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:42,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:42,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:42,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-09 19:08:42,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:42,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:42,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:42,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:42,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:42,298 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-12-09 19:08:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:42,410 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-12-09 19:08:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:42,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:08:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:42,421 INFO L225 Difference]: With dead ends: 9100 [2018-12-09 19:08:42,421 INFO L226 Difference]: Without dead ends: 9098 [2018-12-09 19:08:42,424 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-09 19:08:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-12-09 19:08:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-12-09 19:08:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-12-09 19:08:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-12-09 19:08:42,572 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-12-09 19:08:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:42,572 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-12-09 19:08:42,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-12-09 19:08:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:08:42,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:42,577 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-09 19:08:42,577 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:42,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-12-09 19:08:42,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:42,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:42,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:42,587 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-09 19:08:42,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:42,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:42,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:42,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:42,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:42,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:42,588 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-12-09 19:08:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:42,715 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-12-09 19:08:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:42,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 19:08:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:42,730 INFO L225 Difference]: With dead ends: 13708 [2018-12-09 19:08:42,730 INFO L226 Difference]: Without dead ends: 13706 [2018-12-09 19:08:42,734 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-09 19:08:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-12-09 19:08:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-12-09 19:08:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-12-09 19:08:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-12-09 19:08:42,874 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-12-09 19:08:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:42,874 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-12-09 19:08:42,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-12-09 19:08:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:08:42,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:42,882 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-09 19:08:42,883 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:42,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-12-09 19:08:42,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:42,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:42,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:42,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:42,891 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-09 19:08:42,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:42,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:42,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:42,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:42,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:42,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:42,892 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2018-12-09 19:08:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:43,039 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2018-12-09 19:08:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:43,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 19:08:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:43,054 INFO L225 Difference]: With dead ends: 27788 [2018-12-09 19:08:43,054 INFO L226 Difference]: Without dead ends: 15754 [2018-12-09 19:08:43,064 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-09 19:08:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2018-12-09 19:08:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2018-12-09 19:08:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-12-09 19:08:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2018-12-09 19:08:43,296 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2018-12-09 19:08:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:43,296 INFO L480 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2018-12-09 19:08:43,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2018-12-09 19:08:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:08:43,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:43,303 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-09 19:08:43,304 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:43,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2018-12-09 19:08:43,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:43,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:43,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:43,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:43,314 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-09 19:08:43,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:43,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:43,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:43,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:43,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:43,315 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2018-12-09 19:08:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:43,462 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2018-12-09 19:08:43,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:43,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:08:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:43,475 INFO L225 Difference]: With dead ends: 23820 [2018-12-09 19:08:43,475 INFO L226 Difference]: Without dead ends: 16138 [2018-12-09 19:08:43,486 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-09 19:08:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2018-12-09 19:08:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2018-12-09 19:08:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2018-12-09 19:08:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2018-12-09 19:08:43,676 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2018-12-09 19:08:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:43,677 INFO L480 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2018-12-09 19:08:43,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2018-12-09 19:08:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:08:43,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:43,682 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-09 19:08:43,682 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:43,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:43,682 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2018-12-09 19:08:43,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:43,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:43,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:43,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:43,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:43,701 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-09 19:08:43,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:43,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:43,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:43,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:43,702 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2018-12-09 19:08:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:43,924 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2018-12-09 19:08:43,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:43,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:08:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:43,939 INFO L225 Difference]: With dead ends: 26636 [2018-12-09 19:08:43,939 INFO L226 Difference]: Without dead ends: 26634 [2018-12-09 19:08:43,942 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-09 19:08:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2018-12-09 19:08:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2018-12-09 19:08:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2018-12-09 19:08:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2018-12-09 19:08:44,202 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2018-12-09 19:08:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:44,202 INFO L480 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2018-12-09 19:08:44,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2018-12-09 19:08:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:08:44,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:44,214 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-09 19:08:44,214 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:44,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2018-12-09 19:08:44,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:44,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:44,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:44,234 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-09 19:08:44,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:44,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:44,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:44,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:44,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:44,235 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2018-12-09 19:08:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:44,497 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2018-12-09 19:08:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:44,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:08:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:44,518 INFO L225 Difference]: With dead ends: 55308 [2018-12-09 19:08:44,518 INFO L226 Difference]: Without dead ends: 31242 [2018-12-09 19:08:44,536 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-09 19:08:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2018-12-09 19:08:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2018-12-09 19:08:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2018-12-09 19:08:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2018-12-09 19:08:44,991 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2018-12-09 19:08:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:44,991 INFO L480 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2018-12-09 19:08:44,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2018-12-09 19:08:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:08:45,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:45,000 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-09 19:08:45,000 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:45,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2018-12-09 19:08:45,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:45,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:45,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:45,010 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-09 19:08:45,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:45,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:45,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:45,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:45,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:45,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:45,011 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2018-12-09 19:08:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:45,257 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2018-12-09 19:08:45,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:45,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:08:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:45,277 INFO L225 Difference]: With dead ends: 46860 [2018-12-09 19:08:45,277 INFO L226 Difference]: Without dead ends: 31754 [2018-12-09 19:08:45,290 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-09 19:08:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2018-12-09 19:08:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2018-12-09 19:08:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2018-12-09 19:08:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2018-12-09 19:08:45,737 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2018-12-09 19:08:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:45,737 INFO L480 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2018-12-09 19:08:45,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2018-12-09 19:08:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:08:45,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:45,747 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-09 19:08:45,747 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:45,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2018-12-09 19:08:45,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:45,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:45,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:45,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:45,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-09 19:08:45,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:45,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:45,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:45,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:45,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:45,756 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2018-12-09 19:08:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:46,190 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2018-12-09 19:08:46,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:46,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:08:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:46,228 INFO L225 Difference]: With dead ends: 51210 [2018-12-09 19:08:46,228 INFO L226 Difference]: Without dead ends: 51208 [2018-12-09 19:08:46,238 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-09 19:08:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2018-12-09 19:08:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2018-12-09 19:08:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2018-12-09 19:08:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2018-12-09 19:08:46,775 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2018-12-09 19:08:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:46,775 INFO L480 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2018-12-09 19:08:46,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2018-12-09 19:08:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:08:46,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:46,803 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-09 19:08:46,803 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:46,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2018-12-09 19:08:46,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:46,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:46,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:46,816 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-09 19:08:46,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:46,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:08:46,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:46,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:08:46,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:08:46,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:08:46,817 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2018-12-09 19:08:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:47,470 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2018-12-09 19:08:47,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:08:47,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:08:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:47,470 INFO L225 Difference]: With dead ends: 109576 [2018-12-09 19:08:47,470 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:08:47,514 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-09 19:08:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:08:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:08:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:08:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:08:47,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-09 19:08:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:47,515 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:08:47,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:08:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:08:47,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:08:47,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:08:47,542 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 19:08:47,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:08:47,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:08:47,542 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 19:08:47,542 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:08:47,542 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:08:47,542 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-12-09 19:08:47,542 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-09 19:08:47,542 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-12-09 19:08:47,542 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-12-09 19:08:47,542 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-09 19:08:47,542 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,543 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-12-09 19:08:47,544 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-12-09 19:08:47,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:08:47 BoogieIcfgContainer [2018-12-09 19:08:47,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:08:47,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:08:47,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:08:47,550 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:08:47,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:40" (3/4) ... [2018-12-09 19:08:47,553 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:08:47,558 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:08:47,558 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:08:47,562 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 19:08:47,563 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 19:08:47,563 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 19:08:47,606 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b83296e-805e-4724-8ee7-a4aa7028a79d/bin-2019/utaipan/witness.graphml [2018-12-09 19:08:47,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:08:47,607 INFO L168 Benchmark]: Toolchain (without parser) took 7719.62 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 898.1 MB). Free memory was 957.8 MB in the beginning and 1.3 GB in the end (delta: -357.7 MB). Peak memory consumption was 540.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:47,608 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:08:47,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:47,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.83 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:47,608 INFO L168 Benchmark]: Boogie Preprocessor took 50.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 54.0 MB). Free memory was 941.7 MB in the beginning and 1.0 GB in the end (delta: -105.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:47,608 INFO L168 Benchmark]: RCFGBuilder took 180.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:47,609 INFO L168 Benchmark]: TraceAbstraction took 7270.75 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 844.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -312.4 MB). Peak memory consumption was 531.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:47,609 INFO L168 Benchmark]: Witness Printer took 56.35 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:47,610 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 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 15.83 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 54.0 MB). Free memory was 941.7 MB in the beginning and 1.0 GB in the end (delta: -105.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 180.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7270.75 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 844.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -312.4 MB). Peak memory consumption was 531.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.35 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 47 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, 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: 3.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 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.3s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...