./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/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 ccd6d122756047ddb1225c106ac06a6748e14c22 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:44:20,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:44:20,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:44:20,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:44:20,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:44:20,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:44:20,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:44:20,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:44:20,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:44:20,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:44:20,067 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:44:20,067 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:44:20,068 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:44:20,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:44:20,069 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:44:20,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:44:20,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:44:20,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:44:20,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:44:20,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:44:20,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:44:20,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:44:20,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:44:20,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:44:20,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:44:20,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:44:20,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:44:20,078 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:44:20,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:44:20,079 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:44:20,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:44:20,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:44:20,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:44:20,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:44:20,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:44:20,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:44:20,081 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:44:20,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:44:20,088 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:44:20,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:44:20,089 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:44:20,089 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:44:20,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:44:20,089 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:44:20,089 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:44:20,089 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:44:20,089 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:44:20,090 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:44:20,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:44:20,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:44:20,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:44:20,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:44:20,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:44:20,091 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:44:20,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:44:20,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:44:20,091 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:44:20,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:44:20,091 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:44:20,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:44:20,092 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:44:20,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:44:20,092 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_3f34296b-08ca-405c-8dfc-d501981ca85d/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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-11-10 12:44:20,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:44:20,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:44:20,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:44:20,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:44:20,124 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:44:20,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:44:20,159 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/data/2361eb5e9/1bbb638c87854fdaa7ce1c2985a22154/FLAGff777cb62 [2018-11-10 12:44:20,574 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:44:20,574 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:44:20,580 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/data/2361eb5e9/1bbb638c87854fdaa7ce1c2985a22154/FLAGff777cb62 [2018-11-10 12:44:20,591 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/data/2361eb5e9/1bbb638c87854fdaa7ce1c2985a22154 [2018-11-10 12:44:20,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:44:20,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:44:20,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:44:20,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:44:20,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:44:20,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ef7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20, skipping insertion in model container [2018-11-10 12:44:20,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:44:20,624 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:44:20,732 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:44:20,735 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:44:20,749 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:44:20,759 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:44:20,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20 WrapperNode [2018-11-10 12:44:20,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:44:20,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:44:20,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:44:20,760 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:44:20,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:44:20,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:44:20,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:44:20,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:44:20,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... [2018-11-10 12:44:20,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:44:20,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:44:20,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:44:20,785 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:44:20,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:44:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:44:20,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:44:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:44:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:44:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:44:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:44:20,999 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:44:21,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:44:21 BoogieIcfgContainer [2018-11-10 12:44:21,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:44:21,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:44:21,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:44:21,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:44:21,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:44:20" (1/3) ... [2018-11-10 12:44:21,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fefe9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:44:21, skipping insertion in model container [2018-11-10 12:44:21,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:20" (2/3) ... [2018-11-10 12:44:21,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fefe9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:44:21, skipping insertion in model container [2018-11-10 12:44:21,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:44:21" (3/3) ... [2018-11-10 12:44:21,005 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:44:21,013 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:44:21,017 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:44:21,026 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:44:21,053 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:44:21,053 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:44:21,053 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:44:21,053 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:44:21,053 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:44:21,053 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:44:21,053 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:44:21,054 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:44:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-10 12:44:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 12:44:21,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:44:21,072 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1900455195, now seen corresponding path program 1 times [2018-11-10 12:44:21,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,184 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,198 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-10 12:44:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,227 INFO L93 Difference]: Finished difference Result 71 states and 116 transitions. [2018-11-10 12:44:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 12:44:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,235 INFO L225 Difference]: With dead ends: 71 [2018-11-10 12:44:21,235 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 12:44:21,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 12:44:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-11-10 12:44:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 12:44:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2018-11-10 12:44:21,267 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2018-11-10 12:44:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,267 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2018-11-10 12:44:21,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2018-11-10 12:44:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 12:44:21,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:44:21,269 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1507428185, now seen corresponding path program 1 times [2018-11-10 12:44:21,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,304 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. [2018-11-10 12:44:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,332 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2018-11-10 12:44:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 12:44:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,333 INFO L225 Difference]: With dead ends: 90 [2018-11-10 12:44:21,333 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 12:44:21,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 12:44:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-10 12:44:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 12:44:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2018-11-10 12:44:21,339 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 18 [2018-11-10 12:44:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,339 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2018-11-10 12:44:21,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2018-11-10 12:44:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 12:44:21,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,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] [2018-11-10 12:44:21,341 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1215216746, now seen corresponding path program 1 times [2018-11-10 12:44:21,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,369 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,370 INFO L87 Difference]: Start difference. First operand 54 states and 91 transitions. Second operand 3 states. [2018-11-10 12:44:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,386 INFO L93 Difference]: Finished difference Result 85 states and 139 transitions. [2018-11-10 12:44:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 12:44:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,388 INFO L225 Difference]: With dead ends: 85 [2018-11-10 12:44:21,388 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 12:44:21,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 12:44:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-10 12:44:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 12:44:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 94 transitions. [2018-11-10 12:44:21,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 94 transitions. Word has length 19 [2018-11-10 12:44:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,394 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 94 transitions. [2018-11-10 12:44:21,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 94 transitions. [2018-11-10 12:44:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 12:44:21,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,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] [2018-11-10 12:44:21,395 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,395 INFO L82 PathProgramCache]: Analyzing trace with hash -514152168, now seen corresponding path program 1 times [2018-11-10 12:44:21,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,427 INFO L87 Difference]: Start difference. First operand 58 states and 94 transitions. Second operand 3 states. [2018-11-10 12:44:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,443 INFO L93 Difference]: Finished difference Result 105 states and 173 transitions. [2018-11-10 12:44:21,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 12:44:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,444 INFO L225 Difference]: With dead ends: 105 [2018-11-10 12:44:21,444 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 12:44:21,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 12:44:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2018-11-10 12:44:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 12:44:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 123 transitions. [2018-11-10 12:44:21,450 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 123 transitions. Word has length 19 [2018-11-10 12:44:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,450 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 123 transitions. [2018-11-10 12:44:21,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 123 transitions. [2018-11-10 12:44:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 12:44:21,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,451 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:44:21,451 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -907179178, now seen corresponding path program 1 times [2018-11-10 12:44:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,473 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,473 INFO L87 Difference]: Start difference. First operand 75 states and 123 transitions. Second operand 3 states. [2018-11-10 12:44:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,495 INFO L93 Difference]: Finished difference Result 171 states and 285 transitions. [2018-11-10 12:44:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 12:44:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,497 INFO L225 Difference]: With dead ends: 171 [2018-11-10 12:44:21,497 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 12:44:21,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 12:44:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-10 12:44:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 12:44:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 167 transitions. [2018-11-10 12:44:21,506 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 167 transitions. Word has length 19 [2018-11-10 12:44:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,507 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 167 transitions. [2018-11-10 12:44:21,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 167 transitions. [2018-11-10 12:44:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 12:44:21,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,508 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] [2018-11-10 12:44:21,508 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1241366670, now seen corresponding path program 1 times [2018-11-10 12:44:21,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,533 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,533 INFO L87 Difference]: Start difference. First operand 103 states and 167 transitions. Second operand 3 states. [2018-11-10 12:44:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,547 INFO L93 Difference]: Finished difference Result 154 states and 248 transitions. [2018-11-10 12:44:21,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 12:44:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,548 INFO L225 Difference]: With dead ends: 154 [2018-11-10 12:44:21,548 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 12:44:21,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 12:44:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-10 12:44:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 12:44:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-11-10 12:44:21,553 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 20 [2018-11-10 12:44:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,554 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-11-10 12:44:21,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-11-10 12:44:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 12:44:21,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,554 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] [2018-11-10 12:44:21,554 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1942431248, now seen corresponding path program 1 times [2018-11-10 12:44:21,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,589 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 3 states. [2018-11-10 12:44:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,599 INFO L93 Difference]: Finished difference Result 189 states and 305 transitions. [2018-11-10 12:44:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 12:44:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,601 INFO L225 Difference]: With dead ends: 189 [2018-11-10 12:44:21,601 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 12:44:21,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 12:44:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2018-11-10 12:44:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 12:44:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 223 transitions. [2018-11-10 12:44:21,608 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 223 transitions. Word has length 20 [2018-11-10 12:44:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,608 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 223 transitions. [2018-11-10 12:44:21,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 223 transitions. [2018-11-10 12:44:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 12:44:21,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,609 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] [2018-11-10 12:44:21,609 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1549404238, now seen corresponding path program 1 times [2018-11-10 12:44:21,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,610 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,649 INFO L87 Difference]: Start difference. First operand 141 states and 223 transitions. Second operand 3 states. [2018-11-10 12:44:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,669 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-10 12:44:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 12:44:21,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,670 INFO L225 Difference]: With dead ends: 325 [2018-11-10 12:44:21,670 INFO L226 Difference]: Without dead ends: 195 [2018-11-10 12:44:21,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-10 12:44:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-11-10 12:44:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-10 12:44:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 299 transitions. [2018-11-10 12:44:21,681 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 299 transitions. Word has length 20 [2018-11-10 12:44:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,681 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 299 transitions. [2018-11-10 12:44:21,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 299 transitions. [2018-11-10 12:44:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:44:21,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,681 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-10 12:44:21,682 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash 86041579, now seen corresponding path program 1 times [2018-11-10 12:44:21,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,683 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,713 INFO L87 Difference]: Start difference. First operand 193 states and 299 transitions. Second operand 3 states. [2018-11-10 12:44:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,727 INFO L93 Difference]: Finished difference Result 289 states and 445 transitions. [2018-11-10 12:44:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 12:44:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,728 INFO L225 Difference]: With dead ends: 289 [2018-11-10 12:44:21,728 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 12:44:21,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 12:44:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-11-10 12:44:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 12:44:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 299 transitions. [2018-11-10 12:44:21,738 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 299 transitions. Word has length 21 [2018-11-10 12:44:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,738 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 299 transitions. [2018-11-10 12:44:21,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 299 transitions. [2018-11-10 12:44:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:44:21,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,739 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-10 12:44:21,740 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash 787106157, now seen corresponding path program 1 times [2018-11-10 12:44:21,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,759 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,759 INFO L87 Difference]: Start difference. First operand 197 states and 299 transitions. Second operand 3 states. [2018-11-10 12:44:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,771 INFO L93 Difference]: Finished difference Result 349 states and 537 transitions. [2018-11-10 12:44:21,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 12:44:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,772 INFO L225 Difference]: With dead ends: 349 [2018-11-10 12:44:21,772 INFO L226 Difference]: Without dead ends: 347 [2018-11-10 12:44:21,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-10 12:44:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 273. [2018-11-10 12:44:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-10 12:44:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 407 transitions. [2018-11-10 12:44:21,782 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 407 transitions. Word has length 21 [2018-11-10 12:44:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,782 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 407 transitions. [2018-11-10 12:44:21,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 407 transitions. [2018-11-10 12:44:21,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:44:21,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,783 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-10 12:44:21,784 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash 394079147, now seen corresponding path program 1 times [2018-11-10 12:44:21,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,785 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,808 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,809 INFO L87 Difference]: Start difference. First operand 273 states and 407 transitions. Second operand 3 states. [2018-11-10 12:44:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,827 INFO L93 Difference]: Finished difference Result 629 states and 937 transitions. [2018-11-10 12:44:21,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 12:44:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,829 INFO L225 Difference]: With dead ends: 629 [2018-11-10 12:44:21,829 INFO L226 Difference]: Without dead ends: 371 [2018-11-10 12:44:21,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-10 12:44:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2018-11-10 12:44:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-10 12:44:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 535 transitions. [2018-11-10 12:44:21,838 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 535 transitions. Word has length 21 [2018-11-10 12:44:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,838 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 535 transitions. [2018-11-10 12:44:21,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 535 transitions. [2018-11-10 12:44:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:44:21,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,839 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-10 12:44:21,839 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1369297533, now seen corresponding path program 1 times [2018-11-10 12:44:21,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,857 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,858 INFO L87 Difference]: Start difference. First operand 369 states and 535 transitions. Second operand 3 states. [2018-11-10 12:44:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,874 INFO L93 Difference]: Finished difference Result 553 states and 797 transitions. [2018-11-10 12:44:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:44:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,876 INFO L225 Difference]: With dead ends: 553 [2018-11-10 12:44:21,876 INFO L226 Difference]: Without dead ends: 379 [2018-11-10 12:44:21,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-10 12:44:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2018-11-10 12:44:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-10 12:44:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 535 transitions. [2018-11-10 12:44:21,887 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 535 transitions. Word has length 22 [2018-11-10 12:44:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,887 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 535 transitions. [2018-11-10 12:44:21,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 535 transitions. [2018-11-10 12:44:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:44:21,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,888 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-10 12:44:21,888 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -668232955, now seen corresponding path program 1 times [2018-11-10 12:44:21,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,904 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,904 INFO L87 Difference]: Start difference. First operand 377 states and 535 transitions. Second operand 3 states. [2018-11-10 12:44:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:21,939 INFO L93 Difference]: Finished difference Result 1069 states and 1497 transitions. [2018-11-10 12:44:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:21,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:44:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:21,942 INFO L225 Difference]: With dead ends: 1069 [2018-11-10 12:44:21,942 INFO L226 Difference]: Without dead ends: 715 [2018-11-10 12:44:21,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-10 12:44:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-11-10 12:44:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-10 12:44:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 967 transitions. [2018-11-10 12:44:21,965 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 967 transitions. Word has length 22 [2018-11-10 12:44:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:21,965 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 967 transitions. [2018-11-10 12:44:21,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 967 transitions. [2018-11-10 12:44:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:44:21,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:21,967 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-10 12:44:21,967 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:21,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash -275205945, now seen corresponding path program 1 times [2018-11-10 12:44:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:21,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:21,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:21,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:21,996 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:21,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:21,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:21,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:21,997 INFO L87 Difference]: Start difference. First operand 713 states and 967 transitions. Second operand 3 states. [2018-11-10 12:44:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:22,027 INFO L93 Difference]: Finished difference Result 829 states and 1145 transitions. [2018-11-10 12:44:22,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:22,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:44:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:22,030 INFO L225 Difference]: With dead ends: 829 [2018-11-10 12:44:22,030 INFO L226 Difference]: Without dead ends: 827 [2018-11-10 12:44:22,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-10 12:44:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 713. [2018-11-10 12:44:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-10 12:44:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 951 transitions. [2018-11-10 12:44:22,056 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 951 transitions. Word has length 22 [2018-11-10 12:44:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:22,056 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 951 transitions. [2018-11-10 12:44:22,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 951 transitions. [2018-11-10 12:44:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:44:22,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:22,057 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-10 12:44:22,057 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:22,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:22,058 INFO L82 PathProgramCache]: Analyzing trace with hash 759830592, now seen corresponding path program 1 times [2018-11-10 12:44:22,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:22,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:22,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:22,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:22,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,090 INFO L87 Difference]: Start difference. First operand 713 states and 951 transitions. Second operand 3 states. [2018-11-10 12:44:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:22,131 INFO L93 Difference]: Finished difference Result 1213 states and 1625 transitions. [2018-11-10 12:44:22,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:22,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:44:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:22,135 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 12:44:22,135 INFO L226 Difference]: Without dead ends: 1211 [2018-11-10 12:44:22,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-10 12:44:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1049. [2018-11-10 12:44:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-11-10 12:44:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1367 transitions. [2018-11-10 12:44:22,169 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1367 transitions. Word has length 23 [2018-11-10 12:44:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:22,170 INFO L481 AbstractCegarLoop]: Abstraction has 1049 states and 1367 transitions. [2018-11-10 12:44:22,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1367 transitions. [2018-11-10 12:44:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:44:22,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:22,171 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-10 12:44:22,172 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:22,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash 366803582, now seen corresponding path program 1 times [2018-11-10 12:44:22,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:22,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:22,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:22,197 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:22,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,198 INFO L87 Difference]: Start difference. First operand 1049 states and 1367 transitions. Second operand 3 states. [2018-11-10 12:44:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:22,249 INFO L93 Difference]: Finished difference Result 2397 states and 3097 transitions. [2018-11-10 12:44:22,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:22,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:44:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:22,253 INFO L225 Difference]: With dead ends: 2397 [2018-11-10 12:44:22,253 INFO L226 Difference]: Without dead ends: 1371 [2018-11-10 12:44:22,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-11-10 12:44:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2018-11-10 12:44:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-10 12:44:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1703 transitions. [2018-11-10 12:44:22,301 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1703 transitions. Word has length 23 [2018-11-10 12:44:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:22,301 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 1703 transitions. [2018-11-10 12:44:22,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1703 transitions. [2018-11-10 12:44:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:44:22,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:22,303 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-10 12:44:22,303 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:22,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2080127930, now seen corresponding path program 1 times [2018-11-10 12:44:22,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:22,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:22,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:22,324 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:22,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,325 INFO L87 Difference]: Start difference. First operand 1369 states and 1703 transitions. Second operand 3 states. [2018-11-10 12:44:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:22,362 INFO L93 Difference]: Finished difference Result 2077 states and 2585 transitions. [2018-11-10 12:44:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:22,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:44:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:22,366 INFO L225 Difference]: With dead ends: 2077 [2018-11-10 12:44:22,366 INFO L226 Difference]: Without dead ends: 1419 [2018-11-10 12:44:22,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-11-10 12:44:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1417. [2018-11-10 12:44:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2018-11-10 12:44:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1735 transitions. [2018-11-10 12:44:22,415 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1735 transitions. Word has length 24 [2018-11-10 12:44:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:22,415 INFO L481 AbstractCegarLoop]: Abstraction has 1417 states and 1735 transitions. [2018-11-10 12:44:22,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1735 transitions. [2018-11-10 12:44:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:44:22,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:22,417 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-10 12:44:22,417 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:22,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:22,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1513774788, now seen corresponding path program 1 times [2018-11-10 12:44:22,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:22,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:22,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,419 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:22,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:22,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:22,442 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:22,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:22,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,443 INFO L87 Difference]: Start difference. First operand 1417 states and 1735 transitions. Second operand 3 states. [2018-11-10 12:44:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:22,508 INFO L93 Difference]: Finished difference Result 2315 states and 2792 transitions. [2018-11-10 12:44:22,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:22,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:44:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:22,514 INFO L225 Difference]: With dead ends: 2315 [2018-11-10 12:44:22,514 INFO L226 Difference]: Without dead ends: 2313 [2018-11-10 12:44:22,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2018-11-10 12:44:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2121. [2018-11-10 12:44:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2018-11-10 12:44:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2535 transitions. [2018-11-10 12:44:22,570 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2535 transitions. Word has length 24 [2018-11-10 12:44:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:22,571 INFO L481 AbstractCegarLoop]: Abstraction has 2121 states and 2535 transitions. [2018-11-10 12:44:22,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2535 transitions. [2018-11-10 12:44:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:44:22,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:44:22,574 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-10 12:44:22,574 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:44:22,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1906801798, now seen corresponding path program 1 times [2018-11-10 12:44:22,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:44:22,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:44:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:44:22,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:44:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:22,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:44:22,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:44:22,608 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:44:22,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:44:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:44:22,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,608 INFO L87 Difference]: Start difference. First operand 2121 states and 2535 transitions. Second operand 3 states. [2018-11-10 12:44:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:44:22,694 INFO L93 Difference]: Finished difference Result 4745 states and 5543 transitions. [2018-11-10 12:44:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:44:22,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:44:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:44:22,695 INFO L225 Difference]: With dead ends: 4745 [2018-11-10 12:44:22,695 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:44:22,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:44:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:44:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:44:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:44:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:44:22,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-10 12:44:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:44:22,702 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:44:22,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:44:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:44:22,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:44:22,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:44:22,729 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:44:22,729 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:44:22,729 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:44:22,730 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:44:22,730 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:44:22,730 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:44:22,730 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-11-10 12:44:22,730 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-10 12:44:22,730 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,730 INFO L428 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-11-10 12:44:22,730 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-10 12:44:22,730 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 12:44:22,730 INFO L421 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-11-10 12:44:22,730 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-11-10 12:44:22,731 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L428 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,732 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-11-10 12:44:22,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:44:22 BoogieIcfgContainer [2018-11-10 12:44:22,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:44:22,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:44:22,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:44:22,738 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:44:22,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:44:21" (3/4) ... [2018-11-10 12:44:22,742 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:44:22,747 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:44:22,747 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:44:22,751 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 12:44:22,751 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 12:44:22,751 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:44:22,793 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3f34296b-08ca-405c-8dfc-d501981ca85d/bin-2019/utaipan/witness.graphml [2018-11-10 12:44:22,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:44:22,794 INFO L168 Benchmark]: Toolchain (without parser) took 2199.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 963.4 MB in the beginning and 1.1 GB in the end (delta: -94.1 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:44:22,795 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:44:22,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.56 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 951.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:44:22,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.70 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:44:22,796 INFO L168 Benchmark]: Boogie Preprocessor took 12.94 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:44:22,796 INFO L168 Benchmark]: RCFGBuilder took 215.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:44:22,797 INFO L168 Benchmark]: TraceAbstraction took 1737.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:44:22,797 INFO L168 Benchmark]: Witness Printer took 55.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:44:22,798 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.56 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 951.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.70 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.94 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 215.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1737.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * Witness Printer took 55.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 36 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1222 SDtfs, 563 SDslu, 809 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2121occurred in iteration=18, 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: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 655 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 14032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...