./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12_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_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:34:27,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:34:27,107 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:34:27,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:34:27,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:34:27,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:34:27,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:34:27,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:34:27,116 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:34:27,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:34:27,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:34:27,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:34:27,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:34:27,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:34:27,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:34:27,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:34:27,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:34:27,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:34:27,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:34:27,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:34:27,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:34:27,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:34:27,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:34:27,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:34:27,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:34:27,124 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:34:27,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:34:27,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:34:27,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:34:27,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:34:27,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:34:27,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:34:27,127 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:34:27,127 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:34:27,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:34:27,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:34:27,128 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:34:27,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:34:27,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:34:27,136 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:34:27,136 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:34:27,136 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:34:27,136 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:34:27,136 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:34:27,136 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:34:27,137 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:34:27,137 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:34:27,137 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:34:27,137 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:34:27,137 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:34:27,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:34:27,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:34:27,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:34:27,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:34:27,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:34:27,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:34:27,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:34:27,138 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:34:27,138 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:34:27,139 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:34:27,139 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:34:27,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:34:27,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:34:27,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:34:27,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:34:27,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:34:27,140 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:34:27,140 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:34:27,140 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:34:27,140 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:34:27,140 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:34:27,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:34:27,140 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:34:27,140 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_a7552c42-b960-4129-9174-74f870ad9bdb/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-12-09 19:34:27,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:34:27,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:34:27,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:34:27,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:34:27,172 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:34:27,173 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:34:27,213 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/data/54ea628f2/c639ba2653564f2cb4e29f6b57e9fd17/FLAGafcd1ea0e [2018-12-09 19:34:27,600 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:34:27,600 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:34:27,604 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/data/54ea628f2/c639ba2653564f2cb4e29f6b57e9fd17/FLAGafcd1ea0e [2018-12-09 19:34:27,613 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/data/54ea628f2/c639ba2653564f2cb4e29f6b57e9fd17 [2018-12-09 19:34:27,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:34:27,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:34:27,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:34:27,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:34:27,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:34:27,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27, skipping insertion in model container [2018-12-09 19:34:27,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:34:27,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:34:27,729 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:34:27,731 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:34:27,746 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:34:27,755 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:34:27,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27 WrapperNode [2018-12-09 19:34:27,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:34:27,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:34:27,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:34:27,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:34:27,761 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:34:27" (1/1) ... [2018-12-09 19:34:27,764 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:34:27" (1/1) ... [2018-12-09 19:34:27,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:34:27,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:34:27,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:34:27,768 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:34:27,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (1/1) ... [2018-12-09 19:34:27,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:34:27,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:34:27,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:34:27,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:34:27,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/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:34:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:34:27,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:34:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:34:27,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:34:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:34:27,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:34:28,015 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:34:28,015 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:34:28,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:34:28 BoogieIcfgContainer [2018-12-09 19:34:28,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:34:28,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:34:28,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:34:28,018 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:34:28,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:34:27" (1/3) ... [2018-12-09 19:34:28,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24105b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:34:28, skipping insertion in model container [2018-12-09 19:34:28,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:34:27" (2/3) ... [2018-12-09 19:34:28,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24105b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:34:28, skipping insertion in model container [2018-12-09 19:34:28,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:34:28" (3/3) ... [2018-12-09 19:34:28,020 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 19:34:28,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:34:28,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:34:28,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:34:28,058 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:34:28,058 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:34:28,058 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:34:28,058 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:34:28,058 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:34:28,058 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:34:28,058 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:34:28,058 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:34:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-09 19:34:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 19:34:28,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,073 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:34:28,074 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-12-09 19:34:28,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,185 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:34:28,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,198 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-09 19:34:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,226 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-12-09 19:34:28,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 19:34:28,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,234 INFO L225 Difference]: With dead ends: 99 [2018-12-09 19:34:28,234 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 19:34:28,236 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:34:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 19:34:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-12-09 19:34:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 19:34:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-12-09 19:34:28,260 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-12-09 19:34:28,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,260 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-12-09 19:34:28,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-12-09 19:34:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 19:34:28,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,261 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:34:28,261 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-12-09 19:34:28,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,291 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:34:28,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,292 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-12-09 19:34:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,312 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-12-09 19:34:28,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 19:34:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,313 INFO L225 Difference]: With dead ends: 137 [2018-12-09 19:34:28,313 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 19:34:28,314 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:34:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 19:34:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-12-09 19:34:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 19:34:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-12-09 19:34:28,318 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-12-09 19:34:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,319 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-12-09 19:34:28,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-12-09 19:34:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:34:28,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,319 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:34:28,320 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-12-09 19:34:28,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:34:28,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,341 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-12-09 19:34:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,354 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-12-09 19:34:28,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:34:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,355 INFO L225 Difference]: With dead ends: 126 [2018-12-09 19:34:28,355 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 19:34:28,355 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:34:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 19:34:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-12-09 19:34:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 19:34:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-12-09 19:34:28,360 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-12-09 19:34:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,360 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-12-09 19:34:28,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-12-09 19:34:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:34:28,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,361 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:34:28,361 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,362 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-12-09 19:34:28,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,379 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:34:28,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,380 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-12-09 19:34:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,390 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-12-09 19:34:28,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:34:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,391 INFO L225 Difference]: With dead ends: 160 [2018-12-09 19:34:28,391 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 19:34:28,392 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:34:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 19:34:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-12-09 19:34:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 19:34:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-12-09 19:34:28,397 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-12-09 19:34:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,398 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-12-09 19:34:28,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-12-09 19:34:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:34:28,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,398 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:34:28,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-12-09 19:34:28,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,414 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:34:28,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,415 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-12-09 19:34:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,425 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-12-09 19:34:28,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:34:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,426 INFO L225 Difference]: With dead ends: 264 [2018-12-09 19:34:28,427 INFO L226 Difference]: Without dead ends: 160 [2018-12-09 19:34:28,427 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:34:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-09 19:34:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-12-09 19:34:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-09 19:34:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-12-09 19:34:28,433 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-12-09 19:34:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,433 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-12-09 19:34:28,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-12-09 19:34:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:34:28,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,434 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:34:28,434 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,434 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-12-09 19:34:28,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,449 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:34:28,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,450 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-12-09 19:34:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,462 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-12-09 19:34:28,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 19:34:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,463 INFO L225 Difference]: With dead ends: 237 [2018-12-09 19:34:28,463 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 19:34:28,463 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:34:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 19:34:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-12-09 19:34:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-09 19:34:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-12-09 19:34:28,469 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-12-09 19:34:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,469 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-12-09 19:34:28,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-12-09 19:34:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:34:28,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,470 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:34:28,470 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-12-09 19:34:28,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,487 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:34:28,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,488 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-12-09 19:34:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,501 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-12-09 19:34:28,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 19:34:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,503 INFO L225 Difference]: With dead ends: 300 [2018-12-09 19:34:28,503 INFO L226 Difference]: Without dead ends: 298 [2018-12-09 19:34:28,503 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:34:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-09 19:34:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-12-09 19:34:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-09 19:34:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-12-09 19:34:28,509 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-12-09 19:34:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,509 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-12-09 19:34:28,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-12-09 19:34:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:34:28,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,510 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:34:28,510 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-12-09 19:34:28,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,522 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:34:28,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,524 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-12-09 19:34:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,536 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-12-09 19:34:28,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 19:34:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,538 INFO L225 Difference]: With dead ends: 512 [2018-12-09 19:34:28,538 INFO L226 Difference]: Without dead ends: 306 [2018-12-09 19:34:28,539 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:34:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-09 19:34:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-12-09 19:34:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-09 19:34:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-12-09 19:34:28,548 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-12-09 19:34:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,548 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-12-09 19:34:28,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-12-09 19:34:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:34:28,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,549 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:34:28,550 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-12-09 19:34:28,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,567 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:34:28,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,568 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-12-09 19:34:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,577 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-12-09 19:34:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:34:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,579 INFO L225 Difference]: With dead ends: 456 [2018-12-09 19:34:28,579 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 19:34:28,579 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:34:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 19:34:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-12-09 19:34:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-12-09 19:34:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-12-09 19:34:28,586 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-12-09 19:34:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,586 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-12-09 19:34:28,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-12-09 19:34:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:34:28,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,587 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:34:28,587 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-12-09 19:34:28,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,599 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:34:28,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,601 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-12-09 19:34:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,616 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-12-09 19:34:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:34:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,619 INFO L225 Difference]: With dead ends: 572 [2018-12-09 19:34:28,619 INFO L226 Difference]: Without dead ends: 570 [2018-12-09 19:34:28,620 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:34:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-12-09 19:34:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-12-09 19:34:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-09 19:34:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-12-09 19:34:28,633 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-12-09 19:34:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,634 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-12-09 19:34:28,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-12-09 19:34:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:34:28,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,635 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:34:28,635 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-12-09 19:34:28,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,656 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:34:28,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,657 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-12-09 19:34:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,682 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-12-09 19:34:28,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:34:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,685 INFO L225 Difference]: With dead ends: 1004 [2018-12-09 19:34:28,685 INFO L226 Difference]: Without dead ends: 594 [2018-12-09 19:34:28,686 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:34:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-12-09 19:34:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-12-09 19:34:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-09 19:34:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-12-09 19:34:28,705 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-12-09 19:34:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,705 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-12-09 19:34:28,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-12-09 19:34:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:34:28,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,707 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:34:28,707 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-12-09 19:34:28,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,728 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:34:28,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,730 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-12-09 19:34:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,755 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-12-09 19:34:28,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:34:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,757 INFO L225 Difference]: With dead ends: 888 [2018-12-09 19:34:28,758 INFO L226 Difference]: Without dead ends: 602 [2018-12-09 19:34:28,758 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:34:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-09 19:34:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-12-09 19:34:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-09 19:34:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-12-09 19:34:28,769 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-12-09 19:34:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,770 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-12-09 19:34:28,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-12-09 19:34:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:34:28,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,770 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:34:28,771 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-12-09 19:34:28,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,787 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:34:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,789 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-12-09 19:34:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,811 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-12-09 19:34:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:34:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,815 INFO L225 Difference]: With dead ends: 1100 [2018-12-09 19:34:28,815 INFO L226 Difference]: Without dead ends: 1098 [2018-12-09 19:34:28,816 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:34:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-12-09 19:34:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-12-09 19:34:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-12-09 19:34:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-12-09 19:34:28,837 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-12-09 19:34:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,838 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-12-09 19:34:28,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-12-09 19:34:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:34:28,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,839 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:34:28,839 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-12-09 19:34:28,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,852 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:34:28,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,853 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-12-09 19:34:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,881 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-12-09 19:34:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:34:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,885 INFO L225 Difference]: With dead ends: 1980 [2018-12-09 19:34:28,885 INFO L226 Difference]: Without dead ends: 1162 [2018-12-09 19:34:28,887 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:34:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-12-09 19:34:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-12-09 19:34:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-12-09 19:34:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-12-09 19:34:28,909 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-12-09 19:34:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,909 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-12-09 19:34:28,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-12-09 19:34:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:34:28,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,911 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:34:28,911 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,911 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-12-09 19:34:28,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:34:28,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:28,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:28,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:28,924 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-12-09 19:34:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:28,951 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-12-09 19:34:28,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:28,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:34:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:28,955 INFO L225 Difference]: With dead ends: 1740 [2018-12-09 19:34:28,955 INFO L226 Difference]: Without dead ends: 1178 [2018-12-09 19:34:28,957 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:34:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-12-09 19:34:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-12-09 19:34:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-12-09 19:34:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-12-09 19:34:28,992 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-12-09 19:34:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:28,993 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-12-09 19:34:28,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-12-09 19:34:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:34:28,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:28,994 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:34:28,994 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:28,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-12-09 19:34:28,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:28,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:28,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:28,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:29,009 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:34:29,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:29,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:29,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:29,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:29,010 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-12-09 19:34:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:29,045 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-12-09 19:34:29,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:29,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:34:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:29,049 INFO L225 Difference]: With dead ends: 2124 [2018-12-09 19:34:29,049 INFO L226 Difference]: Without dead ends: 2122 [2018-12-09 19:34:29,050 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:34:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-12-09 19:34:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-12-09 19:34:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-12-09 19:34:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-12-09 19:34:29,077 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-12-09 19:34:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:29,078 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-12-09 19:34:29,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-12-09 19:34:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:34:29,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:29,079 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:34:29,080 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:29,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:29,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-12-09 19:34:29,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:29,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:29,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:29,095 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:34:29,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:29,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:29,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:29,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:29,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:29,096 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-12-09 19:34:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:29,134 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-12-09 19:34:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:29,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 19:34:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:29,138 INFO L225 Difference]: With dead ends: 3916 [2018-12-09 19:34:29,138 INFO L226 Difference]: Without dead ends: 2282 [2018-12-09 19:34:29,140 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:34:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-12-09 19:34:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-12-09 19:34:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-12-09 19:34:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-12-09 19:34:29,186 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-12-09 19:34:29,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:29,186 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-12-09 19:34:29,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-12-09 19:34:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:34:29,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:29,188 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:34:29,189 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:29,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-12-09 19:34:29,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:29,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:34:29,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:29,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:29,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:29,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:29,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:29,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:29,204 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-12-09 19:34:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:29,249 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-12-09 19:34:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:29,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:34:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:29,254 INFO L225 Difference]: With dead ends: 3420 [2018-12-09 19:34:29,254 INFO L226 Difference]: Without dead ends: 2314 [2018-12-09 19:34:29,255 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:34:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-09 19:34:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-12-09 19:34:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-12-09 19:34:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-12-09 19:34:29,313 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-12-09 19:34:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:29,313 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-12-09 19:34:29,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-12-09 19:34:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:34:29,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:29,315 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:34:29,316 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:29,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-12-09 19:34:29,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:29,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:29,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:29,330 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:34:29,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:29,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:29,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:29,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:29,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:29,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:29,331 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-12-09 19:34:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:29,371 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-12-09 19:34:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:29,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:34:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:29,379 INFO L225 Difference]: With dead ends: 4108 [2018-12-09 19:34:29,379 INFO L226 Difference]: Without dead ends: 4106 [2018-12-09 19:34:29,380 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:34:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-09 19:34:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-12-09 19:34:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-12-09 19:34:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-12-09 19:34:29,438 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-12-09 19:34:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:29,438 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-12-09 19:34:29,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-12-09 19:34:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:34:29,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:29,441 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:34:29,441 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:29,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-12-09 19:34:29,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:29,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:29,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:29,452 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:34:29,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:29,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:29,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:29,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:29,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:29,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:29,453 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-12-09 19:34:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:29,515 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-12-09 19:34:29,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:29,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 19:34:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:29,524 INFO L225 Difference]: With dead ends: 7756 [2018-12-09 19:34:29,524 INFO L226 Difference]: Without dead ends: 4490 [2018-12-09 19:34:29,527 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:34:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-09 19:34:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-12-09 19:34:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-12-09 19:34:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-12-09 19:34:29,602 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-12-09 19:34:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:29,602 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-12-09 19:34:29,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-12-09 19:34:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:34:29,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:29,605 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:34:29,605 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:29,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-12-09 19:34:29,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:29,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:29,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:29,619 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:34:29,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:29,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:29,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:29,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:29,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:29,620 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-12-09 19:34:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:29,663 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-12-09 19:34:29,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:29,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 19:34:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:29,670 INFO L225 Difference]: With dead ends: 6732 [2018-12-09 19:34:29,671 INFO L226 Difference]: Without dead ends: 4554 [2018-12-09 19:34:29,673 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:34:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-12-09 19:34:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-12-09 19:34:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-12-09 19:34:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-12-09 19:34:29,739 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-12-09 19:34:29,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:29,739 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-12-09 19:34:29,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-12-09 19:34:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:34:29,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:29,742 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:34:29,742 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:29,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:29,742 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-12-09 19:34:29,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:29,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:29,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:29,754 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:34:29,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:29,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:29,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:29,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:29,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:29,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:29,755 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-12-09 19:34:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:29,836 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-12-09 19:34:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:29,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 19:34:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:29,847 INFO L225 Difference]: With dead ends: 13260 [2018-12-09 19:34:29,847 INFO L226 Difference]: Without dead ends: 8842 [2018-12-09 19:34:29,853 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:34:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-12-09 19:34:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-12-09 19:34:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-12-09 19:34:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-12-09 19:34:29,990 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-12-09 19:34:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:29,990 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-12-09 19:34:29,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-12-09 19:34:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:34:29,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:29,996 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:34:29,996 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:29,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-12-09 19:34:29,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:29,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:30,011 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:34:30,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:30,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:30,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:30,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:30,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:30,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:30,012 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-12-09 19:34:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:30,132 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-12-09 19:34:30,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:30,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 19:34:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:30,148 INFO L225 Difference]: With dead ends: 10124 [2018-12-09 19:34:30,148 INFO L226 Difference]: Without dead ends: 10122 [2018-12-09 19:34:30,149 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:34:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-12-09 19:34:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-12-09 19:34:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-12-09 19:34:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-12-09 19:34:30,270 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-12-09 19:34:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:30,270 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-12-09 19:34:30,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-12-09 19:34:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:34:30,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:30,275 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:34:30,275 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:30,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-12-09 19:34:30,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:30,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:30,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:30,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:30,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:30,286 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:34:30,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:30,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:30,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:30,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:30,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:30,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:30,287 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-12-09 19:34:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:30,393 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-12-09 19:34:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:30,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:34:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:30,410 INFO L225 Difference]: With dead ends: 15244 [2018-12-09 19:34:30,410 INFO L226 Difference]: Without dead ends: 15242 [2018-12-09 19:34:30,413 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:34:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-12-09 19:34:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-12-09 19:34:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-12-09 19:34:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-12-09 19:34:30,560 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-12-09 19:34:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:30,560 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-12-09 19:34:30,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-12-09 19:34:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:34:30,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:30,567 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:34:30,567 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:30,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:30,567 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-12-09 19:34:30,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:30,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:30,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:30,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:30,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:30,576 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:34:30,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:30,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:30,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:30,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:30,577 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2018-12-09 19:34:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:30,735 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2018-12-09 19:34:30,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:30,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:34:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:30,751 INFO L225 Difference]: With dead ends: 30348 [2018-12-09 19:34:30,751 INFO L226 Difference]: Without dead ends: 17290 [2018-12-09 19:34:30,769 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:34:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-12-09 19:34:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2018-12-09 19:34:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2018-12-09 19:34:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2018-12-09 19:34:31,006 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2018-12-09 19:34:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:31,006 INFO L480 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2018-12-09 19:34:31,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2018-12-09 19:34:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:34:31,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:31,012 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:34:31,012 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:31,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2018-12-09 19:34:31,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:31,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:31,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:31,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:31,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:31,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:34:31,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:31,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:31,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:31,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:31,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:31,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:31,027 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2018-12-09 19:34:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:31,153 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2018-12-09 19:34:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:31,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:34:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:31,167 INFO L225 Difference]: With dead ends: 26124 [2018-12-09 19:34:31,167 INFO L226 Difference]: Without dead ends: 17674 [2018-12-09 19:34:31,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2018-12-09 19:34:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2018-12-09 19:34:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2018-12-09 19:34:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2018-12-09 19:34:31,393 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2018-12-09 19:34:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:31,393 INFO L480 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2018-12-09 19:34:31,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2018-12-09 19:34:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:34:31,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:31,400 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:34:31,400 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:31,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2018-12-09 19:34:31,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:31,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:31,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:31,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:31,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:31,410 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:34:31,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:31,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:31,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:31,411 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2018-12-09 19:34:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:31,632 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2018-12-09 19:34:31,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:31,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:34:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:31,649 INFO L225 Difference]: With dead ends: 29708 [2018-12-09 19:34:31,649 INFO L226 Difference]: Without dead ends: 29706 [2018-12-09 19:34:31,652 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:34:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2018-12-09 19:34:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2018-12-09 19:34:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2018-12-09 19:34:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2018-12-09 19:34:31,935 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2018-12-09 19:34:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:31,935 INFO L480 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2018-12-09 19:34:31,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2018-12-09 19:34:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:34:31,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:31,947 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:34:31,947 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:31,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2018-12-09 19:34:31,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:31,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:31,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:31,967 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:34:31,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:31,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:31,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:31,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:31,969 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2018-12-09 19:34:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:32,272 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2018-12-09 19:34:32,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:32,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:34:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:32,298 INFO L225 Difference]: With dead ends: 60428 [2018-12-09 19:34:32,298 INFO L226 Difference]: Without dead ends: 34314 [2018-12-09 19:34:32,320 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:34:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2018-12-09 19:34:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2018-12-09 19:34:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2018-12-09 19:34:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2018-12-09 19:34:32,762 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2018-12-09 19:34:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:32,762 INFO L480 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2018-12-09 19:34:32,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2018-12-09 19:34:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:34:32,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:32,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:34:32,773 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:32,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:32,773 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2018-12-09 19:34:32,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:32,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:32,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:32,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:32,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:32,795 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:34:32,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:32,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:32,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:32,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:32,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:32,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:32,796 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2018-12-09 19:34:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:33,051 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2018-12-09 19:34:33,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:33,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 19:34:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:33,074 INFO L225 Difference]: With dead ends: 51468 [2018-12-09 19:34:33,074 INFO L226 Difference]: Without dead ends: 34826 [2018-12-09 19:34:33,087 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:34:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2018-12-09 19:34:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2018-12-09 19:34:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2018-12-09 19:34:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2018-12-09 19:34:33,538 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2018-12-09 19:34:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:33,538 INFO L480 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2018-12-09 19:34:33,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2018-12-09 19:34:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:34:33,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:33,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:34:33,549 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:33,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2018-12-09 19:34:33,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:33,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:33,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:33,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:33,558 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:34:33,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:33,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:33,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:33,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:33,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:33,559 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2018-12-09 19:34:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:33,988 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2018-12-09 19:34:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:33,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 19:34:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:34,026 INFO L225 Difference]: With dead ends: 57356 [2018-12-09 19:34:34,026 INFO L226 Difference]: Without dead ends: 57354 [2018-12-09 19:34:34,035 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:34:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-12-09 19:34:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2018-12-09 19:34:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2018-12-09 19:34:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2018-12-09 19:34:34,741 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2018-12-09 19:34:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:34,741 INFO L480 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2018-12-09 19:34:34,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2018-12-09 19:34:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:34:34,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:34,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:34:34,765 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:34,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2018-12-09 19:34:34,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:34,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:34,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:34,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:34,774 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:34:34,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:34,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:34,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:34,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:34,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:34,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:34,775 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2018-12-09 19:34:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:35,354 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2018-12-09 19:34:35,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:35,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 19:34:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:35,402 INFO L225 Difference]: With dead ends: 119820 [2018-12-09 19:34:35,402 INFO L226 Difference]: Without dead ends: 67594 [2018-12-09 19:34:35,436 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:34:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2018-12-09 19:34:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2018-12-09 19:34:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2018-12-09 19:34:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2018-12-09 19:34:36,445 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2018-12-09 19:34:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:36,446 INFO L480 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2018-12-09 19:34:36,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2018-12-09 19:34:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:34:36,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:36,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:34:36,471 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:36,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2018-12-09 19:34:36,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:36,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:36,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:36,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:36,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:36,490 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:34:36,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:36,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:36,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:36,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:36,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:36,491 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2018-12-09 19:34:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:37,059 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2018-12-09 19:34:37,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:37,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 19:34:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:37,108 INFO L225 Difference]: With dead ends: 101388 [2018-12-09 19:34:37,108 INFO L226 Difference]: Without dead ends: 68618 [2018-12-09 19:34:37,133 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:34:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2018-12-09 19:34:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2018-12-09 19:34:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2018-12-09 19:34:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2018-12-09 19:34:38,221 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2018-12-09 19:34:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:38,221 INFO L480 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2018-12-09 19:34:38,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2018-12-09 19:34:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:34:38,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:38,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:34:38,243 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:38,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2018-12-09 19:34:38,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:38,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:38,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:34:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:38,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:38,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:38,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:38,258 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2018-12-09 19:34:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:39,349 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2018-12-09 19:34:39,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:39,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 19:34:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:39,418 INFO L225 Difference]: With dead ends: 110602 [2018-12-09 19:34:39,418 INFO L226 Difference]: Without dead ends: 110600 [2018-12-09 19:34:39,427 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:34:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2018-12-09 19:34:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2018-12-09 19:34:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2018-12-09 19:34:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2018-12-09 19:34:40,588 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2018-12-09 19:34:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:40,588 INFO L480 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2018-12-09 19:34:40,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2018-12-09 19:34:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:34:40,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:34:40,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:34:40,635 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:34:40,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:34:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2018-12-09 19:34:40,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:34:40,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:40,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:34:40,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:34:40,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:34:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:34:40,651 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:34:40,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:34:40,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:34:40,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:34:40,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:34:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:34:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:34:40,652 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2018-12-09 19:34:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:34:42,095 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2018-12-09 19:34:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:34:42,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 19:34:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:34:42,096 INFO L225 Difference]: With dead ends: 237576 [2018-12-09 19:34:42,096 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:34:42,180 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:34:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:34:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:34:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:34:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:34:42,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-09 19:34:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:34:42,180 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:34:42,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:34:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:34:42,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:34:42,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:34:42,212 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 19:34:42,212 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:34:42,212 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 19:34:42,213 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,213 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-12-09 19:34:42,214 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-12-09 19:34:42,214 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-12-09 19:34:42,214 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-12-09 19:34:42,215 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-12-09 19:34:42,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:34:42 BoogieIcfgContainer [2018-12-09 19:34:42,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:34:42,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:34:42,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:34:42,220 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:34:42,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:34:28" (3/4) ... [2018-12-09 19:34:42,223 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:34:42,228 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:34:42,228 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:34:42,232 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 19:34:42,232 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 19:34:42,232 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 19:34:42,270 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a7552c42-b960-4129-9174-74f870ad9bdb/bin-2019/utaipan/witness.graphml [2018-12-09 19:34:42,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:34:42,270 INFO L168 Benchmark]: Toolchain (without parser) took 14655.25 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 950.8 MB in the beginning and 1.5 GB in the end (delta: -503.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-09 19:34:42,271 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:34:42,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.29 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:42,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.63 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 936.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:42,271 INFO L168 Benchmark]: Boogie Preprocessor took 56.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:42,272 INFO L168 Benchmark]: RCFGBuilder took 190.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:34:42,272 INFO L168 Benchmark]: TraceAbstraction took 14203.41 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -375.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-09 19:34:42,272 INFO L168 Benchmark]: Witness Printer took 49.81 ms. Allocated memory is still 2.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:34:42,273 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.29 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.63 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 936.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 190.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14203.41 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -375.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 49.81 ms. Allocated memory is still 2.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, 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: 6.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 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, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...