./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:20:41,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:20:41,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:20:41,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:20:41,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:20:41,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:20:41,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:20:41,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:20:41,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:20:41,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:20:41,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:20:41,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:20:41,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:20:41,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:20:41,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:20:41,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:20:41,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:20:41,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:20:41,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:20:41,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:20:41,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:20:41,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:20:41,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:20:41,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:20:41,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:20:41,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:20:41,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:20:41,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:20:41,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:20:41,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:20:41,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:20:41,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:20:41,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:20:41,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:20:41,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:20:41,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:20:41,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:20:41,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:20:41,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:20:41,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:20:41,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:20:41,241 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:20:41,287 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:20:41,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:20:41,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:20:41,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:20:41,290 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:20:41,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:20:41,290 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:20:41,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:20:41,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:20:41,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:20:41,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:20:41,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:20:41,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:20:41,292 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:20:41,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:20:41,293 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:20:41,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:20:41,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:20:41,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:20:41,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:20:41,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:20:41,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:20:41,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:20:41,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:20:41,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:20:41,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:20:41,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:20:41,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:20:41,305 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:20:41,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 [2020-11-28 03:20:41,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:20:41,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:20:41,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:20:41,694 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:20:41,696 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:20:41,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-11-28 03:20:41,779 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/data/0e8809aa4/336349c745b44cce9d962907f0bdf3d2/FLAG30b11c918 [2020-11-28 03:20:42,279 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:20:42,279 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-11-28 03:20:42,303 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/data/0e8809aa4/336349c745b44cce9d962907f0bdf3d2/FLAG30b11c918 [2020-11-28 03:20:42,644 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/data/0e8809aa4/336349c745b44cce9d962907f0bdf3d2 [2020-11-28 03:20:42,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:20:42,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:20:42,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:42,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:20:42,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:20:42,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:42" (1/1) ... [2020-11-28 03:20:42,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f3102e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:42, skipping insertion in model container [2020-11-28 03:20:42,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:42" (1/1) ... [2020-11-28 03:20:42,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:20:42,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:20:42,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:42,984 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:20:43,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:43,063 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:20:43,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43 WrapperNode [2020-11-28 03:20:43,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:43,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:43,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:20:43,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:20:43,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:43,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:20:43,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:20:43,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:20:43,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:20:43,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:20:43,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:20:43,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:20:43,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/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 [2020-11-28 03:20:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:20:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:20:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:20:43,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:20:44,079 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:20:44,080 INFO L298 CfgBuilder]: Removed 86 assume(true) statements. [2020-11-28 03:20:44,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:44 BoogieIcfgContainer [2020-11-28 03:20:44,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:20:44,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:20:44,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:20:44,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:20:44,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:20:42" (1/3) ... [2020-11-28 03:20:44,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a17de7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:44, skipping insertion in model container [2020-11-28 03:20:44,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43" (2/3) ... [2020-11-28 03:20:44,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a17de7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:44, skipping insertion in model container [2020-11-28 03:20:44,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:44" (3/3) ... [2020-11-28 03:20:44,096 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-11-28 03:20:44,112 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:20:44,117 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:20:44,130 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-28 03:20:44,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:20:44,176 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:20:44,177 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:20:44,177 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:20:44,177 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:20:44,177 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:20:44,178 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:20:44,178 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:20:44,198 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2020-11-28 03:20:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:20:44,206 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:44,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:44,207 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2020-11-28 03:20:44,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:44,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100458788] [2020-11-28 03:20:44,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:44,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100458788] [2020-11-28 03:20:44,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:44,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:44,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038680066] [2020-11-28 03:20:44,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:44,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:44,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:44,423 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2020-11-28 03:20:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:44,502 INFO L93 Difference]: Finished difference Result 293 states and 457 transitions. [2020-11-28 03:20:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:44,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-28 03:20:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:44,515 INFO L225 Difference]: With dead ends: 293 [2020-11-28 03:20:44,515 INFO L226 Difference]: Without dead ends: 144 [2020-11-28 03:20:44,519 INFO L677 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 [2020-11-28 03:20:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-28 03:20:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-11-28 03:20:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-11-28 03:20:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2020-11-28 03:20:44,571 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2020-11-28 03:20:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:44,572 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2020-11-28 03:20:44,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2020-11-28 03:20:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:20:44,574 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:44,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:44,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:20:44,575 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2020-11-28 03:20:44,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:44,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204180468] [2020-11-28 03:20:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:44,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204180468] [2020-11-28 03:20:44,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:44,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:44,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995597078] [2020-11-28 03:20:44,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:44,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:44,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:44,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:44,652 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2020-11-28 03:20:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:44,734 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2020-11-28 03:20:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:44,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-28 03:20:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:44,738 INFO L225 Difference]: With dead ends: 384 [2020-11-28 03:20:44,738 INFO L226 Difference]: Without dead ends: 246 [2020-11-28 03:20:44,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-11-28 03:20:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2020-11-28 03:20:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-28 03:20:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2020-11-28 03:20:44,771 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2020-11-28 03:20:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:44,771 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2020-11-28 03:20:44,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2020-11-28 03:20:44,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:20:44,773 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:44,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:44,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:20:44,773 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:44,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2020-11-28 03:20:44,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:44,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492761741] [2020-11-28 03:20:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:44,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492761741] [2020-11-28 03:20:44,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:44,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:44,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206988628] [2020-11-28 03:20:44,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:44,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:44,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:44,828 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 4 states. [2020-11-28 03:20:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:44,948 INFO L93 Difference]: Finished difference Result 578 states and 863 transitions. [2020-11-28 03:20:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:44,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-28 03:20:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:44,952 INFO L225 Difference]: With dead ends: 578 [2020-11-28 03:20:44,952 INFO L226 Difference]: Without dead ends: 343 [2020-11-28 03:20:44,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-11-28 03:20:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2020-11-28 03:20:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-28 03:20:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2020-11-28 03:20:45,007 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 39 [2020-11-28 03:20:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:45,008 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2020-11-28 03:20:45,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2020-11-28 03:20:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:20:45,010 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:45,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:45,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:20:45,018 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:45,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2020-11-28 03:20:45,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:45,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621478439] [2020-11-28 03:20:45,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:45,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621478439] [2020-11-28 03:20:45,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:45,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:45,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288774018] [2020-11-28 03:20:45,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:45,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:45,093 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 3 states. [2020-11-28 03:20:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:45,183 INFO L93 Difference]: Finished difference Result 476 states and 708 transitions. [2020-11-28 03:20:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:45,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-28 03:20:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:45,186 INFO L225 Difference]: With dead ends: 476 [2020-11-28 03:20:45,187 INFO L226 Difference]: Without dead ends: 242 [2020-11-28 03:20:45,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-11-28 03:20:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-11-28 03:20:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-28 03:20:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2020-11-28 03:20:45,214 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 39 [2020-11-28 03:20:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:45,214 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2020-11-28 03:20:45,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2020-11-28 03:20:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:20:45,216 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:45,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:45,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:20:45,217 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:45,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2020-11-28 03:20:45,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:45,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511292500] [2020-11-28 03:20:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:45,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511292500] [2020-11-28 03:20:45,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:45,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:45,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876986775] [2020-11-28 03:20:45,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:45,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:45,291 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 4 states. [2020-11-28 03:20:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:45,400 INFO L93 Difference]: Finished difference Result 560 states and 799 transitions. [2020-11-28 03:20:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:45,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-28 03:20:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:45,404 INFO L225 Difference]: With dead ends: 560 [2020-11-28 03:20:45,404 INFO L226 Difference]: Without dead ends: 327 [2020-11-28 03:20:45,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-11-28 03:20:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2020-11-28 03:20:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-28 03:20:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 342 transitions. [2020-11-28 03:20:45,426 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 342 transitions. Word has length 39 [2020-11-28 03:20:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:45,427 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 342 transitions. [2020-11-28 03:20:45,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 342 transitions. [2020-11-28 03:20:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:20:45,439 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:45,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:45,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:20:45,439 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2020-11-28 03:20:45,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:45,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975090014] [2020-11-28 03:20:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:45,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975090014] [2020-11-28 03:20:45,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:45,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:45,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230410434] [2020-11-28 03:20:45,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:45,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:45,540 INFO L87 Difference]: Start difference. First operand 242 states and 342 transitions. Second operand 4 states. [2020-11-28 03:20:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:45,706 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2020-11-28 03:20:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:45,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-28 03:20:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:45,711 INFO L225 Difference]: With dead ends: 820 [2020-11-28 03:20:45,711 INFO L226 Difference]: Without dead ends: 589 [2020-11-28 03:20:45,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-11-28 03:20:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2020-11-28 03:20:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-11-28 03:20:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2020-11-28 03:20:45,758 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 39 [2020-11-28 03:20:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:45,763 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2020-11-28 03:20:45,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2020-11-28 03:20:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-28 03:20:45,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:45,767 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:45,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:20:45,768 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1965836524, now seen corresponding path program 1 times [2020-11-28 03:20:45,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:45,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082299273] [2020-11-28 03:20:45,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-28 03:20:45,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082299273] [2020-11-28 03:20:45,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:45,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:45,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466165975] [2020-11-28 03:20:45,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:20:45,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:45,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:20:45,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:45,884 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand 5 states. [2020-11-28 03:20:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:46,080 INFO L93 Difference]: Finished difference Result 1379 states and 1933 transitions. [2020-11-28 03:20:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:20:46,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-11-28 03:20:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:46,087 INFO L225 Difference]: With dead ends: 1379 [2020-11-28 03:20:46,087 INFO L226 Difference]: Without dead ends: 859 [2020-11-28 03:20:46,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-11-28 03:20:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2020-11-28 03:20:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-28 03:20:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 765 transitions. [2020-11-28 03:20:46,145 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 765 transitions. Word has length 51 [2020-11-28 03:20:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:46,146 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 765 transitions. [2020-11-28 03:20:46,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:20:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 765 transitions. [2020-11-28 03:20:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-28 03:20:46,148 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:46,148 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:46,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:20:46,148 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1627530898, now seen corresponding path program 1 times [2020-11-28 03:20:46,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:46,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694060707] [2020-11-28 03:20:46,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-28 03:20:46,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694060707] [2020-11-28 03:20:46,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:46,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:46,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947687157] [2020-11-28 03:20:46,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:46,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:46,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:46,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:46,229 INFO L87 Difference]: Start difference. First operand 562 states and 765 transitions. Second operand 4 states. [2020-11-28 03:20:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:46,348 INFO L93 Difference]: Finished difference Result 1340 states and 1827 transitions. [2020-11-28 03:20:46,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:46,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-11-28 03:20:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:46,354 INFO L225 Difference]: With dead ends: 1340 [2020-11-28 03:20:46,354 INFO L226 Difference]: Without dead ends: 801 [2020-11-28 03:20:46,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-11-28 03:20:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 562. [2020-11-28 03:20:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-28 03:20:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2020-11-28 03:20:46,409 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2020-11-28 03:20:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:46,410 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2020-11-28 03:20:46,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2020-11-28 03:20:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-28 03:20:46,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:46,411 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:46,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:20:46,412 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash -241327504, now seen corresponding path program 1 times [2020-11-28 03:20:46,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:46,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998119340] [2020-11-28 03:20:46,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:46,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998119340] [2020-11-28 03:20:46,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:46,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:46,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704967578] [2020-11-28 03:20:46,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:46,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:46,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:46,498 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand 3 states. [2020-11-28 03:20:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:46,635 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2020-11-28 03:20:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:46,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-28 03:20:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:46,644 INFO L225 Difference]: With dead ends: 1555 [2020-11-28 03:20:46,645 INFO L226 Difference]: Without dead ends: 1018 [2020-11-28 03:20:46,646 INFO L677 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 [2020-11-28 03:20:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-11-28 03:20:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2020-11-28 03:20:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-11-28 03:20:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2020-11-28 03:20:46,741 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2020-11-28 03:20:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:46,742 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2020-11-28 03:20:46,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2020-11-28 03:20:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-28 03:20:46,743 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:46,743 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:46,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:20:46,744 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash -794822095, now seen corresponding path program 1 times [2020-11-28 03:20:46,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:46,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090117423] [2020-11-28 03:20:46,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:20:46,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090117423] [2020-11-28 03:20:46,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:46,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:20:46,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305689958] [2020-11-28 03:20:46,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:46,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:46,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:46,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:46,827 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand 3 states. [2020-11-28 03:20:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:46,970 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2020-11-28 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:46,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-11-28 03:20:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:46,981 INFO L225 Difference]: With dead ends: 2328 [2020-11-28 03:20:46,981 INFO L226 Difference]: Without dead ends: 1624 [2020-11-28 03:20:46,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2020-11-28 03:20:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2020-11-28 03:20:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2020-11-28 03:20:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2020-11-28 03:20:47,119 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2020-11-28 03:20:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:47,120 INFO L481 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2020-11-28 03:20:47,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2020-11-28 03:20:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 03:20:47,121 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:47,122 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:47,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:20:47,122 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1952123894, now seen corresponding path program 1 times [2020-11-28 03:20:47,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:47,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068798487] [2020-11-28 03:20:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:47,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068798487] [2020-11-28 03:20:47,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:47,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:20:47,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736161953] [2020-11-28 03:20:47,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:20:47,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:47,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:20:47,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:47,212 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand 5 states. [2020-11-28 03:20:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:47,469 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2020-11-28 03:20:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:20:47,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-11-28 03:20:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:47,482 INFO L225 Difference]: With dead ends: 2606 [2020-11-28 03:20:47,483 INFO L226 Difference]: Without dead ends: 1600 [2020-11-28 03:20:47,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:20:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2020-11-28 03:20:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2020-11-28 03:20:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-11-28 03:20:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2020-11-28 03:20:47,611 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2020-11-28 03:20:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:47,612 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2020-11-28 03:20:47,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:20:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2020-11-28 03:20:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 03:20:47,614 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:47,614 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:47,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:20:47,615 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:47,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1529422068, now seen corresponding path program 1 times [2020-11-28 03:20:47,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:47,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359831737] [2020-11-28 03:20:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:47,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359831737] [2020-11-28 03:20:47,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:47,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:47,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099726628] [2020-11-28 03:20:47,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:47,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:47,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:47,673 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand 3 states. [2020-11-28 03:20:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:47,920 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2020-11-28 03:20:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:47,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-28 03:20:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:47,935 INFO L225 Difference]: With dead ends: 3754 [2020-11-28 03:20:47,935 INFO L226 Difference]: Without dead ends: 2454 [2020-11-28 03:20:47,938 INFO L677 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 [2020-11-28 03:20:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2020-11-28 03:20:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2020-11-28 03:20:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-11-28 03:20:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2020-11-28 03:20:48,152 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2020-11-28 03:20:48,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:48,153 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2020-11-28 03:20:48,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2020-11-28 03:20:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-28 03:20:48,155 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:48,155 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:48,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:20:48,156 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:48,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1900886728, now seen corresponding path program 1 times [2020-11-28 03:20:48,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:48,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389246178] [2020-11-28 03:20:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:48,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389246178] [2020-11-28 03:20:48,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:48,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:48,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378398269] [2020-11-28 03:20:48,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:48,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:48,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:48,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:48,213 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand 4 states. [2020-11-28 03:20:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:48,507 INFO L93 Difference]: Finished difference Result 4276 states and 5307 transitions. [2020-11-28 03:20:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:20:48,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-11-28 03:20:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:48,518 INFO L225 Difference]: With dead ends: 4276 [2020-11-28 03:20:48,518 INFO L226 Difference]: Without dead ends: 1875 [2020-11-28 03:20:48,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-11-28 03:20:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1871. [2020-11-28 03:20:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2020-11-28 03:20:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2020-11-28 03:20:48,708 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2020-11-28 03:20:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:48,708 INFO L481 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2020-11-28 03:20:48,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2020-11-28 03:20:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-28 03:20:48,718 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:48,719 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:48,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:20:48,719 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:48,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:48,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1840238380, now seen corresponding path program 1 times [2020-11-28 03:20:48,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:48,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613880622] [2020-11-28 03:20:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 03:20:48,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613880622] [2020-11-28 03:20:48,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:48,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:48,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453905906] [2020-11-28 03:20:48,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:48,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:48,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:48,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:48,789 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand 4 states. [2020-11-28 03:20:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:49,024 INFO L93 Difference]: Finished difference Result 3747 states and 4574 transitions. [2020-11-28 03:20:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:20:49,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-11-28 03:20:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:49,034 INFO L225 Difference]: With dead ends: 3747 [2020-11-28 03:20:49,034 INFO L226 Difference]: Without dead ends: 1634 [2020-11-28 03:20:49,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2020-11-28 03:20:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1596. [2020-11-28 03:20:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2020-11-28 03:20:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2020-11-28 03:20:49,160 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2020-11-28 03:20:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:49,161 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2020-11-28 03:20:49,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2020-11-28 03:20:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-28 03:20:49,163 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:49,163 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:49,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:20:49,164 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash 341678357, now seen corresponding path program 1 times [2020-11-28 03:20:49,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:49,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307063706] [2020-11-28 03:20:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:49,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307063706] [2020-11-28 03:20:49,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:49,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:49,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307509015] [2020-11-28 03:20:49,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:49,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:49,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:49,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:49,235 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand 3 states. [2020-11-28 03:20:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:49,377 INFO L93 Difference]: Finished difference Result 2909 states and 3525 transitions. [2020-11-28 03:20:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:49,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-11-28 03:20:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:49,385 INFO L225 Difference]: With dead ends: 2909 [2020-11-28 03:20:49,386 INFO L226 Difference]: Without dead ends: 1338 [2020-11-28 03:20:49,390 INFO L677 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 [2020-11-28 03:20:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2020-11-28 03:20:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2020-11-28 03:20:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-11-28 03:20:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1576 transitions. [2020-11-28 03:20:49,506 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1576 transitions. Word has length 94 [2020-11-28 03:20:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:49,507 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 1576 transitions. [2020-11-28 03:20:49,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1576 transitions. [2020-11-28 03:20:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-28 03:20:49,509 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:49,510 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:49,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:20:49,510 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:49,511 INFO L82 PathProgramCache]: Analyzing trace with hash 701412920, now seen corresponding path program 1 times [2020-11-28 03:20:49,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:49,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026530571] [2020-11-28 03:20:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:20:49,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026530571] [2020-11-28 03:20:49,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:49,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:49,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234321497] [2020-11-28 03:20:49,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:49,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:49,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:49,570 INFO L87 Difference]: Start difference. First operand 1330 states and 1576 transitions. Second operand 4 states. [2020-11-28 03:20:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:49,717 INFO L93 Difference]: Finished difference Result 2218 states and 2610 transitions. [2020-11-28 03:20:49,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:20:49,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-11-28 03:20:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:49,742 INFO L225 Difference]: With dead ends: 2218 [2020-11-28 03:20:49,742 INFO L226 Difference]: Without dead ends: 598 [2020-11-28 03:20:49,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-11-28 03:20:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 594. [2020-11-28 03:20:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-11-28 03:20:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2020-11-28 03:20:49,794 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2020-11-28 03:20:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:49,794 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2020-11-28 03:20:49,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2020-11-28 03:20:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-28 03:20:49,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:49,796 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:49,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:20:49,797 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1223381222, now seen corresponding path program 1 times [2020-11-28 03:20:49,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:49,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784407291] [2020-11-28 03:20:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:20:49,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784407291] [2020-11-28 03:20:49,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:49,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:49,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197101319] [2020-11-28 03:20:49,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:20:49,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:49,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:49,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:49,922 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2020-11-28 03:20:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:49,997 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2020-11-28 03:20:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:49,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-11-28 03:20:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:50,004 INFO L225 Difference]: With dead ends: 598 [2020-11-28 03:20:50,005 INFO L226 Difference]: Without dead ends: 596 [2020-11-28 03:20:50,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-11-28 03:20:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2020-11-28 03:20:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-11-28 03:20:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2020-11-28 03:20:50,073 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2020-11-28 03:20:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:50,073 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2020-11-28 03:20:50,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:20:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2020-11-28 03:20:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-28 03:20:50,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:50,076 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:50,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:20:50,076 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:50,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:50,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1585215284, now seen corresponding path program 1 times [2020-11-28 03:20:50,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:50,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831795415] [2020-11-28 03:20:50,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-28 03:20:50,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831795415] [2020-11-28 03:20:50,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:50,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:20:50,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270396389] [2020-11-28 03:20:50,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:20:50,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:50,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:20:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:20:50,142 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2020-11-28 03:20:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:50,266 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2020-11-28 03:20:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:20:50,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-11-28 03:20:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:20:50,272 INFO L225 Difference]: With dead ends: 1230 [2020-11-28 03:20:50,273 INFO L226 Difference]: Without dead ends: 900 [2020-11-28 03:20:50,274 INFO L677 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 [2020-11-28 03:20:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-11-28 03:20:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2020-11-28 03:20:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-11-28 03:20:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2020-11-28 03:20:50,352 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2020-11-28 03:20:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:20:50,353 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2020-11-28 03:20:50,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:20:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2020-11-28 03:20:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-28 03:20:50,354 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:20:50,355 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:50,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:20:50,355 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:20:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:50,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1659596600, now seen corresponding path program 1 times [2020-11-28 03:20:50,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:50,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470590284] [2020-11-28 03:20:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:50,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:50,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:50,474 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:50,474 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:20:50,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:20:50,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:20:50 BoogieIcfgContainer [2020-11-28 03:20:50,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:20:50,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:20:50,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:20:50,666 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:20:50,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:44" (3/4) ... [2020-11-28 03:20:50,668 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:20:50,807 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_31effdc4-c866-43f9-a08f-a71b8a7cb3af/bin/uautomizer/witness.graphml [2020-11-28 03:20:50,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:20:50,810 INFO L168 Benchmark]: Toolchain (without parser) took 8160.48 ms. Allocated memory was 98.6 MB in the beginning and 285.2 MB in the end (delta: 186.6 MB). Free memory was 61.5 MB in the beginning and 170.2 MB in the end (delta: -108.7 MB). Peak memory consumption was 78.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:50,811 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 98.6 MB. Free memory was 78.4 MB in the beginning and 78.3 MB in the end (delta: 65.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:20:50,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.39 ms. Allocated memory is still 98.6 MB. Free memory was 61.4 MB in the beginning and 72.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:50,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.34 ms. Allocated memory is still 98.6 MB. Free memory was 72.2 MB in the beginning and 69.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:50,812 INFO L168 Benchmark]: Boogie Preprocessor took 42.32 ms. Allocated memory is still 98.6 MB. Free memory was 69.7 MB in the beginning and 67.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:50,813 INFO L168 Benchmark]: RCFGBuilder took 919.40 ms. Allocated memory was 98.6 MB in the beginning and 136.3 MB in the end (delta: 37.7 MB). Free memory was 67.6 MB in the beginning and 104.2 MB in the end (delta: -36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:50,813 INFO L168 Benchmark]: TraceAbstraction took 6577.91 ms. Allocated memory was 136.3 MB in the beginning and 285.2 MB in the end (delta: 148.9 MB). Free memory was 104.2 MB in the beginning and 183.8 MB in the end (delta: -79.6 MB). Peak memory consumption was 71.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:50,813 INFO L168 Benchmark]: Witness Printer took 142.55 ms. Allocated memory is still 285.2 MB. Free memory was 182.8 MB in the beginning and 170.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:50,816 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 98.6 MB. Free memory was 78.4 MB in the beginning and 78.3 MB in the end (delta: 65.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 413.39 ms. Allocated memory is still 98.6 MB. Free memory was 61.4 MB in the beginning and 72.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.34 ms. Allocated memory is still 98.6 MB. Free memory was 72.2 MB in the beginning and 69.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.32 ms. Allocated memory is still 98.6 MB. Free memory was 69.7 MB in the beginning and 67.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 919.40 ms. Allocated memory was 98.6 MB in the beginning and 136.3 MB in the end (delta: 37.7 MB). Free memory was 67.6 MB in the beginning and 104.2 MB in the end (delta: -36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6577.91 ms. Allocated memory was 136.3 MB in the beginning and 285.2 MB in the end (delta: 148.9 MB). Free memory was 104.2 MB in the beginning and 183.8 MB in the end (delta: -79.6 MB). Peak memory consumption was 71.4 MB. Max. memory is 16.1 GB. * Witness Printer took 142.55 ms. Allocated memory is still 285.2 MB. Free memory was 182.8 MB in the beginning and 170.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; [L392] m_i = 1 [L393] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L432] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] kernel_st = 1 [L210] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L47] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L140] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L144] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L159] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 [L112] E_M = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L39] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L61] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L66] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L67] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L74] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L3] __assert_fail("0", "token_ring.01.cil-2.c", 3, "reach_error") VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.3s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4021 SDtfs, 5346 SDslu, 4017 SDs, 0 SdLazy, 454 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 1746 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1087 ConstructedInterpolants, 0 QuantifiedInterpolants, 147019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 204/204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...