./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.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_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/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 a08b839794d511e255b2cbb9b4715d014c32f56d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 20:31:01,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 20:31:01,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 20:31:01,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 20:31:01,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 20:31:01,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 20:31:01,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 20:31:01,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 20:31:01,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 20:31:01,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 20:31:01,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 20:31:01,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 20:31:01,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 20:31:01,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 20:31:01,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 20:31:01,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 20:31:01,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 20:31:01,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 20:31:01,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 20:31:01,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 20:31:01,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 20:31:01,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 20:31:01,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 20:31:01,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 20:31:01,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 20:31:01,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 20:31:01,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 20:31:01,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 20:31:01,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 20:31:01,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 20:31:01,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 20:31:01,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 20:31:01,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 20:31:01,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 20:31:01,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 20:31:01,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 20:31:01,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 20:31:01,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 20:31:01,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 20:31:01,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 20:31:01,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 20:31:01,669 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 20:31:01,707 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 20:31:01,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 20:31:01,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 20:31:01,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 20:31:01,709 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 20:31:01,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 20:31:01,710 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 20:31:01,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 20:31:01,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 20:31:01,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 20:31:01,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 20:31:01,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 20:31:01,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 20:31:01,712 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 20:31:01,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 20:31:01,713 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 20:31:01,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 20:31:01,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 20:31:01,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 20:31:01,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 20:31:01,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 20:31:01,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 20:31:01,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 20:31:01,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 20:31:01,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 20:31:01,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 20:31:01,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 20:31:01,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 20:31:01,716 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 20:31:01,716 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_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/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_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/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 -> a08b839794d511e255b2cbb9b4715d014c32f56d [2020-11-29 20:31:02,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 20:31:02,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 20:31:02,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 20:31:02,129 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 20:31:02,130 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 20:31:02,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-11-29 20:31:02,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/data/9bb319a4c/a0b9ab47e3034c39b3ed4fe664bf7199/FLAGb9ba38c27 [2020-11-29 20:31:02,872 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 20:31:02,872 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-11-29 20:31:02,884 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/data/9bb319a4c/a0b9ab47e3034c39b3ed4fe664bf7199/FLAGb9ba38c27 [2020-11-29 20:31:03,183 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/data/9bb319a4c/a0b9ab47e3034c39b3ed4fe664bf7199 [2020-11-29 20:31:03,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 20:31:03,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 20:31:03,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 20:31:03,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 20:31:03,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 20:31:03,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abacec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03, skipping insertion in model container [2020-11-29 20:31:03,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 20:31:03,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 20:31:03,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:31:03,571 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 20:31:03,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 20:31:03,665 INFO L208 MainTranslator]: Completed translation [2020-11-29 20:31:03,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03 WrapperNode [2020-11-29 20:31:03,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 20:31:03,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 20:31:03,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 20:31:03,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 20:31:03,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 20:31:03,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 20:31:03,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 20:31:03,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 20:31:03,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... [2020-11-29 20:31:03,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 20:31:03,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 20:31:03,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 20:31:03,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 20:31:03,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/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-29 20:31:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 20:31:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 20:31:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 20:31:03,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 20:31:05,207 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 20:31:05,207 INFO L298 CfgBuilder]: Removed 109 assume(true) statements. [2020-11-29 20:31:05,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:31:05 BoogieIcfgContainer [2020-11-29 20:31:05,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 20:31:05,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 20:31:05,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 20:31:05,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 20:31:05,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 08:31:03" (1/3) ... [2020-11-29 20:31:05,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e458dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:31:05, skipping insertion in model container [2020-11-29 20:31:05,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 08:31:03" (2/3) ... [2020-11-29 20:31:05,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e458dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 08:31:05, skipping insertion in model container [2020-11-29 20:31:05,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:31:05" (3/3) ... [2020-11-29 20:31:05,221 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-11-29 20:31:05,234 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 20:31:05,240 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 20:31:05,253 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-29 20:31:05,285 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 20:31:05,285 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 20:31:05,286 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 20:31:05,286 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 20:31:05,286 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 20:31:05,286 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 20:31:05,286 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 20:31:05,287 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 20:31:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2020-11-29 20:31:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:05,319 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:05,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:05,321 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2020-11-29 20:31:05,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:05,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232747886] [2020-11-29 20:31:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:05,548 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-29 20:31:05,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232747886] [2020-11-29 20:31:05,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:05,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:05,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763975180] [2020-11-29 20:31:05,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:05,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:05,575 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2020-11-29 20:31:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:05,662 INFO L93 Difference]: Finished difference Result 447 states and 699 transitions. [2020-11-29 20:31:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:05,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-29 20:31:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:05,690 INFO L225 Difference]: With dead ends: 447 [2020-11-29 20:31:05,691 INFO L226 Difference]: Without dead ends: 221 [2020-11-29 20:31:05,703 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-29 20:31:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-29 20:31:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-11-29 20:31:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-11-29 20:31:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2020-11-29 20:31:05,841 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2020-11-29 20:31:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:05,842 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2020-11-29 20:31:05,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2020-11-29 20:31:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:05,849 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:05,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:05,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 20:31:05,850 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:05,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2020-11-29 20:31:05,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:05,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80694669] [2020-11-29 20:31:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:05,988 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-29 20:31:05,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80694669] [2020-11-29 20:31:05,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:05,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:31:05,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566603092] [2020-11-29 20:31:05,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:05,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:05,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:05,998 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2020-11-29 20:31:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:06,087 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2020-11-29 20:31:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:06,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-29 20:31:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:06,096 INFO L225 Difference]: With dead ends: 595 [2020-11-29 20:31:06,096 INFO L226 Difference]: Without dead ends: 381 [2020-11-29 20:31:06,100 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-29 20:31:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2020-11-29 20:31:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2020-11-29 20:31:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-29 20:31:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2020-11-29 20:31:06,160 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2020-11-29 20:31:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:06,160 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2020-11-29 20:31:06,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2020-11-29 20:31:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:06,170 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:06,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:06,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 20:31:06,172 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2020-11-29 20:31:06,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:06,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379025329] [2020-11-29 20:31:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:06,236 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-29 20:31:06,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379025329] [2020-11-29 20:31:06,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:06,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:06,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233870089] [2020-11-29 20:31:06,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:06,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:06,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:06,239 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 4 states. [2020-11-29 20:31:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:06,335 INFO L93 Difference]: Finished difference Result 905 states and 1366 transitions. [2020-11-29 20:31:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:31:06,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-29 20:31:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:06,339 INFO L225 Difference]: With dead ends: 905 [2020-11-29 20:31:06,339 INFO L226 Difference]: Without dead ends: 536 [2020-11-29 20:31:06,341 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-29 20:31:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-11-29 20:31:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 377. [2020-11-29 20:31:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-29 20:31:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 567 transitions. [2020-11-29 20:31:06,365 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 567 transitions. Word has length 50 [2020-11-29 20:31:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:06,365 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 567 transitions. [2020-11-29 20:31:06,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 567 transitions. [2020-11-29 20:31:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:06,367 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:06,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:06,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 20:31:06,368 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash -794624073, now seen corresponding path program 1 times [2020-11-29 20:31:06,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:06,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859251473] [2020-11-29 20:31:06,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:06,460 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-29 20:31:06,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859251473] [2020-11-29 20:31:06,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:06,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:06,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286879835] [2020-11-29 20:31:06,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:06,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:06,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:06,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:06,465 INFO L87 Difference]: Start difference. First operand 377 states and 567 transitions. Second operand 4 states. [2020-11-29 20:31:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:06,600 INFO L93 Difference]: Finished difference Result 903 states and 1356 transitions. [2020-11-29 20:31:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:31:06,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-29 20:31:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:06,605 INFO L225 Difference]: With dead ends: 903 [2020-11-29 20:31:06,605 INFO L226 Difference]: Without dead ends: 535 [2020-11-29 20:31:06,607 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-29 20:31:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-11-29 20:31:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 377. [2020-11-29 20:31:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-29 20:31:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2020-11-29 20:31:06,639 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 50 [2020-11-29 20:31:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:06,639 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2020-11-29 20:31:06,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2020-11-29 20:31:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:06,643 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:06,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:06,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 20:31:06,644 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:06,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash -546477579, now seen corresponding path program 1 times [2020-11-29 20:31:06,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:06,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361122447] [2020-11-29 20:31:06,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:06,727 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-29 20:31:06,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361122447] [2020-11-29 20:31:06,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:06,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:31:06,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978257449] [2020-11-29 20:31:06,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:06,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:06,731 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand 3 states. [2020-11-29 20:31:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:06,806 INFO L93 Difference]: Finished difference Result 744 states and 1115 transitions. [2020-11-29 20:31:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:06,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-29 20:31:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:06,810 INFO L225 Difference]: With dead ends: 744 [2020-11-29 20:31:06,811 INFO L226 Difference]: Without dead ends: 377 [2020-11-29 20:31:06,812 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-29 20:31:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-11-29 20:31:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-11-29 20:31:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-29 20:31:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 548 transitions. [2020-11-29 20:31:06,840 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 548 transitions. Word has length 50 [2020-11-29 20:31:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:06,842 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 548 transitions. [2020-11-29 20:31:06,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 548 transitions. [2020-11-29 20:31:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:06,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:06,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:06,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 20:31:06,845 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:06,846 INFO L82 PathProgramCache]: Analyzing trace with hash -585918790, now seen corresponding path program 1 times [2020-11-29 20:31:06,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:06,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687154488] [2020-11-29 20:31:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:06,930 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-29 20:31:06,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687154488] [2020-11-29 20:31:06,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:06,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:06,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984915983] [2020-11-29 20:31:06,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:06,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:06,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:06,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:06,933 INFO L87 Difference]: Start difference. First operand 377 states and 548 transitions. Second operand 4 states. [2020-11-29 20:31:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:07,104 INFO L93 Difference]: Finished difference Result 878 states and 1277 transitions. [2020-11-29 20:31:07,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:31:07,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-29 20:31:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:07,108 INFO L225 Difference]: With dead ends: 878 [2020-11-29 20:31:07,108 INFO L226 Difference]: Without dead ends: 512 [2020-11-29 20:31:07,110 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-29 20:31:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-11-29 20:31:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 377. [2020-11-29 20:31:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-29 20:31:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 545 transitions. [2020-11-29 20:31:07,135 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 545 transitions. Word has length 50 [2020-11-29 20:31:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:07,139 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 545 transitions. [2020-11-29 20:31:07,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2020-11-29 20:31:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:07,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:07,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:07,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 20:31:07,141 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1957726088, now seen corresponding path program 1 times [2020-11-29 20:31:07,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:07,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684954787] [2020-11-29 20:31:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:07,224 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-29 20:31:07,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684954787] [2020-11-29 20:31:07,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:07,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:31:07,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23982268] [2020-11-29 20:31:07,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:07,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:07,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:07,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:07,226 INFO L87 Difference]: Start difference. First operand 377 states and 545 transitions. Second operand 3 states. [2020-11-29 20:31:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:07,292 INFO L93 Difference]: Finished difference Result 742 states and 1075 transitions. [2020-11-29 20:31:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:07,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-29 20:31:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:07,296 INFO L225 Difference]: With dead ends: 742 [2020-11-29 20:31:07,296 INFO L226 Difference]: Without dead ends: 377 [2020-11-29 20:31:07,297 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-29 20:31:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-11-29 20:31:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-11-29 20:31:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-29 20:31:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 529 transitions. [2020-11-29 20:31:07,322 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 529 transitions. Word has length 50 [2020-11-29 20:31:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:07,322 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 529 transitions. [2020-11-29 20:31:07,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 529 transitions. [2020-11-29 20:31:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:07,323 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:07,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:07,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 20:31:07,324 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:07,325 INFO L82 PathProgramCache]: Analyzing trace with hash -787989636, now seen corresponding path program 1 times [2020-11-29 20:31:07,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:07,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290805544] [2020-11-29 20:31:07,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:07,380 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-29 20:31:07,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290805544] [2020-11-29 20:31:07,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:07,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:31:07,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736682358] [2020-11-29 20:31:07,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:31:07,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:07,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:31:07,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:31:07,382 INFO L87 Difference]: Start difference. First operand 377 states and 529 transitions. Second operand 5 states. [2020-11-29 20:31:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:07,550 INFO L93 Difference]: Finished difference Result 981 states and 1389 transitions. [2020-11-29 20:31:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:31:07,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-11-29 20:31:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:07,554 INFO L225 Difference]: With dead ends: 981 [2020-11-29 20:31:07,555 INFO L226 Difference]: Without dead ends: 623 [2020-11-29 20:31:07,556 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-29 20:31:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-11-29 20:31:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 383. [2020-11-29 20:31:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-29 20:31:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 527 transitions. [2020-11-29 20:31:07,595 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 527 transitions. Word has length 50 [2020-11-29 20:31:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:07,596 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 527 transitions. [2020-11-29 20:31:07,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:31:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 527 transitions. [2020-11-29 20:31:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 20:31:07,597 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:07,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:07,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 20:31:07,597 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash -860376194, now seen corresponding path program 1 times [2020-11-29 20:31:07,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:07,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208358174] [2020-11-29 20:31:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:07,669 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-29 20:31:07,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208358174] [2020-11-29 20:31:07,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:07,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:07,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990793319] [2020-11-29 20:31:07,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:07,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:07,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:07,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:07,671 INFO L87 Difference]: Start difference. First operand 383 states and 527 transitions. Second operand 4 states. [2020-11-29 20:31:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:07,946 INFO L93 Difference]: Finished difference Result 1331 states and 1833 transitions. [2020-11-29 20:31:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:31:07,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-29 20:31:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:07,952 INFO L225 Difference]: With dead ends: 1331 [2020-11-29 20:31:07,953 INFO L226 Difference]: Without dead ends: 962 [2020-11-29 20:31:07,954 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-29 20:31:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-11-29 20:31:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 886. [2020-11-29 20:31:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2020-11-29 20:31:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1204 transitions. [2020-11-29 20:31:08,043 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1204 transitions. Word has length 50 [2020-11-29 20:31:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:08,044 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1204 transitions. [2020-11-29 20:31:08,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1204 transitions. [2020-11-29 20:31:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 20:31:08,045 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:08,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:08,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 20:31:08,046 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:08,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1987821321, now seen corresponding path program 1 times [2020-11-29 20:31:08,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:08,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838533842] [2020-11-29 20:31:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:08,125 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-29 20:31:08,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838533842] [2020-11-29 20:31:08,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:08,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:31:08,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282412741] [2020-11-29 20:31:08,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:31:08,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:08,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:31:08,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:31:08,128 INFO L87 Difference]: Start difference. First operand 886 states and 1204 transitions. Second operand 5 states. [2020-11-29 20:31:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:08,434 INFO L93 Difference]: Finished difference Result 2286 states and 3127 transitions. [2020-11-29 20:31:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:31:08,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-11-29 20:31:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:08,444 INFO L225 Difference]: With dead ends: 2286 [2020-11-29 20:31:08,444 INFO L226 Difference]: Without dead ends: 1424 [2020-11-29 20:31:08,446 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-29 20:31:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-11-29 20:31:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 913. [2020-11-29 20:31:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-11-29 20:31:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1218 transitions. [2020-11-29 20:31:08,531 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1218 transitions. Word has length 63 [2020-11-29 20:31:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:08,531 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1218 transitions. [2020-11-29 20:31:08,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:31:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1218 transitions. [2020-11-29 20:31:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 20:31:08,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:08,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:08,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 20:31:08,534 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash 616014023, now seen corresponding path program 1 times [2020-11-29 20:31:08,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:08,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529653464] [2020-11-29 20:31:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:08,590 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-29 20:31:08,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529653464] [2020-11-29 20:31:08,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:08,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:08,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648021536] [2020-11-29 20:31:08,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:08,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:08,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:08,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:08,593 INFO L87 Difference]: Start difference. First operand 913 states and 1218 transitions. Second operand 4 states. [2020-11-29 20:31:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:08,746 INFO L93 Difference]: Finished difference Result 2185 states and 2919 transitions. [2020-11-29 20:31:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:31:08,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-29 20:31:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:08,754 INFO L225 Difference]: With dead ends: 2185 [2020-11-29 20:31:08,754 INFO L226 Difference]: Without dead ends: 1305 [2020-11-29 20:31:08,756 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-29 20:31:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-11-29 20:31:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-11-29 20:31:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-11-29 20:31:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1205 transitions. [2020-11-29 20:31:08,842 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1205 transitions. Word has length 63 [2020-11-29 20:31:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:08,843 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1205 transitions. [2020-11-29 20:31:08,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1205 transitions. [2020-11-29 20:31:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 20:31:08,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:08,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:08,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 20:31:08,845 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:08,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:08,845 INFO L82 PathProgramCache]: Analyzing trace with hash 890773637, now seen corresponding path program 1 times [2020-11-29 20:31:08,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:08,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129230841] [2020-11-29 20:31:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:08,898 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-29 20:31:08,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129230841] [2020-11-29 20:31:08,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:08,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:08,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883961959] [2020-11-29 20:31:08,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:08,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:08,901 INFO L87 Difference]: Start difference. First operand 913 states and 1205 transitions. Second operand 4 states. [2020-11-29 20:31:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:09,085 INFO L93 Difference]: Finished difference Result 2184 states and 2889 transitions. [2020-11-29 20:31:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 20:31:09,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-29 20:31:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:09,095 INFO L225 Difference]: With dead ends: 2184 [2020-11-29 20:31:09,095 INFO L226 Difference]: Without dead ends: 1305 [2020-11-29 20:31:09,100 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-29 20:31:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-11-29 20:31:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-11-29 20:31:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-11-29 20:31:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1192 transitions. [2020-11-29 20:31:09,182 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1192 transitions. Word has length 63 [2020-11-29 20:31:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:09,182 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1192 transitions. [2020-11-29 20:31:09,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1192 transitions. [2020-11-29 20:31:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 20:31:09,186 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:09,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:09,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 20:31:09,187 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1592373511, now seen corresponding path program 1 times [2020-11-29 20:31:09,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:09,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750256221] [2020-11-29 20:31:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:09,223 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-29 20:31:09,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750256221] [2020-11-29 20:31:09,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:09,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:09,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863874824] [2020-11-29 20:31:09,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:09,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:09,226 INFO L87 Difference]: Start difference. First operand 913 states and 1192 transitions. Second operand 3 states. [2020-11-29 20:31:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:09,425 INFO L93 Difference]: Finished difference Result 2514 states and 3253 transitions. [2020-11-29 20:31:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:09,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-29 20:31:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:09,434 INFO L225 Difference]: With dead ends: 2514 [2020-11-29 20:31:09,434 INFO L226 Difference]: Without dead ends: 1638 [2020-11-29 20:31:09,436 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-29 20:31:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2020-11-29 20:31:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2020-11-29 20:31:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2020-11-29 20:31:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2079 transitions. [2020-11-29 20:31:09,615 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2079 transitions. Word has length 63 [2020-11-29 20:31:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:09,616 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2079 transitions. [2020-11-29 20:31:09,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2079 transitions. [2020-11-29 20:31:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 20:31:09,618 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:09,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:09,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 20:31:09,618 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:09,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1604417796, now seen corresponding path program 1 times [2020-11-29 20:31:09,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:09,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574345782] [2020-11-29 20:31:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:31:09,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574345782] [2020-11-29 20:31:09,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:09,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:09,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670772755] [2020-11-29 20:31:09,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:09,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:09,695 INFO L87 Difference]: Start difference. First operand 1638 states and 2079 transitions. Second operand 3 states. [2020-11-29 20:31:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:10,073 INFO L93 Difference]: Finished difference Result 4524 states and 5739 transitions. [2020-11-29 20:31:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:10,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-29 20:31:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:10,090 INFO L225 Difference]: With dead ends: 4524 [2020-11-29 20:31:10,090 INFO L226 Difference]: Without dead ends: 2956 [2020-11-29 20:31:10,093 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-29 20:31:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-11-29 20:31:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2916. [2020-11-29 20:31:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2020-11-29 20:31:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3671 transitions. [2020-11-29 20:31:10,359 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3671 transitions. Word has length 64 [2020-11-29 20:31:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:10,360 INFO L481 AbstractCegarLoop]: Abstraction has 2916 states and 3671 transitions. [2020-11-29 20:31:10,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3671 transitions. [2020-11-29 20:31:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 20:31:10,362 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:10,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:10,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 20:31:10,363 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1043718018, now seen corresponding path program 1 times [2020-11-29 20:31:10,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:10,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820569400] [2020-11-29 20:31:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:10,387 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-29 20:31:10,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820569400] [2020-11-29 20:31:10,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:10,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:10,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249840932] [2020-11-29 20:31:10,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:10,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:10,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:10,390 INFO L87 Difference]: Start difference. First operand 2916 states and 3671 transitions. Second operand 3 states. [2020-11-29 20:31:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:10,621 INFO L93 Difference]: Finished difference Result 5712 states and 7209 transitions. [2020-11-29 20:31:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:10,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-29 20:31:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:10,636 INFO L225 Difference]: With dead ends: 5712 [2020-11-29 20:31:10,636 INFO L226 Difference]: Without dead ends: 2854 [2020-11-29 20:31:10,641 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-29 20:31:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2020-11-29 20:31:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2854. [2020-11-29 20:31:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2854 states. [2020-11-29 20:31:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3601 transitions. [2020-11-29 20:31:10,914 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3601 transitions. Word has length 64 [2020-11-29 20:31:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:10,915 INFO L481 AbstractCegarLoop]: Abstraction has 2854 states and 3601 transitions. [2020-11-29 20:31:10,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3601 transitions. [2020-11-29 20:31:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 20:31:10,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:10,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:10,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 20:31:10,918 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash -691732721, now seen corresponding path program 1 times [2020-11-29 20:31:10,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:10,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282195441] [2020-11-29 20:31:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:10,974 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-29 20:31:10,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282195441] [2020-11-29 20:31:10,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:10,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:31:10,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485318078] [2020-11-29 20:31:10,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:10,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:10,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:10,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:10,979 INFO L87 Difference]: Start difference. First operand 2854 states and 3601 transitions. Second operand 3 states. [2020-11-29 20:31:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:11,478 INFO L93 Difference]: Finished difference Result 6838 states and 8679 transitions. [2020-11-29 20:31:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:11,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-11-29 20:31:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:11,505 INFO L225 Difference]: With dead ends: 6838 [2020-11-29 20:31:11,505 INFO L226 Difference]: Without dead ends: 4770 [2020-11-29 20:31:11,508 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-29 20:31:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2020-11-29 20:31:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3882. [2020-11-29 20:31:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3882 states. [2020-11-29 20:31:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 4899 transitions. [2020-11-29 20:31:11,809 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 4899 transitions. Word has length 65 [2020-11-29 20:31:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:11,809 INFO L481 AbstractCegarLoop]: Abstraction has 3882 states and 4899 transitions. [2020-11-29 20:31:11,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4899 transitions. [2020-11-29 20:31:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-29 20:31:11,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:11,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:11,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 20:31:11,813 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1437461722, now seen corresponding path program 1 times [2020-11-29 20:31:11,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:11,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66613667] [2020-11-29 20:31:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:11,861 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-29 20:31:11,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66613667] [2020-11-29 20:31:11,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:11,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:31:11,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025431326] [2020-11-29 20:31:11,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:31:11,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:31:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:31:11,863 INFO L87 Difference]: Start difference. First operand 3882 states and 4899 transitions. Second operand 5 states. [2020-11-29 20:31:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:12,538 INFO L93 Difference]: Finished difference Result 9686 states and 12267 transitions. [2020-11-29 20:31:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 20:31:12,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-11-29 20:31:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:12,593 INFO L225 Difference]: With dead ends: 9686 [2020-11-29 20:31:12,593 INFO L226 Difference]: Without dead ends: 5862 [2020-11-29 20:31:12,600 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-29 20:31:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2020-11-29 20:31:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 3930. [2020-11-29 20:31:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3930 states. [2020-11-29 20:31:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 4873 transitions. [2020-11-29 20:31:13,025 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 4873 transitions. Word has length 82 [2020-11-29 20:31:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:13,025 INFO L481 AbstractCegarLoop]: Abstraction has 3930 states and 4873 transitions. [2020-11-29 20:31:13,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:31:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 4873 transitions. [2020-11-29 20:31:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-29 20:31:13,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:13,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:13,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 20:31:13,040 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1269157672, now seen corresponding path program 1 times [2020-11-29 20:31:13,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:13,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761776833] [2020-11-29 20:31:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:13,116 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-29 20:31:13,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761776833] [2020-11-29 20:31:13,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:13,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:13,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109171623] [2020-11-29 20:31:13,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:13,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:13,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:13,125 INFO L87 Difference]: Start difference. First operand 3930 states and 4873 transitions. Second operand 3 states. [2020-11-29 20:31:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:13,897 INFO L93 Difference]: Finished difference Result 11242 states and 13901 transitions. [2020-11-29 20:31:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:13,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-11-29 20:31:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:13,912 INFO L225 Difference]: With dead ends: 11242 [2020-11-29 20:31:13,912 INFO L226 Difference]: Without dead ends: 7382 [2020-11-29 20:31:13,917 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-29 20:31:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2020-11-29 20:31:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7170. [2020-11-29 20:31:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7170 states. [2020-11-29 20:31:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 8765 transitions. [2020-11-29 20:31:14,486 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 8765 transitions. Word has length 82 [2020-11-29 20:31:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:14,487 INFO L481 AbstractCegarLoop]: Abstraction has 7170 states and 8765 transitions. [2020-11-29 20:31:14,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 8765 transitions. [2020-11-29 20:31:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-29 20:31:14,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:14,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 20:31:14,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 20:31:14,492 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:14,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1587172131, now seen corresponding path program 1 times [2020-11-29 20:31:14,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:14,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982397204] [2020-11-29 20:31:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:14,604 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-29 20:31:14,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982397204] [2020-11-29 20:31:14,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:14,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:31:14,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809617378] [2020-11-29 20:31:14,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:14,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:14,609 INFO L87 Difference]: Start difference. First operand 7170 states and 8765 transitions. Second operand 4 states. [2020-11-29 20:31:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:15,178 INFO L93 Difference]: Finished difference Result 12646 states and 15461 transitions. [2020-11-29 20:31:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:31:15,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-11-29 20:31:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:15,191 INFO L225 Difference]: With dead ends: 12646 [2020-11-29 20:31:15,191 INFO L226 Difference]: Without dead ends: 5513 [2020-11-29 20:31:15,201 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-29 20:31:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2020-11-29 20:31:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5509. [2020-11-29 20:31:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2020-11-29 20:31:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 6669 transitions. [2020-11-29 20:31:15,682 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 6669 transitions. Word has length 83 [2020-11-29 20:31:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:15,683 INFO L481 AbstractCegarLoop]: Abstraction has 5509 states and 6669 transitions. [2020-11-29 20:31:15,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 6669 transitions. [2020-11-29 20:31:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-11-29 20:31:15,688 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:15,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:15,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 20:31:15,689 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash -810228725, now seen corresponding path program 1 times [2020-11-29 20:31:15,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:15,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924791736] [2020-11-29 20:31:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:15,754 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-29 20:31:15,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924791736] [2020-11-29 20:31:15,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:15,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 20:31:15,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345088393] [2020-11-29 20:31:15,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:15,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:15,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:15,756 INFO L87 Difference]: Start difference. First operand 5509 states and 6669 transitions. Second operand 3 states. [2020-11-29 20:31:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:16,339 INFO L93 Difference]: Finished difference Result 12613 states and 15226 transitions. [2020-11-29 20:31:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:16,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-11-29 20:31:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:16,354 INFO L225 Difference]: With dead ends: 12613 [2020-11-29 20:31:16,354 INFO L226 Difference]: Without dead ends: 7130 [2020-11-29 20:31:16,363 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-29 20:31:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2020-11-29 20:31:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7082. [2020-11-29 20:31:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-11-29 20:31:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8483 transitions. [2020-11-29 20:31:17,138 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8483 transitions. Word has length 106 [2020-11-29 20:31:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:17,138 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8483 transitions. [2020-11-29 20:31:17,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8483 transitions. [2020-11-29 20:31:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-29 20:31:17,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:17,146 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:17,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 20:31:17,147 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 614427576, now seen corresponding path program 1 times [2020-11-29 20:31:17,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:17,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258527561] [2020-11-29 20:31:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:17,216 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-29 20:31:17,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258527561] [2020-11-29 20:31:17,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:17,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:31:17,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022359214] [2020-11-29 20:31:17,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:17,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:17,219 INFO L87 Difference]: Start difference. First operand 7082 states and 8483 transitions. Second operand 4 states. [2020-11-29 20:31:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:17,881 INFO L93 Difference]: Finished difference Result 12566 states and 15119 transitions. [2020-11-29 20:31:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:31:17,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2020-11-29 20:31:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:17,894 INFO L225 Difference]: With dead ends: 12566 [2020-11-29 20:31:17,895 INFO L226 Difference]: Without dead ends: 7094 [2020-11-29 20:31:17,903 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-29 20:31:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2020-11-29 20:31:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7082. [2020-11-29 20:31:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-11-29 20:31:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8447 transitions. [2020-11-29 20:31:18,522 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8447 transitions. Word has length 121 [2020-11-29 20:31:18,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:18,523 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8447 transitions. [2020-11-29 20:31:18,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8447 transitions. [2020-11-29 20:31:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-29 20:31:18,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:18,533 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:18,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 20:31:18,534 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1456346617, now seen corresponding path program 1 times [2020-11-29 20:31:18,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:18,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365113839] [2020-11-29 20:31:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 20:31:18,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365113839] [2020-11-29 20:31:18,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:18,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:31:18,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490623608] [2020-11-29 20:31:18,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:18,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:18,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:18,613 INFO L87 Difference]: Start difference. First operand 7082 states and 8447 transitions. Second operand 4 states. [2020-11-29 20:31:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:19,361 INFO L93 Difference]: Finished difference Result 14332 states and 17091 transitions. [2020-11-29 20:31:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:31:19,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2020-11-29 20:31:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:19,369 INFO L225 Difference]: With dead ends: 14332 [2020-11-29 20:31:19,369 INFO L226 Difference]: Without dead ends: 6492 [2020-11-29 20:31:19,380 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-29 20:31:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2020-11-29 20:31:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 6280. [2020-11-29 20:31:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-11-29 20:31:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7448 transitions. [2020-11-29 20:31:19,918 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7448 transitions. Word has length 147 [2020-11-29 20:31:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:19,919 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7448 transitions. [2020-11-29 20:31:19,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7448 transitions. [2020-11-29 20:31:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-29 20:31:19,925 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:19,926 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:19,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 20:31:19,926 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash -495516941, now seen corresponding path program 1 times [2020-11-29 20:31:19,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:19,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622023478] [2020-11-29 20:31:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:31:19,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622023478] [2020-11-29 20:31:19,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:19,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:19,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031377287] [2020-11-29 20:31:19,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:19,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:19,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:20,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:20,001 INFO L87 Difference]: Start difference. First operand 6280 states and 7448 transitions. Second operand 3 states. [2020-11-29 20:31:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:20,518 INFO L93 Difference]: Finished difference Result 11323 states and 13479 transitions. [2020-11-29 20:31:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:20,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-11-29 20:31:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:20,526 INFO L225 Difference]: With dead ends: 11323 [2020-11-29 20:31:20,526 INFO L226 Difference]: Without dead ends: 6304 [2020-11-29 20:31:20,534 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-29 20:31:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2020-11-29 20:31:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 6280. [2020-11-29 20:31:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-11-29 20:31:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7296 transitions. [2020-11-29 20:31:21,121 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7296 transitions. Word has length 147 [2020-11-29 20:31:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:21,122 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7296 transitions. [2020-11-29 20:31:21,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7296 transitions. [2020-11-29 20:31:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-29 20:31:21,127 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:21,128 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:21,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 20:31:21,128 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:21,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:21,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1875095521, now seen corresponding path program 1 times [2020-11-29 20:31:21,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:21,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052940255] [2020-11-29 20:31:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 20:31:21,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052940255] [2020-11-29 20:31:21,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:21,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:21,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243542730] [2020-11-29 20:31:21,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:21,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:21,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:21,205 INFO L87 Difference]: Start difference. First operand 6280 states and 7296 transitions. Second operand 3 states. [2020-11-29 20:31:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:21,647 INFO L93 Difference]: Finished difference Result 10747 states and 12514 transitions. [2020-11-29 20:31:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:21,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2020-11-29 20:31:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:21,655 INFO L225 Difference]: With dead ends: 10747 [2020-11-29 20:31:21,655 INFO L226 Difference]: Without dead ends: 6564 [2020-11-29 20:31:21,661 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-29 20:31:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2020-11-29 20:31:22,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6280. [2020-11-29 20:31:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-11-29 20:31:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7176 transitions. [2020-11-29 20:31:22,233 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7176 transitions. Word has length 149 [2020-11-29 20:31:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:22,233 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7176 transitions. [2020-11-29 20:31:22,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7176 transitions. [2020-11-29 20:31:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-29 20:31:22,241 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:22,241 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:22,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 20:31:22,241 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1711412734, now seen corresponding path program 1 times [2020-11-29 20:31:22,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:22,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852787389] [2020-11-29 20:31:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 20:31:22,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852787389] [2020-11-29 20:31:22,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:22,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:22,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817746723] [2020-11-29 20:31:22,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:22,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:22,325 INFO L87 Difference]: Start difference. First operand 6280 states and 7176 transitions. Second operand 3 states. [2020-11-29 20:31:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:22,802 INFO L93 Difference]: Finished difference Result 10912 states and 12510 transitions. [2020-11-29 20:31:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:22,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2020-11-29 20:31:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:22,807 INFO L225 Difference]: With dead ends: 10912 [2020-11-29 20:31:22,807 INFO L226 Difference]: Without dead ends: 4668 [2020-11-29 20:31:22,813 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-29 20:31:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2020-11-29 20:31:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4652. [2020-11-29 20:31:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4652 states. [2020-11-29 20:31:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4652 states to 4652 states and 5255 transitions. [2020-11-29 20:31:23,234 INFO L78 Accepts]: Start accepts. Automaton has 4652 states and 5255 transitions. Word has length 150 [2020-11-29 20:31:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:23,235 INFO L481 AbstractCegarLoop]: Abstraction has 4652 states and 5255 transitions. [2020-11-29 20:31:23,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4652 states and 5255 transitions. [2020-11-29 20:31:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-29 20:31:23,240 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:23,241 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:23,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 20:31:23,241 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash 473818913, now seen corresponding path program 1 times [2020-11-29 20:31:23,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:23,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516934832] [2020-11-29 20:31:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 20:31:23,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516934832] [2020-11-29 20:31:23,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:23,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 20:31:23,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460961686] [2020-11-29 20:31:23,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 20:31:23,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:23,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 20:31:23,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 20:31:23,338 INFO L87 Difference]: Start difference. First operand 4652 states and 5255 transitions. Second operand 4 states. [2020-11-29 20:31:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:23,741 INFO L93 Difference]: Finished difference Result 7044 states and 7901 transitions. [2020-11-29 20:31:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:31:23,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-11-29 20:31:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:23,744 INFO L225 Difference]: With dead ends: 7044 [2020-11-29 20:31:23,745 INFO L226 Difference]: Without dead ends: 1511 [2020-11-29 20:31:23,749 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-29 20:31:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2020-11-29 20:31:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1507. [2020-11-29 20:31:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-11-29 20:31:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1613 transitions. [2020-11-29 20:31:23,929 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1613 transitions. Word has length 150 [2020-11-29 20:31:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:23,930 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1613 transitions. [2020-11-29 20:31:23,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 20:31:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1613 transitions. [2020-11-29 20:31:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-11-29 20:31:23,934 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:23,935 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:23,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 20:31:23,935 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:23,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash 776824727, now seen corresponding path program 1 times [2020-11-29 20:31:23,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:23,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729341833] [2020-11-29 20:31:23,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 20:31:24,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729341833] [2020-11-29 20:31:24,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:24,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 20:31:24,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680173970] [2020-11-29 20:31:24,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 20:31:24,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 20:31:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:31:24,150 INFO L87 Difference]: Start difference. First operand 1507 states and 1613 transitions. Second operand 5 states. [2020-11-29 20:31:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:24,359 INFO L93 Difference]: Finished difference Result 1507 states and 1613 transitions. [2020-11-29 20:31:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 20:31:24,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2020-11-29 20:31:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:24,361 INFO L225 Difference]: With dead ends: 1507 [2020-11-29 20:31:24,361 INFO L226 Difference]: Without dead ends: 1505 [2020-11-29 20:31:24,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 20:31:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-11-29 20:31:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2020-11-29 20:31:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2020-11-29 20:31:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2020-11-29 20:31:24,535 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 152 [2020-11-29 20:31:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:24,536 INFO L481 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2020-11-29 20:31:24,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 20:31:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2020-11-29 20:31:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-11-29 20:31:24,539 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:24,539 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:24,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 20:31:24,539 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash 46651813, now seen corresponding path program 1 times [2020-11-29 20:31:24,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:24,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990426539] [2020-11-29 20:31:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 20:31:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-11-29 20:31:24,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990426539] [2020-11-29 20:31:24,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 20:31:24,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 20:31:24,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710783860] [2020-11-29 20:31:24,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 20:31:24,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 20:31:24,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 20:31:24,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 20:31:24,600 INFO L87 Difference]: Start difference. First operand 1505 states and 1610 transitions. Second operand 3 states. [2020-11-29 20:31:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 20:31:24,875 INFO L93 Difference]: Finished difference Result 2761 states and 2943 transitions. [2020-11-29 20:31:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 20:31:24,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-11-29 20:31:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 20:31:24,878 INFO L225 Difference]: With dead ends: 2761 [2020-11-29 20:31:24,878 INFO L226 Difference]: Without dead ends: 2125 [2020-11-29 20:31:24,879 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-29 20:31:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2020-11-29 20:31:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1507. [2020-11-29 20:31:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-11-29 20:31:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1612 transitions. [2020-11-29 20:31:25,050 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1612 transitions. Word has length 156 [2020-11-29 20:31:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 20:31:25,050 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1612 transitions. [2020-11-29 20:31:25,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 20:31:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1612 transitions. [2020-11-29 20:31:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-11-29 20:31:25,053 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 20:31:25,053 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 20:31:25,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-29 20:31:25,054 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 20:31:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 20:31:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1208769336, now seen corresponding path program 1 times [2020-11-29 20:31:25,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 20:31:25,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008540142] [2020-11-29 20:31:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 20:31:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:31:25,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:31:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 20:31:25,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 20:31:25,217 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 20:31:25,217 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 20:31:25,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-29 20:31:25,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 08:31:25 BoogieIcfgContainer [2020-11-29 20:31:25,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 20:31:25,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 20:31:25,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 20:31:25,440 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 20:31:25,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 08:31:05" (3/4) ... [2020-11-29 20:31:25,443 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 20:31:25,636 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fa5791bf-f3a9-4e4d-be9a-711e16f824a2/bin/uautomizer/witness.graphml [2020-11-29 20:31:25,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 20:31:25,638 INFO L168 Benchmark]: Toolchain (without parser) took 22450.86 ms. Allocated memory was 102.8 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 69.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 183.0 MB. Max. memory is 16.1 GB. [2020-11-29 20:31:25,639 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 73.4 MB. Free memory was 31.9 MB in the beginning and 31.8 MB in the end (delta: 35.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 20:31:25,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.73 ms. Allocated memory is still 102.8 MB. Free memory was 69.9 MB in the beginning and 75.8 MB in the end (delta: -6.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 20:31:25,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.04 ms. Allocated memory is still 102.8 MB. Free memory was 75.8 MB in the beginning and 72.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 20:31:25,640 INFO L168 Benchmark]: Boogie Preprocessor took 43.17 ms. Allocated memory is still 102.8 MB. Free memory was 72.8 MB in the beginning and 70.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:31:25,641 INFO L168 Benchmark]: RCFGBuilder took 1442.64 ms. Allocated memory is still 102.8 MB. Free memory was 70.1 MB in the beginning and 61.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. [2020-11-29 20:31:25,641 INFO L168 Benchmark]: TraceAbstraction took 20227.23 ms. Allocated memory was 102.8 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 61.3 MB in the beginning and 1.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 152.7 MB. Max. memory is 16.1 GB. [2020-11-29 20:31:25,641 INFO L168 Benchmark]: Witness Printer took 196.31 ms. Allocated memory is still 2.1 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-29 20:31:25,643 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.28 ms. Allocated memory is still 73.4 MB. Free memory was 31.9 MB in the beginning and 31.8 MB in the end (delta: 35.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 478.73 ms. Allocated memory is still 102.8 MB. Free memory was 69.9 MB in the beginning and 75.8 MB in the end (delta: -6.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.04 ms. Allocated memory is still 102.8 MB. Free memory was 75.8 MB in the beginning and 72.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.17 ms. Allocated memory is still 102.8 MB. Free memory was 72.8 MB in the beginning and 70.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1442.64 ms. Allocated memory is still 102.8 MB. Free memory was 70.1 MB in the beginning and 61.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20227.23 ms. Allocated memory was 102.8 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 61.3 MB in the beginning and 1.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 152.7 MB. Max. memory is 16.1 GB. * Witness Printer took 196.31 ms. Allocated memory is still 2.1 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 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 t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] int local ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L602] int __retres1 ; [L516] m_i = 1 [L517] t1_i = 1 [L518] t2_i = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] kernel_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L235] COND TRUE m_i == 1 [L236] m_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L240] COND TRUE t1_i == 1 [L241] t1_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L245] COND TRUE t2_i == 1 [L246] t2_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L348] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L353] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L358] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L363] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L368] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L373] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L182] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L186] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L189] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L205] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L208] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L220] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L386] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L391] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L396] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L401] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L406] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L411] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L557] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] kernel_st = 1 [L281] int tmp ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L98] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L134] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND TRUE m_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L53] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] __retres1 = 0 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L182] return (__retres1); VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L186] int __retres1 ; VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L189] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] COND TRUE E_1 == 1 [L191] __retres1 = 1 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L201] return (__retres1); VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] t1_st = 0 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L205] int __retres1 ; VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] __retres1 = 0 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L220] return (__retres1); VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L60] E_1 = 2 [L61] m_pc = 1 [L62] m_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L98] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L101] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] token += 1 [L118] E_2 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L171] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] __retres1 = 0 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L182] return (__retres1); VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L186] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L201] return (__retres1); VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L205] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] COND TRUE E_2 == 1 [L210] __retres1 = 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L220] return (__retres1); VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] t2_st = 0 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L120] E_2 = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L134] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L137] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] token += 1 [L154] E_M = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L171] COND TRUE E_M == 1 [L172] __retres1 = 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L182] return (__retres1); VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] m_st = 0 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L186] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L201] return (__retres1); VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L205] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L220] return (__retres1); VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L156] E_M = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L285] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L255] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L276] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L45] COND TRUE m_pc == 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L67] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L80] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L3] __assert_fail("0", "token_ring.02.cil-2.c", 3, "reach_error") VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.9s, OverallIterations: 29, TraceHistogramMax: 3, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9959 SDtfs, 12538 SDslu, 9564 SDs, 0 SdLazy, 712 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7170occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 6361 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2577 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2392 ConstructedInterpolants, 0 QuantifiedInterpolants, 476043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 361/361 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...