./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa --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 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:37:57,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:37:57,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:37:58,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:37:58,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:37:58,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:37:58,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:37:58,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:37:58,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:37:58,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:37:58,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:37:58,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:37:58,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:37:58,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:37:58,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:37:58,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:37:58,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:37:58,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:37:58,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:37:58,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:37:58,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:37:58,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:37:58,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:37:58,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:37:58,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:37:58,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:37:58,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:37:58,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:37:58,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:37:58,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:37:58,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:37:58,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:37:58,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:37:58,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:37:58,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:37:58,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:37:58,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:37:58,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:37:58,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:37:58,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:37:58,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:37:58,057 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 01:37:58,074 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:37:58,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:37:58,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:37:58,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:37:58,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:37:58,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:37:58,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:37:58,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:37:58,076 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:37:58,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:37:58,076 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:37:58,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:37:58,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:37:58,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:37:58,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:37:58,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:37:58,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:37:58,077 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:37:58,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:37:58,077 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:37:58,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:37:58,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:37:58,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:37:58,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:37:58,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:37:58,078 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:37:58,079 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_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/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_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa 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 -> 53db286b74a116c4cb3fd4f087c7d403ff5102019365af3310fff7597395a239 [2021-12-07 01:37:58,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:37:58,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:37:58,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:37:58,256 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:37:58,256 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:37:58,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2021-12-07 01:37:58,301 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/data/ff1fd2e0a/332cc3f7d28f4ca1bc0246ea5d3878af/FLAGbbc465c2c [2021-12-07 01:37:58,722 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:37:58,723 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2021-12-07 01:37:58,733 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/data/ff1fd2e0a/332cc3f7d28f4ca1bc0246ea5d3878af/FLAGbbc465c2c [2021-12-07 01:37:58,744 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/data/ff1fd2e0a/332cc3f7d28f4ca1bc0246ea5d3878af [2021-12-07 01:37:58,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:37:58,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:37:58,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:37:58,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:37:58,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:37:58,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:37:58" (1/1) ... [2021-12-07 01:37:58,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c9c312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:58, skipping insertion in model container [2021-12-07 01:37:58,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:37:58" (1/1) ... [2021-12-07 01:37:58,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:37:58,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:37:58,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[914,927] [2021-12-07 01:37:58,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[7125,7138] [2021-12-07 01:37:58,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:37:59,005 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:37:59,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[914,927] [2021-12-07 01:37:59,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.05.cil-1.c[7125,7138] [2021-12-07 01:37:59,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:37:59,068 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:37:59,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59 WrapperNode [2021-12-07 01:37:59,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:37:59,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:37:59,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:37:59,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:37:59,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,114 INFO L137 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 635 [2021-12-07 01:37:59,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:37:59,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:37:59,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:37:59,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:37:59,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:37:59,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:37:59,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:37:59,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:37:59,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (1/1) ... [2021-12-07 01:37:59,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:37:59,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:37:59,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:37:59,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:37:59,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:37:59,218 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-07 01:37:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-07 01:37:59,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-07 01:37:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-07 01:37:59,219 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-07 01:37:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-07 01:37:59,219 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-07 01:37:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-07 01:37:59,219 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-07 01:37:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-07 01:37:59,219 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-07 01:37:59,220 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-07 01:37:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-07 01:37:59,220 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-07 01:37:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-07 01:37:59,220 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-07 01:37:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-07 01:37:59,220 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-07 01:37:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-07 01:37:59,220 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-07 01:37:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-07 01:37:59,221 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-07 01:37:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:37:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-07 01:37:59,221 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-07 01:37:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-07 01:37:59,221 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-07 01:37:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:37:59,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:37:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-07 01:37:59,221 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-07 01:37:59,294 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:37:59,295 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:37:59,739 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:37:59,749 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:37:59,749 INFO L301 CfgBuilder]: Removed 12 assume(true) statements. [2021-12-07 01:37:59,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:59 BoogieIcfgContainer [2021-12-07 01:37:59,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:37:59,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:37:59,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:37:59,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:37:59,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:37:58" (1/3) ... [2021-12-07 01:37:59,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a994571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:37:59, skipping insertion in model container [2021-12-07 01:37:59,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:59" (2/3) ... [2021-12-07 01:37:59,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a994571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:37:59, skipping insertion in model container [2021-12-07 01:37:59,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:59" (3/3) ... [2021-12-07 01:37:59,760 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.05.cil-1.c [2021-12-07 01:37:59,765 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:37:59,765 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-07 01:37:59,804 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:37:59,810 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:37:59,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-07 01:37:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2021-12-07 01:37:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:37:59,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:37:59,843 INFO L514 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] [2021-12-07 01:37:59,843 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:37:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:37:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 961710808, now seen corresponding path program 1 times [2021-12-07 01:37:59,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:37:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867490145] [2021-12-07 01:37:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:37:59,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:37:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:37:59,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:38:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:38:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:38:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:38:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:38:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 01:38:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 01:38:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:38:00,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:38:00,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867490145] [2021-12-07 01:38:00,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867490145] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:38:00,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:38:00,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:38:00,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99956854] [2021-12-07 01:38:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:38:00,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:38:00,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:38:00,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:38:00,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:38:00,085 INFO L87 Difference]: Start difference. First operand has 309 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 265 states have internal predecessors, (412), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 01:38:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:38:00,537 INFO L93 Difference]: Finished difference Result 615 states and 953 transitions. [2021-12-07 01:38:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:38:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-07 01:38:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:38:00,553 INFO L225 Difference]: With dead ends: 615 [2021-12-07 01:38:00,553 INFO L226 Difference]: Without dead ends: 317 [2021-12-07 01:38:00,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:38:00,562 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 647 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:38:00,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [657 Valid, 1027 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:38:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-12-07 01:38:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 299. [2021-12-07 01:38:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 250 states have (on average 1.5) internal successors, (375), 255 states have internal predecessors, (375), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-07 01:38:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 440 transitions. [2021-12-07 01:38:00,619 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 440 transitions. Word has length 59 [2021-12-07 01:38:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:38:00,619 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 440 transitions. [2021-12-07 01:38:00,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 01:38:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2021-12-07 01:38:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:38:00,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:38:00,622 INFO L514 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] [2021-12-07 01:38:00,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:38:00,623 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:38:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:38:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash 977229526, now seen corresponding path program 1 times [2021-12-07 01:38:00,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:38:00,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112895857] [2021-12-07 01:38:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:38:00,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:38:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:38:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:38:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:38:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:38:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:38:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 01:38:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 01:38:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:38:00,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:38:00,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112895857] [2021-12-07 01:38:00,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112895857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:38:00,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:38:00,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:38:00,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342938017] [2021-12-07 01:38:00,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:38:00,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:38:00,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:38:00,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:38:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:38:00,748 INFO L87 Difference]: Start difference. First operand 299 states and 440 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 01:38:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:38:01,236 INFO L93 Difference]: Finished difference Result 524 states and 756 transitions. [2021-12-07 01:38:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:38:01,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-07 01:38:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:38:01,241 INFO L225 Difference]: With dead ends: 524 [2021-12-07 01:38:01,241 INFO L226 Difference]: Without dead ends: 435 [2021-12-07 01:38:01,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:38:01,244 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 784 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:38:01,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 1487 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:38:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-12-07 01:38:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 395. [2021-12-07 01:38:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 326 states have (on average 1.469325153374233) internal successors, (479), 333 states have internal predecessors, (479), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2021-12-07 01:38:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2021-12-07 01:38:01,291 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 59 [2021-12-07 01:38:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:38:01,291 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2021-12-07 01:38:01,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 01:38:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2021-12-07 01:38:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:38:01,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:38:01,294 INFO L514 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] [2021-12-07 01:38:01,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:38:01,295 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:38:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:38:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1739879157, now seen corresponding path program 1 times [2021-12-07 01:38:01,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:38:01,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085335911] [2021-12-07 01:38:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:38:01,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:38:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:38:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:38:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:38:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:38:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:38:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 01:38:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:01,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 01:38:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:38:01,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:38:01,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085335911] [2021-12-07 01:38:01,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085335911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:38:01,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:38:01,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:38:01,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280853437] [2021-12-07 01:38:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:38:01,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:38:01,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:38:01,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:38:01,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:38:01,392 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 01:38:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:38:01,971 INFO L93 Difference]: Finished difference Result 744 states and 1049 transitions. [2021-12-07 01:38:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:38:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-07 01:38:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:38:01,975 INFO L225 Difference]: With dead ends: 744 [2021-12-07 01:38:01,975 INFO L226 Difference]: Without dead ends: 566 [2021-12-07 01:38:01,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:38:01,977 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 1105 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:38:01,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1128 Valid, 1555 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:38:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-12-07 01:38:02,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 491. [2021-12-07 01:38:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 411 states have internal predecessors, (582), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-07 01:38:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 704 transitions. [2021-12-07 01:38:02,011 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 704 transitions. Word has length 59 [2021-12-07 01:38:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:38:02,012 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 704 transitions. [2021-12-07 01:38:02,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 01:38:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 704 transitions. [2021-12-07 01:38:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:38:02,013 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:38:02,014 INFO L514 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] [2021-12-07 01:38:02,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:38:02,014 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:38:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:38:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1661601801, now seen corresponding path program 1 times [2021-12-07 01:38:02,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:38:02,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043899617] [2021-12-07 01:38:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:38:02,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:38:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:38:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:38:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:38:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:38:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:38:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 01:38:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 01:38:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:38:02,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:38:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043899617] [2021-12-07 01:38:02,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043899617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:38:02,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:38:02,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:38:02,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562702894] [2021-12-07 01:38:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:38:02,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:38:02,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:38:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:38:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:38:02,116 INFO L87 Difference]: Start difference. First operand 491 states and 704 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-07 01:38:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:38:02,549 INFO L93 Difference]: Finished difference Result 793 states and 1119 transitions. [2021-12-07 01:38:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:38:02,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-07 01:38:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:38:02,553 INFO L225 Difference]: With dead ends: 793 [2021-12-07 01:38:02,553 INFO L226 Difference]: Without dead ends: 525 [2021-12-07 01:38:02,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-07 01:38:02,555 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 548 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:38:02,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 1863 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:38:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-12-07 01:38:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 496. [2021-12-07 01:38:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 406 states have (on average 1.438423645320197) internal successors, (584), 415 states have internal predecessors, (584), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2021-12-07 01:38:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 707 transitions. [2021-12-07 01:38:02,587 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 707 transitions. Word has length 59 [2021-12-07 01:38:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:38:02,587 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 707 transitions. [2021-12-07 01:38:02,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-07 01:38:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 707 transitions. [2021-12-07 01:38:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:38:02,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:38:02,589 INFO L514 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] [2021-12-07 01:38:02,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 01:38:02,590 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:38:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:38:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1386842187, now seen corresponding path program 1 times [2021-12-07 01:38:02,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:38:02,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807330008] [2021-12-07 01:38:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:38:02,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:38:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:38:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:38:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:38:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:38:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:38:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 01:38:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 01:38:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:38:02,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:38:02,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807330008] [2021-12-07 01:38:02,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807330008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:38:02,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:38:02,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:38:02,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266196201] [2021-12-07 01:38:02,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:38:02,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:38:02,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:38:02,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:38:02,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:38:02,691 INFO L87 Difference]: Start difference. First operand 496 states and 707 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-07 01:38:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:38:03,156 INFO L93 Difference]: Finished difference Result 815 states and 1141 transitions. [2021-12-07 01:38:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 01:38:03,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-07 01:38:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:38:03,161 INFO L225 Difference]: With dead ends: 815 [2021-12-07 01:38:03,161 INFO L226 Difference]: Without dead ends: 542 [2021-12-07 01:38:03,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:38:03,163 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 370 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:38:03,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 2045 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:38:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-12-07 01:38:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 511. [2021-12-07 01:38:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 427 states have internal predecessors, (596), 56 states have call successors, (56), 28 states have call predecessors, (56), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2021-12-07 01:38:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 722 transitions. [2021-12-07 01:38:03,196 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 722 transitions. Word has length 59 [2021-12-07 01:38:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:38:03,196 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 722 transitions. [2021-12-07 01:38:03,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-07 01:38:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 722 transitions. [2021-12-07 01:38:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:38:03,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:38:03,198 INFO L514 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] [2021-12-07 01:38:03,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 01:38:03,198 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:38:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:38:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1102686775, now seen corresponding path program 1 times [2021-12-07 01:38:03,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:38:03,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854742106] [2021-12-07 01:38:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:38:03,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:38:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:38:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:38:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:38:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:38:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:38:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:03,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 01:38:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:03,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 01:38:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:38:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:38:03,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:38:03,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854742106] [2021-12-07 01:38:03,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854742106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:38:03,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:38:03,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:38:03,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000190308] [2021-12-07 01:38:03,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:38:03,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:38:03,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:38:03,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:38:03,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:38:03,286 INFO L87 Difference]: Start difference. First operand 511 states and 722 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 01:38:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:38:03,776 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2021-12-07 01:38:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:38:03,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-07 01:38:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:38:03,781 INFO L225 Difference]: With dead ends: 905 [2021-12-07 01:38:03,781 INFO L226 Difference]: Without dead ends: 619 [2021-12-07 01:38:03,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:38:03,783 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 1072 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:38:03,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 1359 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:38:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-12-07 01:38:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 523. [2021-12-07 01:38:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 437 states have internal predecessors, (606), 57 states have call successors, (57), 29 states have call predecessors, (57), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2021-12-07 01:38:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 732 transitions. [2021-12-07 01:38:03,815 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 732 transitions. Word has length 59 [2021-12-07 01:38:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:38:03,816 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 732 transitions. [2021-12-07 01:38:03,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-07 01:38:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 732 transitions. [2021-12-07 01:38:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 01:38:03,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:38:03,818 INFO L514 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] [2021-12-07 01:38:03,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 01:38:03,818 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:38:03,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:38:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash -891457931, now seen corresponding path program 1 times [2021-12-07 01:38:03,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:38:03,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446179809] [2021-12-07 01:38:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:38:03,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:38:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:38:03,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 01:38:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:38:03,884 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 01:38:03,885 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 01:38:03,885 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-07 01:38:03,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-07 01:38:03,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:38:03,891 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:38:03,894 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:38:03,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:38:03 BoogieIcfgContainer [2021-12-07 01:38:03,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:38:03,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:38:03,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:38:03,976 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:38:03,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:59" (3/4) ... [2021-12-07 01:38:03,978 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 01:38:04,062 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 01:38:04,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:38:04,063 INFO L158 Benchmark]: Toolchain (without parser) took 5316.31ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 82.9MB in the beginning and 79.3MB in the end (delta: 3.5MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2021-12-07 01:38:04,063 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 37.8MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:38:04,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.13ms. Allocated memory is still 107.0MB. Free memory was 82.5MB in the beginning and 62.9MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-07 01:38:04,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.35ms. Allocated memory is still 107.0MB. Free memory was 62.9MB in the beginning and 59.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-07 01:38:04,064 INFO L158 Benchmark]: Boogie Preprocessor took 42.45ms. Allocated memory is still 107.0MB. Free memory was 59.5MB in the beginning and 56.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:38:04,064 INFO L158 Benchmark]: RCFGBuilder took 593.97ms. Allocated memory is still 107.0MB. Free memory was 56.4MB in the beginning and 66.6MB in the end (delta: -10.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2021-12-07 01:38:04,065 INFO L158 Benchmark]: TraceAbstraction took 4221.65ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 66.5MB in the beginning and 94.1MB in the end (delta: -27.7MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2021-12-07 01:38:04,065 INFO L158 Benchmark]: Witness Printer took 86.54ms. Allocated memory is still 130.0MB. Free memory was 94.1MB in the beginning and 79.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-07 01:38:04,067 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.15ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 37.8MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.13ms. Allocated memory is still 107.0MB. Free memory was 82.5MB in the beginning and 62.9MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.35ms. Allocated memory is still 107.0MB. Free memory was 62.9MB in the beginning and 59.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.45ms. Allocated memory is still 107.0MB. Free memory was 59.5MB in the beginning and 56.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 593.97ms. Allocated memory is still 107.0MB. Free memory was 56.4MB in the beginning and 66.6MB in the end (delta: -10.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4221.65ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 66.5MB in the beginning and 94.1MB in the end (delta: -27.7MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. * Witness Printer took 86.54ms. Allocated memory is still 130.0MB. Free memory was 94.1MB in the beginning and 79.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int m_st ; [L507] int t1_st ; [L508] int t2_st ; [L509] int t3_st ; [L510] int t4_st ; [L511] int t5_st ; [L512] int m_i ; [L513] int t1_i ; [L514] int t2_i ; [L515] int t3_i ; [L516] int t4_i ; [L517] int t5_i ; [L518] int M_E = 2; [L519] int T1_E = 2; [L520] int T2_E = 2; [L521] int T3_E = 2; [L522] int T4_E = 2; [L523] int T5_E = 2; [L524] int E_M = 2; [L525] int E_1 = 2; [L526] int E_2 = 2; [L527] int E_3 = 2; [L528] int E_4 = 2; [L529] int E_5 = 2; [L537] int token ; [L539] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L1462] COND TRUE __VERIFIER_nondet_int() [L1463] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 309 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4590 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4526 mSDsluCounter, 9336 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6640 mSDsCounter, 865 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4591 IncrementalHoareTripleChecker+Invalid, 5456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 865 mSolverCounterUnsat, 2696 mSDtfsCounter, 4591 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=6, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 289 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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! [2021-12-07 01:38:04,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc9a33a-0f7a-4e2d-b448-e1370bed2c43/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE