./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/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 0f7b0b589689413087c164ce10eb80c902ee4046 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:09:49,126 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:09:49,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:09:49,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:09:49,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:09:49,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:09:49,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:09:49,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:09:49,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:09:49,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:09:49,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:09:49,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:09:49,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:09:49,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:09:49,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:09:49,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:09:49,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:09:49,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:09:49,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:09:49,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:09:49,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:09:49,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:09:49,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:09:49,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:09:49,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:09:49,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:09:49,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:09:49,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:09:49,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:09:49,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:09:49,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:09:49,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:09:49,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:09:49,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:09:49,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:09:49,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:09:49,160 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:09:49,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:09:49,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:09:49,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:09:49,173 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:09:49,173 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:09:49,173 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:09:49,173 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:09:49,173 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:09:49,173 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:09:49,173 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:09:49,173 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:09:49,174 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:09:49,174 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:09:49,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:09:49,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:09:49,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:09:49,175 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:09:49,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:09:49,175 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:09:49,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:09:49,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:09:49,177 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:09:49,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:09:49,177 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:09:49,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:09:49,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:09:49,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:09:49,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:09:49,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:09:49,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:09:49,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:09:49,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:09:49,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:09:49,179 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:09:49,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:09:49,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:09:49,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:09:49,179 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_c44b7cb2-50ff-4436-9e72-a28301b560fd/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-11-18 16:09:49,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:09:49,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:09:49,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:09:49,219 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:09:49,220 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:09:49,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:09:49,272 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/data/0d5006d11/60eba01259de451a9d82adfac7214ebb/FLAGce36b0c1b [2018-11-18 16:09:49,648 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:09:49,649 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:09:49,657 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/data/0d5006d11/60eba01259de451a9d82adfac7214ebb/FLAGce36b0c1b [2018-11-18 16:09:49,667 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/data/0d5006d11/60eba01259de451a9d82adfac7214ebb [2018-11-18 16:09:49,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:09:49,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:09:49,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:09:49,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:09:49,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:09:49,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff47436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49, skipping insertion in model container [2018-11-18 16:09:49,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:09:49,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:09:49,850 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:09:49,853 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:09:49,873 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:09:49,883 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:09:49,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49 WrapperNode [2018-11-18 16:09:49,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:09:49,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:09:49,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:09:49,884 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:09:49,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:09:49,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:09:49,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:09:49,901 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:09:49,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... [2018-11-18 16:09:49,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:09:49,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:09:49,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:09:49,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:09:49,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:09:50,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:09:50,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:09:50,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:09:50,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:09:50,039 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:09:50,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:09:50,253 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:09:50,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:09:50 BoogieIcfgContainer [2018-11-18 16:09:50,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:09:50,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:09:50,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:09:50,257 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:09:50,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:09:49" (1/3) ... [2018-11-18 16:09:50,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29938bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:09:50, skipping insertion in model container [2018-11-18 16:09:50,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:49" (2/3) ... [2018-11-18 16:09:50,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29938bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:09:50, skipping insertion in model container [2018-11-18 16:09:50,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:09:50" (3/3) ... [2018-11-18 16:09:50,259 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:09:50,266 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:09:50,276 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:09:50,290 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:09:50,314 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:09:50,315 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:09:50,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:09:50,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:09:50,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:09:50,316 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:09:50,316 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:09:50,316 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:09:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-18 16:09:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:09:50,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:50,340 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:50,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:50,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:50,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1332805667, now seen corresponding path program 1 times [2018-11-18 16:09:50,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:50,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:50,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:50,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:50,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:50,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:50,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:50,516 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-11-18 16:09:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:50,582 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2018-11-18 16:09:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:50,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:09:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:50,593 INFO L225 Difference]: With dead ends: 89 [2018-11-18 16:09:50,593 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 16:09:50,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 16:09:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2018-11-18 16:09:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 16:09:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2018-11-18 16:09:50,636 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2018-11-18 16:09:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:50,637 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2018-11-18 16:09:50,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2018-11-18 16:09:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:09:50,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:50,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:50,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:50,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1919611681, now seen corresponding path program 1 times [2018-11-18 16:09:50,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:50,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:50,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:50,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:50,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:50,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:50,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:50,712 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand 3 states. [2018-11-18 16:09:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:50,758 INFO L93 Difference]: Finished difference Result 120 states and 215 transitions. [2018-11-18 16:09:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:50,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:09:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:50,760 INFO L225 Difference]: With dead ends: 120 [2018-11-18 16:09:50,760 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 16:09:50,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 16:09:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-18 16:09:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 16:09:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2018-11-18 16:09:50,772 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 21 [2018-11-18 16:09:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:50,773 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2018-11-18 16:09:50,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2018-11-18 16:09:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:09:50,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:50,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:50,775 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:50,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:50,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1632910664, now seen corresponding path program 1 times [2018-11-18 16:09:50,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:50,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:50,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:50,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:50,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:50,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:50,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:50,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:50,861 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 3 states. [2018-11-18 16:09:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:50,905 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2018-11-18 16:09:50,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:50,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:09:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:50,906 INFO L225 Difference]: With dead ends: 112 [2018-11-18 16:09:50,906 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 16:09:50,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 16:09:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-18 16:09:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 16:09:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2018-11-18 16:09:50,913 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 22 [2018-11-18 16:09:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:50,914 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2018-11-18 16:09:50,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2018-11-18 16:09:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:09:50,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:50,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:50,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:50,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:50,915 INFO L82 PathProgramCache]: Analyzing trace with hash 621793414, now seen corresponding path program 1 times [2018-11-18 16:09:50,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:50,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:50,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:50,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:50,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:50,952 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 3 states. [2018-11-18 16:09:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:50,985 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2018-11-18 16:09:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:50,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:09:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:50,988 INFO L225 Difference]: With dead ends: 141 [2018-11-18 16:09:50,988 INFO L226 Difference]: Without dead ends: 139 [2018-11-18 16:09:50,988 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-18 16:09:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-11-18 16:09:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 16:09:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2018-11-18 16:09:50,996 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 22 [2018-11-18 16:09:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:50,997 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2018-11-18 16:09:50,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2018-11-18 16:09:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:09:50,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:50,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:50,998 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:50,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:50,998 INFO L82 PathProgramCache]: Analyzing trace with hash 34987400, now seen corresponding path program 1 times [2018-11-18 16:09:50,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:50,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,042 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 3 states. [2018-11-18 16:09:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,066 INFO L93 Difference]: Finished difference Result 231 states and 405 transitions. [2018-11-18 16:09:51,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:09:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,067 INFO L225 Difference]: With dead ends: 231 [2018-11-18 16:09:51,067 INFO L226 Difference]: Without dead ends: 141 [2018-11-18 16:09:51,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-18 16:09:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-18 16:09:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 16:09:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 239 transitions. [2018-11-18 16:09:51,075 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 239 transitions. Word has length 22 [2018-11-18 16:09:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,075 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 239 transitions. [2018-11-18 16:09:51,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 239 transitions. [2018-11-18 16:09:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:09:51,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,077 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2095940372, now seen corresponding path program 1 times [2018-11-18 16:09:51,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,110 INFO L87 Difference]: Start difference. First operand 139 states and 239 transitions. Second operand 3 states. [2018-11-18 16:09:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,137 INFO L93 Difference]: Finished difference Result 208 states and 356 transitions. [2018-11-18 16:09:51,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:09:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,138 INFO L225 Difference]: With dead ends: 208 [2018-11-18 16:09:51,138 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 16:09:51,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 16:09:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-18 16:09:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 16:09:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 239 transitions. [2018-11-18 16:09:51,147 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 239 transitions. Word has length 23 [2018-11-18 16:09:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,148 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 239 transitions. [2018-11-18 16:09:51,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 239 transitions. [2018-11-18 16:09:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:09:51,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,149 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,149 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1084823122, now seen corresponding path program 1 times [2018-11-18 16:09:51,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,178 INFO L87 Difference]: Start difference. First operand 141 states and 239 transitions. Second operand 3 states. [2018-11-18 16:09:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,213 INFO L93 Difference]: Finished difference Result 261 states and 449 transitions. [2018-11-18 16:09:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:09:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,215 INFO L225 Difference]: With dead ends: 261 [2018-11-18 16:09:51,215 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 16:09:51,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 16:09:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 189. [2018-11-18 16:09:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 16:09:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 319 transitions. [2018-11-18 16:09:51,227 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 319 transitions. Word has length 23 [2018-11-18 16:09:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,228 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 319 transitions. [2018-11-18 16:09:51,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 319 transitions. [2018-11-18 16:09:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:09:51,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,229 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,232 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash 498017108, now seen corresponding path program 1 times [2018-11-18 16:09:51,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,299 INFO L87 Difference]: Start difference. First operand 189 states and 319 transitions. Second operand 3 states. [2018-11-18 16:09:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,316 INFO L93 Difference]: Finished difference Result 445 states and 757 transitions. [2018-11-18 16:09:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:09:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,318 INFO L225 Difference]: With dead ends: 445 [2018-11-18 16:09:51,318 INFO L226 Difference]: Without dead ends: 267 [2018-11-18 16:09:51,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-18 16:09:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-11-18 16:09:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-18 16:09:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 443 transitions. [2018-11-18 16:09:51,325 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 443 transitions. Word has length 23 [2018-11-18 16:09:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,326 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 443 transitions. [2018-11-18 16:09:51,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 443 transitions. [2018-11-18 16:09:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:09:51,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,327 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,327 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash -730007523, now seen corresponding path program 1 times [2018-11-18 16:09:51,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,353 INFO L87 Difference]: Start difference. First operand 265 states and 443 transitions. Second operand 3 states. [2018-11-18 16:09:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,383 INFO L93 Difference]: Finished difference Result 397 states and 661 transitions. [2018-11-18 16:09:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:09:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,384 INFO L225 Difference]: With dead ends: 397 [2018-11-18 16:09:51,384 INFO L226 Difference]: Without dead ends: 271 [2018-11-18 16:09:51,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-18 16:09:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-11-18 16:09:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-18 16:09:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 443 transitions. [2018-11-18 16:09:51,394 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 443 transitions. Word has length 24 [2018-11-18 16:09:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,394 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 443 transitions. [2018-11-18 16:09:51,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 443 transitions. [2018-11-18 16:09:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:09:51,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,395 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,395 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1741124773, now seen corresponding path program 1 times [2018-11-18 16:09:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,422 INFO L87 Difference]: Start difference. First operand 269 states and 443 transitions. Second operand 3 states. [2018-11-18 16:09:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,448 INFO L93 Difference]: Finished difference Result 493 states and 825 transitions. [2018-11-18 16:09:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:09:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,450 INFO L225 Difference]: With dead ends: 493 [2018-11-18 16:09:51,450 INFO L226 Difference]: Without dead ends: 491 [2018-11-18 16:09:51,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-18 16:09:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2018-11-18 16:09:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-18 16:09:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 599 transitions. [2018-11-18 16:09:51,463 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 599 transitions. Word has length 24 [2018-11-18 16:09:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,463 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 599 transitions. [2018-11-18 16:09:51,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 599 transitions. [2018-11-18 16:09:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:09:51,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,465 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,465 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1967036509, now seen corresponding path program 1 times [2018-11-18 16:09:51,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,490 INFO L87 Difference]: Start difference. First operand 369 states and 599 transitions. Second operand 3 states. [2018-11-18 16:09:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,523 INFO L93 Difference]: Finished difference Result 869 states and 1417 transitions. [2018-11-18 16:09:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:09:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,525 INFO L225 Difference]: With dead ends: 869 [2018-11-18 16:09:51,526 INFO L226 Difference]: Without dead ends: 515 [2018-11-18 16:09:51,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-18 16:09:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2018-11-18 16:09:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-18 16:09:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 823 transitions. [2018-11-18 16:09:51,543 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 823 transitions. Word has length 24 [2018-11-18 16:09:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,544 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 823 transitions. [2018-11-18 16:09:51,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 823 transitions. [2018-11-18 16:09:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:09:51,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,546 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,546 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1859921289, now seen corresponding path program 1 times [2018-11-18 16:09:51,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,594 INFO L87 Difference]: Start difference. First operand 513 states and 823 transitions. Second operand 3 states. [2018-11-18 16:09:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,656 INFO L93 Difference]: Finished difference Result 769 states and 1229 transitions. [2018-11-18 16:09:51,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 16:09:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,658 INFO L225 Difference]: With dead ends: 769 [2018-11-18 16:09:51,659 INFO L226 Difference]: Without dead ends: 523 [2018-11-18 16:09:51,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-11-18 16:09:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2018-11-18 16:09:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-18 16:09:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 823 transitions. [2018-11-18 16:09:51,678 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 823 transitions. Word has length 25 [2018-11-18 16:09:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,678 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 823 transitions. [2018-11-18 16:09:51,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 823 transitions. [2018-11-18 16:09:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:09:51,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,679 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash 848804039, now seen corresponding path program 1 times [2018-11-18 16:09:51,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,739 INFO L87 Difference]: Start difference. First operand 521 states and 823 transitions. Second operand 3 states. [2018-11-18 16:09:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,835 INFO L93 Difference]: Finished difference Result 1501 states and 2361 transitions. [2018-11-18 16:09:51,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 16:09:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,838 INFO L225 Difference]: With dead ends: 1501 [2018-11-18 16:09:51,838 INFO L226 Difference]: Without dead ends: 1003 [2018-11-18 16:09:51,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-18 16:09:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1001. [2018-11-18 16:09:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-18 16:09:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1543 transitions. [2018-11-18 16:09:51,861 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1543 transitions. Word has length 25 [2018-11-18 16:09:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:51,861 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1543 transitions. [2018-11-18 16:09:51,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1543 transitions. [2018-11-18 16:09:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:09:51,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:51,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:51,862 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:51,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1435610053, now seen corresponding path program 1 times [2018-11-18 16:09:51,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:51,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:51,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:51,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:51,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:51,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,911 INFO L87 Difference]: Start difference. First operand 1001 states and 1543 transitions. Second operand 3 states. [2018-11-18 16:09:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:51,974 INFO L93 Difference]: Finished difference Result 1213 states and 1913 transitions. [2018-11-18 16:09:51,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:51,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 16:09:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:51,978 INFO L225 Difference]: With dead ends: 1213 [2018-11-18 16:09:51,978 INFO L226 Difference]: Without dead ends: 1211 [2018-11-18 16:09:51,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-18 16:09:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1001. [2018-11-18 16:09:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-18 16:09:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1527 transitions. [2018-11-18 16:09:52,008 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1527 transitions. Word has length 25 [2018-11-18 16:09:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:52,008 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1527 transitions. [2018-11-18 16:09:52,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1527 transitions. [2018-11-18 16:09:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:09:52,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:52,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:52,010 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:52,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash 543336178, now seen corresponding path program 1 times [2018-11-18 16:09:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:52,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:52,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:52,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:52,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:52,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:52,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,051 INFO L87 Difference]: Start difference. First operand 1001 states and 1527 transitions. Second operand 3 states. [2018-11-18 16:09:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:52,136 INFO L93 Difference]: Finished difference Result 1789 states and 2777 transitions. [2018-11-18 16:09:52,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:52,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 16:09:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:52,141 INFO L225 Difference]: With dead ends: 1789 [2018-11-18 16:09:52,141 INFO L226 Difference]: Without dead ends: 1787 [2018-11-18 16:09:52,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-11-18 16:09:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1433. [2018-11-18 16:09:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-11-18 16:09:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2135 transitions. [2018-11-18 16:09:52,186 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2135 transitions. Word has length 26 [2018-11-18 16:09:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:52,186 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 2135 transitions. [2018-11-18 16:09:52,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2135 transitions. [2018-11-18 16:09:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:09:52,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:52,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:52,189 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:52,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash -43469836, now seen corresponding path program 1 times [2018-11-18 16:09:52,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:52,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:52,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:52,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:52,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,257 INFO L87 Difference]: Start difference. First operand 1433 states and 2135 transitions. Second operand 3 states. [2018-11-18 16:09:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:52,351 INFO L93 Difference]: Finished difference Result 3357 states and 5017 transitions. [2018-11-18 16:09:52,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:52,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 16:09:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:52,356 INFO L225 Difference]: With dead ends: 3357 [2018-11-18 16:09:52,357 INFO L226 Difference]: Without dead ends: 1947 [2018-11-18 16:09:52,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2018-11-18 16:09:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1945. [2018-11-18 16:09:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-18 16:09:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2855 transitions. [2018-11-18 16:09:52,410 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2855 transitions. Word has length 26 [2018-11-18 16:09:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:52,410 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 2855 transitions. [2018-11-18 16:09:52,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2855 transitions. [2018-11-18 16:09:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 16:09:52,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:52,412 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:52,412 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:52,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash -336232580, now seen corresponding path program 1 times [2018-11-18 16:09:52,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:52,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:52,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:52,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:52,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:52,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,459 INFO L87 Difference]: Start difference. First operand 1945 states and 2855 transitions. Second operand 3 states. [2018-11-18 16:09:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:52,548 INFO L93 Difference]: Finished difference Result 2941 states and 4313 transitions. [2018-11-18 16:09:52,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:52,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 16:09:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:52,555 INFO L225 Difference]: With dead ends: 2941 [2018-11-18 16:09:52,555 INFO L226 Difference]: Without dead ends: 1995 [2018-11-18 16:09:52,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-11-18 16:09:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2018-11-18 16:09:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-11-18 16:09:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2887 transitions. [2018-11-18 16:09:52,619 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2887 transitions. Word has length 27 [2018-11-18 16:09:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:52,619 INFO L480 AbstractCegarLoop]: Abstraction has 1993 states and 2887 transitions. [2018-11-18 16:09:52,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2887 transitions. [2018-11-18 16:09:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 16:09:52,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:52,622 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:52,622 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:52,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:52,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1347349830, now seen corresponding path program 1 times [2018-11-18 16:09:52,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:52,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:52,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:52,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:52,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:52,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:52,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:52,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,690 INFO L87 Difference]: Start difference. First operand 1993 states and 2887 transitions. Second operand 3 states. [2018-11-18 16:09:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:52,784 INFO L93 Difference]: Finished difference Result 3469 states and 5097 transitions. [2018-11-18 16:09:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:52,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 16:09:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:52,795 INFO L225 Difference]: With dead ends: 3469 [2018-11-18 16:09:52,795 INFO L226 Difference]: Without dead ends: 3467 [2018-11-18 16:09:52,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-18 16:09:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 2889. [2018-11-18 16:09:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2018-11-18 16:09:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4071 transitions. [2018-11-18 16:09:52,887 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4071 transitions. Word has length 27 [2018-11-18 16:09:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:52,887 INFO L480 AbstractCegarLoop]: Abstraction has 2889 states and 4071 transitions. [2018-11-18 16:09:52,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4071 transitions. [2018-11-18 16:09:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 16:09:52,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:52,893 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:52,893 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:52,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:52,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155844, now seen corresponding path program 1 times [2018-11-18 16:09:52,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:52,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:52,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:52,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:52,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:52,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:52,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:52,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:52,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:52,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:52,949 INFO L87 Difference]: Start difference. First operand 2889 states and 4071 transitions. Second operand 3 states. [2018-11-18 16:09:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:53,067 INFO L93 Difference]: Finished difference Result 6669 states and 9385 transitions. [2018-11-18 16:09:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:53,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 16:09:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:53,078 INFO L225 Difference]: With dead ends: 6669 [2018-11-18 16:09:53,078 INFO L226 Difference]: Without dead ends: 3851 [2018-11-18 16:09:53,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-18 16:09:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3849. [2018-11-18 16:09:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2018-11-18 16:09:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5319 transitions. [2018-11-18 16:09:53,176 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5319 transitions. Word has length 27 [2018-11-18 16:09:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:53,176 INFO L480 AbstractCegarLoop]: Abstraction has 3849 states and 5319 transitions. [2018-11-18 16:09:53,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5319 transitions. [2018-11-18 16:09:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:09:53,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:53,180 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:53,180 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:53,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1182043657, now seen corresponding path program 1 times [2018-11-18 16:09:53,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:53,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:53,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:53,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:53,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:53,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:53,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:53,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:53,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:53,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:53,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:53,213 INFO L87 Difference]: Start difference. First operand 3849 states and 5319 transitions. Second operand 3 states. [2018-11-18 16:09:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:53,339 INFO L93 Difference]: Finished difference Result 5773 states and 7945 transitions. [2018-11-18 16:09:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:53,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 16:09:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:53,349 INFO L225 Difference]: With dead ends: 5773 [2018-11-18 16:09:53,349 INFO L226 Difference]: Without dead ends: 3915 [2018-11-18 16:09:53,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-11-18 16:09:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3913. [2018-11-18 16:09:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-18 16:09:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 5319 transitions. [2018-11-18 16:09:53,445 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 5319 transitions. Word has length 28 [2018-11-18 16:09:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:53,445 INFO L480 AbstractCegarLoop]: Abstraction has 3913 states and 5319 transitions. [2018-11-18 16:09:53,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 5319 transitions. [2018-11-18 16:09:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:09:53,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:53,449 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:53,449 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:53,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash 170926407, now seen corresponding path program 1 times [2018-11-18 16:09:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:53,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:53,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:53,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:53,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:53,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:53,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:53,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:53,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:53,517 INFO L87 Difference]: Start difference. First operand 3913 states and 5319 transitions. Second operand 3 states. [2018-11-18 16:09:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:53,669 INFO L93 Difference]: Finished difference Result 6669 states and 9161 transitions. [2018-11-18 16:09:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:53,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 16:09:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:53,697 INFO L225 Difference]: With dead ends: 6669 [2018-11-18 16:09:53,697 INFO L226 Difference]: Without dead ends: 6667 [2018-11-18 16:09:53,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2018-11-18 16:09:53,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5769. [2018-11-18 16:09:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-18 16:09:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7623 transitions. [2018-11-18 16:09:53,808 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7623 transitions. Word has length 28 [2018-11-18 16:09:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:53,808 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 7623 transitions. [2018-11-18 16:09:53,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7623 transitions. [2018-11-18 16:09:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:09:53,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:53,814 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:53,814 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:53,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:53,815 INFO L82 PathProgramCache]: Analyzing trace with hash -415879607, now seen corresponding path program 1 times [2018-11-18 16:09:53,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:53,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:53,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:53,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:53,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:53,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:53,848 INFO L87 Difference]: Start difference. First operand 5769 states and 7623 transitions. Second operand 3 states. [2018-11-18 16:09:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:53,958 INFO L93 Difference]: Finished difference Result 13197 states and 17353 transitions. [2018-11-18 16:09:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:53,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 16:09:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:53,974 INFO L225 Difference]: With dead ends: 13197 [2018-11-18 16:09:53,974 INFO L226 Difference]: Without dead ends: 7563 [2018-11-18 16:09:53,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2018-11-18 16:09:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7561. [2018-11-18 16:09:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7561 states. [2018-11-18 16:09:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 9735 transitions. [2018-11-18 16:09:54,147 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 9735 transitions. Word has length 28 [2018-11-18 16:09:54,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:54,148 INFO L480 AbstractCegarLoop]: Abstraction has 7561 states and 9735 transitions. [2018-11-18 16:09:54,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 9735 transitions. [2018-11-18 16:09:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:09:54,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:54,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:54,156 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:54,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1003967089, now seen corresponding path program 1 times [2018-11-18 16:09:54,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:54,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:54,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:54,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:54,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:54,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:54,258 INFO L87 Difference]: Start difference. First operand 7561 states and 9735 transitions. Second operand 3 states. [2018-11-18 16:09:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:54,414 INFO L93 Difference]: Finished difference Result 11341 states and 14537 transitions. [2018-11-18 16:09:54,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:54,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 16:09:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:54,426 INFO L225 Difference]: With dead ends: 11341 [2018-11-18 16:09:54,426 INFO L226 Difference]: Without dead ends: 7691 [2018-11-18 16:09:54,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2018-11-18 16:09:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7689. [2018-11-18 16:09:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-11-18 16:09:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 9735 transitions. [2018-11-18 16:09:54,787 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 9735 transitions. Word has length 29 [2018-11-18 16:09:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:54,788 INFO L480 AbstractCegarLoop]: Abstraction has 7689 states and 9735 transitions. [2018-11-18 16:09:54,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 9735 transitions. [2018-11-18 16:09:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:09:54,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:54,805 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:54,805 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:54,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:54,806 INFO L82 PathProgramCache]: Analyzing trace with hash -7150161, now seen corresponding path program 1 times [2018-11-18 16:09:54,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:54,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:54,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:54,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:54,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:54,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:54,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:54,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:54,861 INFO L87 Difference]: Start difference. First operand 7689 states and 9735 transitions. Second operand 3 states. [2018-11-18 16:09:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:55,023 INFO L93 Difference]: Finished difference Result 12813 states and 16265 transitions. [2018-11-18 16:09:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:55,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 16:09:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:55,043 INFO L225 Difference]: With dead ends: 12813 [2018-11-18 16:09:55,043 INFO L226 Difference]: Without dead ends: 12811 [2018-11-18 16:09:55,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12811 states. [2018-11-18 16:09:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12811 to 11529. [2018-11-18 16:09:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-11-18 16:09:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 14215 transitions. [2018-11-18 16:09:55,239 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 14215 transitions. Word has length 29 [2018-11-18 16:09:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:55,241 INFO L480 AbstractCegarLoop]: Abstraction has 11529 states and 14215 transitions. [2018-11-18 16:09:55,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 14215 transitions. [2018-11-18 16:09:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:09:55,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:55,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:55,252 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:55,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash -593956175, now seen corresponding path program 1 times [2018-11-18 16:09:55,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:55,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:55,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:55,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:55,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:55,303 INFO L87 Difference]: Start difference. First operand 11529 states and 14215 transitions. Second operand 3 states. [2018-11-18 16:09:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:55,505 INFO L93 Difference]: Finished difference Result 26125 states and 31881 transitions. [2018-11-18 16:09:55,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:55,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 16:09:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:55,529 INFO L225 Difference]: With dead ends: 26125 [2018-11-18 16:09:55,529 INFO L226 Difference]: Without dead ends: 14859 [2018-11-18 16:09:55,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2018-11-18 16:09:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 14857. [2018-11-18 16:09:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2018-11-18 16:09:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 17671 transitions. [2018-11-18 16:09:55,875 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 17671 transitions. Word has length 29 [2018-11-18 16:09:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:55,876 INFO L480 AbstractCegarLoop]: Abstraction has 14857 states and 17671 transitions. [2018-11-18 16:09:55,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 17671 transitions. [2018-11-18 16:09:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:09:55,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:55,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:55,882 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:55,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash -221438882, now seen corresponding path program 1 times [2018-11-18 16:09:55,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:55,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:55,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:55,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:55,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:55,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:55,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:55,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:55,929 INFO L87 Difference]: Start difference. First operand 14857 states and 17671 transitions. Second operand 3 states. [2018-11-18 16:09:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:56,151 INFO L93 Difference]: Finished difference Result 22285 states and 26377 transitions. [2018-11-18 16:09:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:56,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 16:09:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:56,165 INFO L225 Difference]: With dead ends: 22285 [2018-11-18 16:09:56,165 INFO L226 Difference]: Without dead ends: 15115 [2018-11-18 16:09:56,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2018-11-18 16:09:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 15113. [2018-11-18 16:09:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15113 states. [2018-11-18 16:09:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15113 states to 15113 states and 17671 transitions. [2018-11-18 16:09:56,445 INFO L78 Accepts]: Start accepts. Automaton has 15113 states and 17671 transitions. Word has length 30 [2018-11-18 16:09:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:56,445 INFO L480 AbstractCegarLoop]: Abstraction has 15113 states and 17671 transitions. [2018-11-18 16:09:56,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 15113 states and 17671 transitions. [2018-11-18 16:09:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:09:56,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:56,452 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:56,452 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:56,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:56,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1232556132, now seen corresponding path program 1 times [2018-11-18 16:09:56,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:56,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:56,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:56,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:56,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:56,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:56,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:56,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:56,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:56,514 INFO L87 Difference]: Start difference. First operand 15113 states and 17671 transitions. Second operand 3 states. [2018-11-18 16:09:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:56,914 INFO L93 Difference]: Finished difference Result 24587 states and 28424 transitions. [2018-11-18 16:09:56,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:56,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 16:09:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:56,934 INFO L225 Difference]: With dead ends: 24587 [2018-11-18 16:09:56,934 INFO L226 Difference]: Without dead ends: 24585 [2018-11-18 16:09:56,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24585 states. [2018-11-18 16:09:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24585 to 23049. [2018-11-18 16:09:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23049 states. [2018-11-18 16:09:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23049 states to 23049 states and 26375 transitions. [2018-11-18 16:09:57,284 INFO L78 Accepts]: Start accepts. Automaton has 23049 states and 26375 transitions. Word has length 30 [2018-11-18 16:09:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:57,284 INFO L480 AbstractCegarLoop]: Abstraction has 23049 states and 26375 transitions. [2018-11-18 16:09:57,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 23049 states and 26375 transitions. [2018-11-18 16:09:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:09:57,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:09:57,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:57,298 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:09:57,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1819362146, now seen corresponding path program 1 times [2018-11-18 16:09:57,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:09:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:09:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:09:57,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:57,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:57,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:09:57,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:09:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:57,334 INFO L87 Difference]: Start difference. First operand 23049 states and 26375 transitions. Second operand 3 states. [2018-11-18 16:09:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:57,740 INFO L93 Difference]: Finished difference Result 51721 states and 58119 transitions. [2018-11-18 16:09:57,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:57,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 16:09:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:09:57,741 INFO L225 Difference]: With dead ends: 51721 [2018-11-18 16:09:57,741 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:09:57,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:09:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:09:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:09:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:09:57,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-18 16:09:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:09:57,787 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:09:57,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:09:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:09:57,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:09:57,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:09:57,860 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 16:09:57,860 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:09:57,860 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:09:57,860 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 16:09:57,860 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:09:57,860 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:09:57,860 INFO L428 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L428 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-11-18 16:09:57,861 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-18 16:09:57,861 INFO L421 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-18 16:09:57,862 INFO L425 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,863 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-18 16:09:57,863 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-18 16:09:57,863 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,863 INFO L425 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-11-18 16:09:57,863 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-18 16:09:57,863 INFO L425 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-11-18 16:09:57,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:09:57 BoogieIcfgContainer [2018-11-18 16:09:57,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:09:57,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:09:57,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:09:57,882 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:09:57,883 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:09:50" (3/4) ... [2018-11-18 16:09:57,888 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:09:57,896 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:09:57,897 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:09:57,902 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 16:09:57,902 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 16:09:57,902 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:09:57,973 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c44b7cb2-50ff-4436-9e72-a28301b560fd/bin-2019/utaipan/witness.graphml [2018-11-18 16:09:57,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:09:57,977 INFO L168 Benchmark]: Toolchain (without parser) took 8306.70 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 470.8 MB). Free memory was 960.7 MB in the beginning and 878.2 MB in the end (delta: 82.5 MB). Peak memory consumption was 553.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:09:57,978 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:09:57,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.47 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 946.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:09:57,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.23 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:09:57,980 INFO L168 Benchmark]: Boogie Preprocessor took 20.17 ms. Allocated memory is still 1.0 GB. Free memory was 946.2 MB in the beginning and 943.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:09:57,981 INFO L168 Benchmark]: RCFGBuilder took 332.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:09:57,981 INFO L168 Benchmark]: TraceAbstraction took 7627.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 328.2 MB). Free memory was 1.1 GB in the beginning and 878.2 MB in the end (delta: 238.5 MB). Peak memory consumption was 566.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:09:57,981 INFO L168 Benchmark]: Witness Printer took 93.70 ms. Allocated memory is still 1.5 GB. Free memory is still 878.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:09:57,983 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.47 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 946.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.23 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.17 ms. Allocated memory is still 1.0 GB. Free memory was 946.2 MB in the beginning and 943.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7627.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 328.2 MB). Free memory was 1.1 GB in the beginning and 878.2 MB in the end (delta: 238.5 MB). Peak memory consumption was 566.7 MB. Max. memory is 11.5 GB. * Witness Printer took 93.70 ms. Allocated memory is still 1.5 GB. Free memory is still 878.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2443 SDtfs, 1178 SDslu, 1649 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23049occurred in iteration=27, 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: 2.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 5147 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 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, 1.1s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 33520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...