./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.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_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/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 f6768ec4cb10c0d030986cdc2e459713dbcdaadd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:49:37,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:49:37,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:49:37,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:49:37,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:49:37,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:49:37,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:49:37,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:49:37,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:49:37,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:49:37,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:49:37,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:49:37,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:49:37,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:49:37,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:49:37,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:49:37,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:49:37,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:49:38,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:49:38,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:49:38,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:49:38,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:49:38,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:49:38,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:49:38,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:49:38,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:49:38,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:49:38,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:49:38,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:49:38,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:49:38,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:49:38,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:49:38,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:49:38,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:49:38,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:49:38,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:49:38,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:49:38,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:49:38,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:49:38,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:49:38,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:49:38,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 19:49:38,113 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:49:38,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:49:38,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:49:38,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:49:38,117 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:49:38,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:49:38,117 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:49:38,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:49:38,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:49:38,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:49:38,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:49:38,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:49:38,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:49:38,120 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:49:38,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:49:38,121 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:49:38,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:49:38,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:49:38,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:49:38,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:49:38,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:49:38,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:49:38,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:49:38,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:49:38,123 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:49:38,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:49:38,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:49:38,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:49:38,125 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:49:38,125 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_a7737478-fa6d-4057-9abf-baae88e3dd03/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_a7737478-fa6d-4057-9abf-baae88e3dd03/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 -> f6768ec4cb10c0d030986cdc2e459713dbcdaadd [2020-11-29 19:49:38,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:49:38,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:49:38,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:49:38,520 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:49:38,522 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:49:38,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-11-29 19:49:38,634 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/data/99a98eaa7/6593f10896c3450ca781de02624c1ff7/FLAG8da7769ee [2020-11-29 19:49:39,176 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:49:39,177 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-11-29 19:49:39,189 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/data/99a98eaa7/6593f10896c3450ca781de02624c1ff7/FLAG8da7769ee [2020-11-29 19:49:39,510 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/data/99a98eaa7/6593f10896c3450ca781de02624c1ff7 [2020-11-29 19:49:39,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:49:39,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:49:39,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:49:39,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:49:39,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:49:39,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:49:39" (1/1) ... [2020-11-29 19:49:39,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cacec2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:39, skipping insertion in model container [2020-11-29 19:49:39,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:49:39" (1/1) ... [2020-11-29 19:49:39,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:49:39,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:49:39,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:49:39,947 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:49:40,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:49:40,027 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:49:40,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40 WrapperNode [2020-11-29 19:49:40,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:49:40,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:49:40,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:49:40,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:49:40,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:49:40,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:49:40,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:49:40,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:49:40,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... [2020-11-29 19:49:40,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:49:40,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:49:40,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:49:40,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:49:40,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/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 19:49:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:49:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:49:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:49:40,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:49:41,857 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:49:41,857 INFO L298 CfgBuilder]: Removed 121 assume(true) statements. [2020-11-29 19:49:41,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:49:41 BoogieIcfgContainer [2020-11-29 19:49:41,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:49:41,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:49:41,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:49:41,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:49:41,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:49:39" (1/3) ... [2020-11-29 19:49:41,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4608a250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:49:41, skipping insertion in model container [2020-11-29 19:49:41,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:49:40" (2/3) ... [2020-11-29 19:49:41,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4608a250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:49:41, skipping insertion in model container [2020-11-29 19:49:41,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:49:41" (3/3) ... [2020-11-29 19:49:41,876 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2020-11-29 19:49:41,895 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:49:41,901 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 19:49:41,915 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 19:49:41,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:49:41,967 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:49:41,967 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:49:41,967 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:49:41,968 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:49:41,968 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:49:41,968 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:49:41,968 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:49:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states. [2020-11-29 19:49:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:42,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:42,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:42,018 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:42,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:42,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1838342379, now seen corresponding path program 1 times [2020-11-29 19:49:42,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:42,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096448175] [2020-11-29 19:49:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:42,301 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 19:49:42,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096448175] [2020-11-29 19:49:42,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:42,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:49:42,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229147009] [2020-11-29 19:49:42,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:42,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:42,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:42,335 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 3 states. [2020-11-29 19:49:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:42,427 INFO L93 Difference]: Finished difference Result 548 states and 858 transitions. [2020-11-29 19:49:42,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:42,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:42,453 INFO L225 Difference]: With dead ends: 548 [2020-11-29 19:49:42,453 INFO L226 Difference]: Without dead ends: 272 [2020-11-29 19:49:42,459 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 19:49:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-11-29 19:49:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2020-11-29 19:49:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-11-29 19:49:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 412 transitions. [2020-11-29 19:49:42,546 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 412 transitions. Word has length 61 [2020-11-29 19:49:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:42,546 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 412 transitions. [2020-11-29 19:49:42,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 412 transitions. [2020-11-29 19:49:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:42,550 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:42,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:42,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:49:42,551 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1195707667, now seen corresponding path program 1 times [2020-11-29 19:49:42,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:42,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129793036] [2020-11-29 19:49:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:42,699 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 19:49:42,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129793036] [2020-11-29 19:49:42,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:42,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:42,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205858041] [2020-11-29 19:49:42,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:42,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:42,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:42,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:42,705 INFO L87 Difference]: Start difference. First operand 272 states and 412 transitions. Second operand 3 states. [2020-11-29 19:49:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:42,899 INFO L93 Difference]: Finished difference Result 730 states and 1104 transitions. [2020-11-29 19:49:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:42,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:42,905 INFO L225 Difference]: With dead ends: 730 [2020-11-29 19:49:42,909 INFO L226 Difference]: Without dead ends: 466 [2020-11-29 19:49:42,912 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 19:49:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-11-29 19:49:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2020-11-29 19:49:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-29 19:49:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 694 transitions. [2020-11-29 19:49:43,004 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 694 transitions. Word has length 61 [2020-11-29 19:49:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:43,004 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 694 transitions. [2020-11-29 19:49:43,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 694 transitions. [2020-11-29 19:49:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:43,007 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:43,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:43,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:49:43,008 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash 266288339, now seen corresponding path program 1 times [2020-11-29 19:49:43,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:43,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704804014] [2020-11-29 19:49:43,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:43,147 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 19:49:43,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704804014] [2020-11-29 19:49:43,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:43,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:43,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960253114] [2020-11-29 19:49:43,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:43,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:43,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:43,158 INFO L87 Difference]: Start difference. First operand 464 states and 694 transitions. Second operand 3 states. [2020-11-29 19:49:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:43,222 INFO L93 Difference]: Finished difference Result 919 states and 1375 transitions. [2020-11-29 19:49:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:43,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:43,228 INFO L225 Difference]: With dead ends: 919 [2020-11-29 19:49:43,228 INFO L226 Difference]: Without dead ends: 464 [2020-11-29 19:49:43,231 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 19:49:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-29 19:49:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-29 19:49:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-29 19:49:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 686 transitions. [2020-11-29 19:49:43,284 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 686 transitions. Word has length 61 [2020-11-29 19:49:43,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:43,285 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 686 transitions. [2020-11-29 19:49:43,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 686 transitions. [2020-11-29 19:49:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:43,293 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:43,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:43,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 19:49:43,293 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash 710189013, now seen corresponding path program 1 times [2020-11-29 19:49:43,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:43,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805378868] [2020-11-29 19:49:43,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:43,385 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 19:49:43,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805378868] [2020-11-29 19:49:43,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:43,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:43,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281934837] [2020-11-29 19:49:43,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:43,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:43,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:43,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:43,391 INFO L87 Difference]: Start difference. First operand 464 states and 686 transitions. Second operand 3 states. [2020-11-29 19:49:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:43,441 INFO L93 Difference]: Finished difference Result 918 states and 1358 transitions. [2020-11-29 19:49:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:43,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:43,446 INFO L225 Difference]: With dead ends: 918 [2020-11-29 19:49:43,447 INFO L226 Difference]: Without dead ends: 464 [2020-11-29 19:49:43,448 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 19:49:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-29 19:49:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-29 19:49:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-29 19:49:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 678 transitions. [2020-11-29 19:49:43,478 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 678 transitions. Word has length 61 [2020-11-29 19:49:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:43,481 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 678 transitions. [2020-11-29 19:49:43,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 678 transitions. [2020-11-29 19:49:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:43,487 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:43,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:43,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 19:49:43,488 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1623736427, now seen corresponding path program 1 times [2020-11-29 19:49:43,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:43,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460307759] [2020-11-29 19:49:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:43,566 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 19:49:43,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460307759] [2020-11-29 19:49:43,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:43,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:43,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428399574] [2020-11-29 19:49:43,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:43,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:43,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:43,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:43,568 INFO L87 Difference]: Start difference. First operand 464 states and 678 transitions. Second operand 3 states. [2020-11-29 19:49:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:43,624 INFO L93 Difference]: Finished difference Result 917 states and 1341 transitions. [2020-11-29 19:49:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:43,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:43,629 INFO L225 Difference]: With dead ends: 917 [2020-11-29 19:49:43,629 INFO L226 Difference]: Without dead ends: 464 [2020-11-29 19:49:43,630 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 19:49:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-29 19:49:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-29 19:49:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-29 19:49:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 670 transitions. [2020-11-29 19:49:43,659 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 670 transitions. Word has length 61 [2020-11-29 19:49:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:43,660 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 670 transitions. [2020-11-29 19:49:43,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 670 transitions. [2020-11-29 19:49:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:43,661 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:43,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:43,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 19:49:43,662 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash -175003691, now seen corresponding path program 1 times [2020-11-29 19:49:43,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:43,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514548665] [2020-11-29 19:49:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:43,751 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 19:49:43,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514548665] [2020-11-29 19:49:43,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:43,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:43,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163421935] [2020-11-29 19:49:43,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:43,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:43,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:43,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:43,754 INFO L87 Difference]: Start difference. First operand 464 states and 670 transitions. Second operand 3 states. [2020-11-29 19:49:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:43,839 INFO L93 Difference]: Finished difference Result 916 states and 1324 transitions. [2020-11-29 19:49:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:43,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:43,844 INFO L225 Difference]: With dead ends: 916 [2020-11-29 19:49:43,844 INFO L226 Difference]: Without dead ends: 464 [2020-11-29 19:49:43,846 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 19:49:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-29 19:49:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-29 19:49:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-29 19:49:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 654 transitions. [2020-11-29 19:49:43,878 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 654 transitions. Word has length 61 [2020-11-29 19:49:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:43,878 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 654 transitions. [2020-11-29 19:49:43,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 654 transitions. [2020-11-29 19:49:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:43,880 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:43,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:43,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 19:49:43,881 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:43,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:43,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1945036492, now seen corresponding path program 1 times [2020-11-29 19:49:43,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:43,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840427497] [2020-11-29 19:49:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:44,006 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 19:49:44,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840427497] [2020-11-29 19:49:44,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:44,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:44,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360183024] [2020-11-29 19:49:44,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:44,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:44,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:44,013 INFO L87 Difference]: Start difference. First operand 464 states and 654 transitions. Second operand 3 states. [2020-11-29 19:49:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:44,109 INFO L93 Difference]: Finished difference Result 914 states and 1289 transitions. [2020-11-29 19:49:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:44,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:44,114 INFO L225 Difference]: With dead ends: 914 [2020-11-29 19:49:44,114 INFO L226 Difference]: Without dead ends: 464 [2020-11-29 19:49:44,116 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 19:49:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-29 19:49:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-29 19:49:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-29 19:49:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 638 transitions. [2020-11-29 19:49:44,153 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 638 transitions. Word has length 61 [2020-11-29 19:49:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:44,154 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 638 transitions. [2020-11-29 19:49:44,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 638 transitions. [2020-11-29 19:49:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:44,155 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:44,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:44,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 19:49:44,156 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:44,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1902661357, now seen corresponding path program 1 times [2020-11-29 19:49:44,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:44,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095233299] [2020-11-29 19:49:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:44,256 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 19:49:44,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095233299] [2020-11-29 19:49:44,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:44,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:49:44,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717587095] [2020-11-29 19:49:44,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:49:44,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:49:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:49:44,259 INFO L87 Difference]: Start difference. First operand 464 states and 638 transitions. Second operand 5 states. [2020-11-29 19:49:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:44,548 INFO L93 Difference]: Finished difference Result 1468 states and 2029 transitions. [2020-11-29 19:49:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:49:44,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-11-29 19:49:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:44,556 INFO L225 Difference]: With dead ends: 1468 [2020-11-29 19:49:44,556 INFO L226 Difference]: Without dead ends: 1025 [2020-11-29 19:49:44,557 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 19:49:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2020-11-29 19:49:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 479. [2020-11-29 19:49:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-11-29 19:49:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 648 transitions. [2020-11-29 19:49:44,600 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 648 transitions. Word has length 61 [2020-11-29 19:49:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:44,600 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 648 transitions. [2020-11-29 19:49:44,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:49:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 648 transitions. [2020-11-29 19:49:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:44,601 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:44,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:44,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 19:49:44,602 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:44,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1654514863, now seen corresponding path program 1 times [2020-11-29 19:49:44,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:44,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99815927] [2020-11-29 19:49:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:44,689 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 19:49:44,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99815927] [2020-11-29 19:49:44,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:44,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:49:44,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936829778] [2020-11-29 19:49:44,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:49:44,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:49:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:49:44,697 INFO L87 Difference]: Start difference. First operand 479 states and 648 transitions. Second operand 5 states. [2020-11-29 19:49:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:44,940 INFO L93 Difference]: Finished difference Result 1256 states and 1713 transitions. [2020-11-29 19:49:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:49:44,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-11-29 19:49:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:44,947 INFO L225 Difference]: With dead ends: 1256 [2020-11-29 19:49:44,948 INFO L226 Difference]: Without dead ends: 805 [2020-11-29 19:49:44,950 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 19:49:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-11-29 19:49:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 485. [2020-11-29 19:49:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-11-29 19:49:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 646 transitions. [2020-11-29 19:49:45,001 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 646 transitions. Word has length 61 [2020-11-29 19:49:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:45,001 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 646 transitions. [2020-11-29 19:49:45,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:49:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 646 transitions. [2020-11-29 19:49:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:45,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:45,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:45,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 19:49:45,003 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2048881649, now seen corresponding path program 1 times [2020-11-29 19:49:45,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:45,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057636040] [2020-11-29 19:49:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:45,101 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 19:49:45,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057636040] [2020-11-29 19:49:45,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:45,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:49:45,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86849107] [2020-11-29 19:49:45,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:49:45,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:49:45,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:49:45,105 INFO L87 Difference]: Start difference. First operand 485 states and 646 transitions. Second operand 5 states. [2020-11-29 19:49:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:45,417 INFO L93 Difference]: Finished difference Result 1610 states and 2151 transitions. [2020-11-29 19:49:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:49:45,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-11-29 19:49:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:45,427 INFO L225 Difference]: With dead ends: 1610 [2020-11-29 19:49:45,427 INFO L226 Difference]: Without dead ends: 1160 [2020-11-29 19:49:45,429 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 19:49:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-11-29 19:49:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 515. [2020-11-29 19:49:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-11-29 19:49:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 676 transitions. [2020-11-29 19:49:45,489 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 676 transitions. Word has length 61 [2020-11-29 19:49:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:45,490 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 676 transitions. [2020-11-29 19:49:45,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:49:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 676 transitions. [2020-11-29 19:49:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:45,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:45,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:45,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 19:49:45,492 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2026249395, now seen corresponding path program 1 times [2020-11-29 19:49:45,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:45,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974547821] [2020-11-29 19:49:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:45,574 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 19:49:45,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974547821] [2020-11-29 19:49:45,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:45,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:49:45,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202968068] [2020-11-29 19:49:45,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:49:45,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:49:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:49:45,578 INFO L87 Difference]: Start difference. First operand 515 states and 676 transitions. Second operand 5 states. [2020-11-29 19:49:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:45,810 INFO L93 Difference]: Finished difference Result 1397 states and 1850 transitions. [2020-11-29 19:49:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:49:45,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-11-29 19:49:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:45,820 INFO L225 Difference]: With dead ends: 1397 [2020-11-29 19:49:45,821 INFO L226 Difference]: Without dead ends: 927 [2020-11-29 19:49:45,822 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 19:49:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-11-29 19:49:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 521. [2020-11-29 19:49:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-11-29 19:49:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 674 transitions. [2020-11-29 19:49:45,884 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 674 transitions. Word has length 61 [2020-11-29 19:49:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:45,885 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 674 transitions. [2020-11-29 19:49:45,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:49:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 674 transitions. [2020-11-29 19:49:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:45,887 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:45,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:45,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 19:49:45,887 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2134704395, now seen corresponding path program 1 times [2020-11-29 19:49:45,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:45,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408842958] [2020-11-29 19:49:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:45,961 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 19:49:45,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408842958] [2020-11-29 19:49:45,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:45,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:45,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227676670] [2020-11-29 19:49:45,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:45,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:45,965 INFO L87 Difference]: Start difference. First operand 521 states and 674 transitions. Second operand 3 states. [2020-11-29 19:49:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:46,092 INFO L93 Difference]: Finished difference Result 1005 states and 1299 transitions. [2020-11-29 19:49:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:46,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:46,097 INFO L225 Difference]: With dead ends: 1005 [2020-11-29 19:49:46,098 INFO L226 Difference]: Without dead ends: 497 [2020-11-29 19:49:46,102 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 19:49:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-11-29 19:49:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2020-11-29 19:49:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-11-29 19:49:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 626 transitions. [2020-11-29 19:49:46,162 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 626 transitions. Word has length 61 [2020-11-29 19:49:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:46,162 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 626 transitions. [2020-11-29 19:49:46,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 626 transitions. [2020-11-29 19:49:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-29 19:49:46,164 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:46,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:46,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 19:49:46,164 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash 140559689, now seen corresponding path program 1 times [2020-11-29 19:49:46,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:46,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400457063] [2020-11-29 19:49:46,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:46,218 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 19:49:46,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400457063] [2020-11-29 19:49:46,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:46,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:49:46,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522418764] [2020-11-29 19:49:46,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:46,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:46,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:46,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:46,226 INFO L87 Difference]: Start difference. First operand 497 states and 626 transitions. Second operand 3 states. [2020-11-29 19:49:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:46,379 INFO L93 Difference]: Finished difference Result 1368 states and 1714 transitions. [2020-11-29 19:49:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:46,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-29 19:49:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:46,390 INFO L225 Difference]: With dead ends: 1368 [2020-11-29 19:49:46,390 INFO L226 Difference]: Without dead ends: 920 [2020-11-29 19:49:46,392 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 19:49:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2020-11-29 19:49:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 891. [2020-11-29 19:49:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2020-11-29 19:49:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1103 transitions. [2020-11-29 19:49:46,492 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1103 transitions. Word has length 61 [2020-11-29 19:49:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:46,494 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1103 transitions. [2020-11-29 19:49:46,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1103 transitions. [2020-11-29 19:49:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-29 19:49:46,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:46,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:46,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 19:49:46,496 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 327530686, now seen corresponding path program 1 times [2020-11-29 19:49:46,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:46,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138718548] [2020-11-29 19:49:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:46,566 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 19:49:46,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138718548] [2020-11-29 19:49:46,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:46,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:49:46,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507225458] [2020-11-29 19:49:46,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:46,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:46,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:46,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:46,570 INFO L87 Difference]: Start difference. First operand 891 states and 1103 transitions. Second operand 3 states. [2020-11-29 19:49:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:46,757 INFO L93 Difference]: Finished difference Result 2319 states and 2877 transitions. [2020-11-29 19:49:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:46,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-11-29 19:49:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:46,767 INFO L225 Difference]: With dead ends: 2319 [2020-11-29 19:49:46,768 INFO L226 Difference]: Without dead ends: 1522 [2020-11-29 19:49:46,771 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 19:49:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2020-11-29 19:49:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1520. [2020-11-29 19:49:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-11-29 19:49:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1870 transitions. [2020-11-29 19:49:46,949 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1870 transitions. Word has length 62 [2020-11-29 19:49:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:46,950 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 1870 transitions. [2020-11-29 19:49:46,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1870 transitions. [2020-11-29 19:49:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 19:49:46,951 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:46,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:46,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 19:49:46,952 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash -479572275, now seen corresponding path program 1 times [2020-11-29 19:49:46,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:46,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811033012] [2020-11-29 19:49:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:47,014 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 19:49:47,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811033012] [2020-11-29 19:49:47,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:47,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:49:47,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106679070] [2020-11-29 19:49:47,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:47,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:47,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:47,017 INFO L87 Difference]: Start difference. First operand 1520 states and 1870 transitions. Second operand 3 states. [2020-11-29 19:49:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:47,318 INFO L93 Difference]: Finished difference Result 4144 states and 5092 transitions. [2020-11-29 19:49:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:47,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-29 19:49:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:47,337 INFO L225 Difference]: With dead ends: 4144 [2020-11-29 19:49:47,337 INFO L226 Difference]: Without dead ends: 2718 [2020-11-29 19:49:47,342 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 19:49:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2020-11-29 19:49:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2716. [2020-11-29 19:49:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2020-11-29 19:49:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3314 transitions. [2020-11-29 19:49:47,653 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3314 transitions. Word has length 63 [2020-11-29 19:49:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:47,653 INFO L481 AbstractCegarLoop]: Abstraction has 2716 states and 3314 transitions. [2020-11-29 19:49:47,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3314 transitions. [2020-11-29 19:49:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 19:49:47,655 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:47,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:47,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 19:49:47,656 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash -45843189, now seen corresponding path program 1 times [2020-11-29 19:49:47,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:47,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552416382] [2020-11-29 19:49:47,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:47,688 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 19:49:47,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552416382] [2020-11-29 19:49:47,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:47,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:49:47,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193608354] [2020-11-29 19:49:47,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:47,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:47,694 INFO L87 Difference]: Start difference. First operand 2716 states and 3314 transitions. Second operand 3 states. [2020-11-29 19:49:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:48,001 INFO L93 Difference]: Finished difference Result 5252 states and 6425 transitions. [2020-11-29 19:49:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:48,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-29 19:49:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:48,019 INFO L225 Difference]: With dead ends: 5252 [2020-11-29 19:49:48,019 INFO L226 Difference]: Without dead ends: 2630 [2020-11-29 19:49:48,024 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 19:49:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2020-11-29 19:49:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630. [2020-11-29 19:49:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2020-11-29 19:49:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3216 transitions. [2020-11-29 19:49:48,312 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3216 transitions. Word has length 63 [2020-11-29 19:49:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:48,313 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 3216 transitions. [2020-11-29 19:49:48,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3216 transitions. [2020-11-29 19:49:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 19:49:48,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:48,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:49:48,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 19:49:48,315 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -709022745, now seen corresponding path program 1 times [2020-11-29 19:49:48,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:48,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816349830] [2020-11-29 19:49:48,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:48,386 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 19:49:48,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816349830] [2020-11-29 19:49:48,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:48,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:48,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20492038] [2020-11-29 19:49:48,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:48,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:48,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:48,390 INFO L87 Difference]: Start difference. First operand 2630 states and 3216 transitions. Second operand 3 states. [2020-11-29 19:49:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:48,945 INFO L93 Difference]: Finished difference Result 7634 states and 9339 transitions. [2020-11-29 19:49:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:48,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-29 19:49:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:48,979 INFO L225 Difference]: With dead ends: 7634 [2020-11-29 19:49:48,979 INFO L226 Difference]: Without dead ends: 5074 [2020-11-29 19:49:48,984 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 19:49:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2020-11-29 19:49:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5042. [2020-11-29 19:49:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2020-11-29 19:49:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 6106 transitions. [2020-11-29 19:49:49,585 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 6106 transitions. Word has length 64 [2020-11-29 19:49:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:49,586 INFO L481 AbstractCegarLoop]: Abstraction has 5042 states and 6106 transitions. [2020-11-29 19:49:49,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 6106 transitions. [2020-11-29 19:49:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-29 19:49:49,589 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:49,589 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2020-11-29 19:49:49,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 19:49:49,590 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1717276157, now seen corresponding path program 1 times [2020-11-29 19:49:49,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:49,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771133528] [2020-11-29 19:49:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:49:49,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771133528] [2020-11-29 19:49:49,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:49,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:49:49,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531498876] [2020-11-29 19:49:49,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:49:49,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:49,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:49:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:49:49,653 INFO L87 Difference]: Start difference. First operand 5042 states and 6106 transitions. Second operand 4 states. [2020-11-29 19:49:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:50,802 INFO L93 Difference]: Finished difference Result 14910 states and 18027 transitions. [2020-11-29 19:49:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:49:50,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-11-29 19:49:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:50,850 INFO L225 Difference]: With dead ends: 14910 [2020-11-29 19:49:50,850 INFO L226 Difference]: Without dead ends: 7496 [2020-11-29 19:49:50,863 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 19:49:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7496 states. [2020-11-29 19:49:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7496 to 7496. [2020-11-29 19:49:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7496 states. [2020-11-29 19:49:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 9042 transitions. [2020-11-29 19:49:51,741 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 9042 transitions. Word has length 81 [2020-11-29 19:49:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:51,742 INFO L481 AbstractCegarLoop]: Abstraction has 7496 states and 9042 transitions. [2020-11-29 19:49:51,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:49:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 9042 transitions. [2020-11-29 19:49:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-11-29 19:49:51,749 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:51,750 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2020-11-29 19:49:51,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 19:49:51,750 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1115959489, now seen corresponding path program 1 times [2020-11-29 19:49:51,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:51,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552715065] [2020-11-29 19:49:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-29 19:49:51,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552715065] [2020-11-29 19:49:51,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:51,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:51,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908762751] [2020-11-29 19:49:51,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:51,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:51,856 INFO L87 Difference]: Start difference. First operand 7496 states and 9042 transitions. Second operand 3 states. [2020-11-29 19:49:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:52,845 INFO L93 Difference]: Finished difference Result 17102 states and 20603 transitions. [2020-11-29 19:49:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:52,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-11-29 19:49:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:52,891 INFO L225 Difference]: With dead ends: 17102 [2020-11-29 19:49:52,891 INFO L226 Difference]: Without dead ends: 9662 [2020-11-29 19:49:52,904 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 19:49:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9662 states. [2020-11-29 19:49:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9662 to 9614. [2020-11-29 19:49:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2020-11-29 19:49:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 11518 transitions. [2020-11-29 19:49:53,866 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 11518 transitions. Word has length 110 [2020-11-29 19:49:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:53,866 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 11518 transitions. [2020-11-29 19:49:53,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 11518 transitions. [2020-11-29 19:49:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-29 19:49:53,874 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:53,874 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2020-11-29 19:49:53,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 19:49:53,875 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash 577449217, now seen corresponding path program 1 times [2020-11-29 19:49:53,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:53,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693938371] [2020-11-29 19:49:53,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:49:53,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693938371] [2020-11-29 19:49:53,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:53,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:49:53,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085195952] [2020-11-29 19:49:53,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:49:53,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:49:53,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:49:53,942 INFO L87 Difference]: Start difference. First operand 9614 states and 11518 transitions. Second operand 4 states. [2020-11-29 19:49:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:54,902 INFO L93 Difference]: Finished difference Result 17020 states and 20462 transitions. [2020-11-29 19:49:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:49:54,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2020-11-29 19:49:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:54,925 INFO L225 Difference]: With dead ends: 17020 [2020-11-29 19:49:54,925 INFO L226 Difference]: Without dead ends: 9616 [2020-11-29 19:49:54,937 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 19:49:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2020-11-29 19:49:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 9614. [2020-11-29 19:49:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2020-11-29 19:49:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 11476 transitions. [2020-11-29 19:49:56,055 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 11476 transitions. Word has length 113 [2020-11-29 19:49:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:56,055 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 11476 transitions. [2020-11-29 19:49:56,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:49:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 11476 transitions. [2020-11-29 19:49:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-29 19:49:56,067 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:56,067 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1] [2020-11-29 19:49:56,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 19:49:56,068 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash 163247736, now seen corresponding path program 1 times [2020-11-29 19:49:56,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:56,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397708132] [2020-11-29 19:49:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-29 19:49:56,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397708132] [2020-11-29 19:49:56,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:56,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:49:56,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093415890] [2020-11-29 19:49:56,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:49:56,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:49:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:49:56,200 INFO L87 Difference]: Start difference. First operand 9614 states and 11476 transitions. Second operand 3 states. [2020-11-29 19:49:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:57,074 INFO L93 Difference]: Finished difference Result 21076 states and 25107 transitions. [2020-11-29 19:49:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:49:57,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-11-29 19:49:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:57,101 INFO L225 Difference]: With dead ends: 21076 [2020-11-29 19:49:57,101 INFO L226 Difference]: Without dead ends: 11504 [2020-11-29 19:49:57,116 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 19:49:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11504 states. [2020-11-29 19:49:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11504 to 11440. [2020-11-29 19:49:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-11-29 19:49:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13564 transitions. [2020-11-29 19:49:58,097 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13564 transitions. Word has length 142 [2020-11-29 19:49:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:58,097 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13564 transitions. [2020-11-29 19:49:58,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:49:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13564 transitions. [2020-11-29 19:49:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-29 19:49:58,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:49:58,110 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2020-11-29 19:49:58,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 19:49:58,110 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:49:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:49:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1331585155, now seen corresponding path program 1 times [2020-11-29 19:49:58,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:49:58,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516629504] [2020-11-29 19:49:58,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:49:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:49:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:49:58,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516629504] [2020-11-29 19:49:58,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:49:58,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:49:58,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687932017] [2020-11-29 19:49:58,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:49:58,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:49:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:49:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:49:58,190 INFO L87 Difference]: Start difference. First operand 11440 states and 13564 transitions. Second operand 4 states. [2020-11-29 19:49:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:49:59,081 INFO L93 Difference]: Finished difference Result 20966 states and 24946 transitions. [2020-11-29 19:49:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:49:59,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-11-29 19:49:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:49:59,113 INFO L225 Difference]: With dead ends: 20966 [2020-11-29 19:49:59,114 INFO L226 Difference]: Without dead ends: 11442 [2020-11-29 19:49:59,128 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 19:49:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2020-11-29 19:49:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11440. [2020-11-29 19:49:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-11-29 19:49:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13484 transitions. [2020-11-29 19:49:59,996 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13484 transitions. Word has length 145 [2020-11-29 19:49:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:49:59,996 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13484 transitions. [2020-11-29 19:49:59,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:49:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13484 transitions. [2020-11-29 19:50:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-11-29 19:50:00,009 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:50:00,010 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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 19:50:00,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 19:50:00,010 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:50:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:50:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093230, now seen corresponding path program 1 times [2020-11-29 19:50:00,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:50:00,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746045571] [2020-11-29 19:50:00,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:50:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:50:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:50:00,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746045571] [2020-11-29 19:50:00,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:50:00,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:50:00,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681352018] [2020-11-29 19:50:00,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:50:00,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:50:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:50:00,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:50:00,099 INFO L87 Difference]: Start difference. First operand 11440 states and 13484 transitions. Second operand 3 states. [2020-11-29 19:50:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:50:00,940 INFO L93 Difference]: Finished difference Result 19782 states and 23399 transitions. [2020-11-29 19:50:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:50:00,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-11-29 19:50:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:50:00,981 INFO L225 Difference]: With dead ends: 19782 [2020-11-29 19:50:00,981 INFO L226 Difference]: Without dead ends: 11472 [2020-11-29 19:50:00,999 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 19:50:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2020-11-29 19:50:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11440. [2020-11-29 19:50:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-11-29 19:50:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13276 transitions. [2020-11-29 19:50:02,186 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13276 transitions. Word has length 174 [2020-11-29 19:50:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:50:02,187 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13276 transitions. [2020-11-29 19:50:02,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:50:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13276 transitions. [2020-11-29 19:50:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-11-29 19:50:02,203 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:50:02,204 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:02,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 19:50:02,204 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:50:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:50:02,205 INFO L82 PathProgramCache]: Analyzing trace with hash 807546521, now seen corresponding path program 1 times [2020-11-29 19:50:02,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:50:02,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745487612] [2020-11-29 19:50:02,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:50:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:50:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:50:02,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745487612] [2020-11-29 19:50:02,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:50:02,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:50:02,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077037605] [2020-11-29 19:50:02,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:50:02,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:50:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:50:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:50:02,307 INFO L87 Difference]: Start difference. First operand 11440 states and 13276 transitions. Second operand 3 states. [2020-11-29 19:50:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:50:03,283 INFO L93 Difference]: Finished difference Result 18390 states and 21415 transitions. [2020-11-29 19:50:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:50:03,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-11-29 19:50:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:50:03,299 INFO L225 Difference]: With dead ends: 18390 [2020-11-29 19:50:03,299 INFO L226 Difference]: Without dead ends: 11440 [2020-11-29 19:50:03,305 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 19:50:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11440 states. [2020-11-29 19:50:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11440 to 11410. [2020-11-29 19:50:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11410 states. [2020-11-29 19:50:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11410 states to 11410 states and 13082 transitions. [2020-11-29 19:50:04,105 INFO L78 Accepts]: Start accepts. Automaton has 11410 states and 13082 transitions. Word has length 176 [2020-11-29 19:50:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:50:04,105 INFO L481 AbstractCegarLoop]: Abstraction has 11410 states and 13082 transitions. [2020-11-29 19:50:04,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:50:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 11410 states and 13082 transitions. [2020-11-29 19:50:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-29 19:50:04,117 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:50:04,117 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:04,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 19:50:04,118 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:50:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:50:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 251088387, now seen corresponding path program 1 times [2020-11-29 19:50:04,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:50:04,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298198846] [2020-11-29 19:50:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:50:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:50:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 19:50:04,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298198846] [2020-11-29 19:50:04,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:50:04,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:50:04,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846599822] [2020-11-29 19:50:04,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:50:04,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:50:04,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:50:04,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:50:04,186 INFO L87 Difference]: Start difference. First operand 11410 states and 13082 transitions. Second operand 3 states. [2020-11-29 19:50:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:50:04,941 INFO L93 Difference]: Finished difference Result 22664 states and 25781 transitions. [2020-11-29 19:50:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:50:04,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-11-29 19:50:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:50:04,951 INFO L225 Difference]: With dead ends: 22664 [2020-11-29 19:50:04,951 INFO L226 Difference]: Without dead ends: 6788 [2020-11-29 19:50:04,963 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 19:50:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6788 states. [2020-11-29 19:50:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6788 to 6580. [2020-11-29 19:50:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6580 states. [2020-11-29 19:50:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7246 transitions. [2020-11-29 19:50:05,452 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7246 transitions. Word has length 178 [2020-11-29 19:50:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:50:05,454 INFO L481 AbstractCegarLoop]: Abstraction has 6580 states and 7246 transitions. [2020-11-29 19:50:05,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:50:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7246 transitions. [2020-11-29 19:50:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-29 19:50:05,462 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:50:05,463 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:05,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 19:50:05,463 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:50:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:50:05,464 INFO L82 PathProgramCache]: Analyzing trace with hash -32931800, now seen corresponding path program 1 times [2020-11-29 19:50:05,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:50:05,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011034350] [2020-11-29 19:50:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:50:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:50:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:50:05,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011034350] [2020-11-29 19:50:05,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:50:05,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:50:05,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248984431] [2020-11-29 19:50:05,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:50:05,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:50:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:50:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:50:05,532 INFO L87 Difference]: Start difference. First operand 6580 states and 7246 transitions. Second operand 3 states. [2020-11-29 19:50:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:50:05,964 INFO L93 Difference]: Finished difference Result 11554 states and 12749 transitions. [2020-11-29 19:50:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:50:05,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-11-29 19:50:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:50:05,971 INFO L225 Difference]: With dead ends: 11554 [2020-11-29 19:50:05,971 INFO L226 Difference]: Without dead ends: 6580 [2020-11-29 19:50:05,974 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 19:50:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2020-11-29 19:50:06,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6580. [2020-11-29 19:50:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6580 states. [2020-11-29 19:50:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7168 transitions. [2020-11-29 19:50:06,426 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7168 transitions. Word has length 180 [2020-11-29 19:50:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:50:06,426 INFO L481 AbstractCegarLoop]: Abstraction has 6580 states and 7168 transitions. [2020-11-29 19:50:06,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:50:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7168 transitions. [2020-11-29 19:50:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-11-29 19:50:06,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:50:06,434 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:06,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 19:50:06,435 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:50:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:50:06,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1382104249, now seen corresponding path program 1 times [2020-11-29 19:50:06,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:50:06,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165620577] [2020-11-29 19:50:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:50:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:50:06,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:50:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:50:06,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:50:06,559 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:50:06,559 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 19:50:06,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 19:50:06,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:50:06 BoogieIcfgContainer [2020-11-29 19:50:06,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:50:06,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:50:06,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:50:06,808 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:50:06,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:49:41" (3/4) ... [2020-11-29 19:50:06,811 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 19:50:07,025 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7737478-fa6d-4057-9abf-baae88e3dd03/bin/uautomizer/witness.graphml [2020-11-29 19:50:07,026 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:50:07,028 INFO L168 Benchmark]: Toolchain (without parser) took 27512.90 ms. Allocated memory was 81.8 MB in the beginning and 2.6 GB in the end (delta: 2.6 GB). Free memory was 46.6 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 588.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:50:07,029 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 81.8 MB. Free memory is still 63.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:50:07,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.58 ms. Allocated memory is still 81.8 MB. Free memory was 46.4 MB in the beginning and 56.3 MB in the end (delta: -9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:50:07,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.17 ms. Allocated memory is still 81.8 MB. Free memory was 56.3 MB in the beginning and 52.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:50:07,030 INFO L168 Benchmark]: Boogie Preprocessor took 61.69 ms. Allocated memory is still 81.8 MB. Free memory was 52.7 MB in the beginning and 49.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:50:07,031 INFO L168 Benchmark]: RCFGBuilder took 1634.62 ms. Allocated memory was 81.8 MB in the beginning and 104.9 MB in the end (delta: 23.1 MB). Free memory was 49.8 MB in the beginning and 38.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:50:07,031 INFO L168 Benchmark]: TraceAbstraction took 24944.43 ms. Allocated memory was 104.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 37.5 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 530.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:50:07,035 INFO L168 Benchmark]: Witness Printer took 219.22 ms. Allocated memory is still 2.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 28.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:50:07,038 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.33 ms. Allocated memory is still 81.8 MB. Free memory is still 63.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 511.58 ms. Allocated memory is still 81.8 MB. Free memory was 46.4 MB in the beginning and 56.3 MB in the end (delta: -9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 133.17 ms. Allocated memory is still 81.8 MB. Free memory was 56.3 MB in the beginning and 52.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.69 ms. Allocated memory is still 81.8 MB. Free memory was 52.7 MB in the beginning and 49.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1634.62 ms. Allocated memory was 81.8 MB in the beginning and 104.9 MB in the end (delta: 23.1 MB). Free memory was 49.8 MB in the beginning and 38.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24944.43 ms. Allocated memory was 104.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 37.5 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 530.4 MB. Max. memory is 16.1 GB. * Witness Printer took 219.22 ms. Allocated memory is still 2.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 28.3 MB). Peak memory consumption was 27.3 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: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int m_st ; [L22] int t1_st ; [L23] int t2_st ; [L24] int t3_st ; [L25] int m_i ; [L26] int t1_i ; [L27] int t2_i ; [L28] int t3_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=0, t3_pc=0, t3_st=0] [L689] int __retres1 ; [L602] m_i = 1 [L603] t1_i = 1 [L604] t2_i = 1 [L605] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L630] int kernel_st ; [L631] int tmp ; [L632] int tmp___0 ; [L636] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L273] COND TRUE m_i == 1 [L274] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L278] COND TRUE t1_i == 1 [L279] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L283] COND TRUE t2_i == 1 [L284] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L288] COND TRUE t3_i == 1 [L289] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L410] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L415] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L420] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L425] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L430] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L435] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L440] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L189] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L208] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L227] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L239] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L246] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L256] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L258] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L453] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L458] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L463] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L468] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L473] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L478] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L483] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L644] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L647] kernel_st = 1 [L329] int tmp ; VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L333] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L298] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L324] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L86] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L97] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L121] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L132] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L156] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L167] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L169] t3_pc = 1 [L170] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L333] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L298] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L324] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND TRUE \read(tmp_ndt_1) [L348] m_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L45] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L56] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L59] E_1 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND TRUE E_1 == 1 [L210] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] tmp___0 = is_transmit1_triggered() [L510] COND TRUE \read(tmp___0) [L511] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L224] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L243] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L61] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L66] m_pc = 1 [L67] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L86] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L89] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L105] E_2 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L224] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND TRUE E_2 == 1 [L229] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] tmp___1 = is_transmit2_triggered() [L518] COND TRUE \read(tmp___1) [L519] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L243] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L107] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L121] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L124] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L140] E_3 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND TRUE E_3 == 1 [L248] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] tmp___2 = is_transmit3_triggered() [L526] COND TRUE \read(tmp___2) [L527] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L142] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L132] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L156] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L159] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L3] __assert_fail("0", "transmitter.03.cil.c", 3, "reach_error") VAL [E_1=2, E_2=2, E_3=2, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 277 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.5s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10958 SDtfs, 11119 SDslu, 8762 SDs, 0 SdLazy, 604 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11440occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 2370 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2526 NumberOfCodeBlocks, 2526 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2318 ConstructedInterpolants, 0 QuantifiedInterpolants, 405898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 171/171 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...